Related papers: Gaussian decomposition of magic states for matchga…
We present an algorithm for efficiently simulating a quantum circuit in the graph formalism. In the graph formalism, we represent states as a linear combination of graphs with Clifford operations on their vertices. We show how a…
We investigate bosonic Gaussian quantum states on an infinite cubic lattice in arbitrary spatial dimensions. We derive general properties of such states as ground states of quadratic Hamiltonians for both critical and non-critical cases.…
Bayesian analysis is a framework for parameter estimation that applies even in uncertainty regimes where the commonly used local (frequentist) analysis based on the Cram\'er-Rao bound is not well defined. In particular, it applies when no…
Quantum computers have recently made great strides and are on a long-term path towards useful fault-tolerant computation. A dominant overhead in fault-tolerant quantum computation is the production of high-fidelity encoded qubits, called…
Detecting when a quantum state leaves the efficiently simulable fermionic Gaussian regime is a central task for benchmarking quantum devices and certifying fermionic magic resources. We develop practical tests and witnesses based on…
The Clifford hierarchy, introduced by Gottesman and Chuang in 1999, is an increasing sequence of sets of quantum gates crucial to the gate teleportation model for fault-tolerant quantum computation. Gates in the hierarchy can be…
Magic is a property of quantum states that enables universal fault-tolerant quantum computing using simple sets of gate operations. Understanding the mechanisms by which magic is created or destroyed is, therefore, a crucial step towards…
Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…
We present a new criterion that determines whether a fermionic state is a convex combination of pure Gaussian states. This criterion is complete and characterizes the set of convex-Gaussian states from the inside. If a state passes a…
Flexible characterization techniques that identify and quantify experimental imperfections under realistic assumptions are crucial for the development of quantum computers. Gate set tomography is a characterization approach that…
The nonstabilizerness of quantum states is a necessary resource for universal quantum computation, yet its characterization is notoriously demanding. Quantifying nonstabilizerness typically requires an exponential number of measurements and…
The mapping of fermionic states onto qubit states, as well as the mapping of fermionic Hamiltonian into quantum gates enables us to simulate electronic systems with a quantum computer. Benefiting the understanding of many-body systems in…
In quantum control theory, a question of fundamental and practical interest is how an arbitrary unitary transformation can be decomposed into minimum number of elementary rotations for implementation, subject to various physical…
We introduce a quantum convolution and a conceptual framework to study states in discrete-variable (DV) quantum systems. All our results suggest that stabilizer states play a role in DV quantum systems similar to the role Gaussian states…
The quantum theory of the electromagnetic field enables the description of multiphoton states exhibiting nonclassical statistical properties, often reflected in non-Gaussian phase-space distributions. While non-Gaussianity alone does not…
The perfect NOT transformation, probabilistic perfect NOT transformation and conjugate transformation are studied. Perfect NOT transformation criteria on a quantum state set $S$ of a qubit are obtained. Two necessary and sufficient…
In the circuit model, quantum computers rely on the availability of a universal quantum gate set. A particularly intriguing example is a set of two-qubit only gates: matchgates, along with SWAP (the exchange of two qubits). In this paper,…
Machine learning methods have been used to infer specific properties of limited families of optical quantum states, but a unified model that predicts a broad range of properties for practically relevant-especially multimode…
We analyze the stabilizability of entangled two-mode Gaussian states in three benchmark dissipative models: local damping, dissipators engineered to preserve two-mode squeezed states, and cascaded oscillators. In the first two models, we…
We present \texttt{lcg\_plus}, an open-source Python library for the simulation of continuous-variable quantum circuits with both generaldyne and photon-number-resolving detector capabilities. Our framework merges the linear combination of…