All pure fermionic non-Gaussian states are magic states for matchgate computations
arXiv:1905.08584 · doi:10.1103/PhysRevLett.123.080503
Abstract
Magic states were introduced in the context of Clifford circuits as a resource that elevates classically simulatable computations to quantum universal capability, while maintaining the same gate set. Here we study magic states in the context of matchgate (MG) circuits, where the notion becomes more subtle, as MGs are subject to locality constraints and also the SWAP gate is not available. Nevertheless a similar picture of gate-gadget constructions applies, and we show that every pure fermionic state which is non-Gaussian, i.e. which cannot be generated by MGs from a computational basis state, is a magic state for MG computations. This result has significance for prospective quantum computing implementation in view of the fact that MG circuit evolutions coincide with the quantum physical evolution of non-interacting fermions.
arXiv comment5+5 pages, 2 figures. Accepted manuscript
References in corpus (23)
- Quantum Computation with Quantum Dots
- Anyons in an exactly solved model and beyond
- Unpaired Majorana fermions in quantum wires
- Spins in few-electron quantum dots
- Theory of ultracold Fermi gases
- Quantum Teleportation is a Universal Computational Primitive
- Improved Simulation of Stabilizer Circuits
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- A Mott insulator of fermionic atoms in an optical lattice
- Negative Quasi-Probability as a Resource for Quantum Computation
- Classical simulation of noninteracting-fermion quantum circuits
- Trading classical and quantum computational resources
- Universal Quantum Computation with the nu=5/2 Fractional Quantum Hall State
- Entangling operations and their implementation using a small amount of entanglement
- Matchgates and classical simulation of quantum circuits
- Efficient classical simulation of matchgate circuits with generalized inputs and measurements
- BCS-like Modewise Entanglement of Fermion Gaussian States
- Matchgate and space-bounded quantum computations are equivalent
- Extending matchgates into universal quantum computation
- Classical simulation of fermionic linear optics augmented with noisy ancillas
- Universal extensions of restricted classes of quantum operations
- Mode-entanglement of Gaussian fermionic states
- Geometries for universal quantum computation with matchgates
Cited by in corpus (30)
- Computational advantage of quantum random sampling
- Measuring magic on a quantum processor
- Computational power of one- and two-dimensional dual-unitary quantum circuits
- Free fermions behind the disguise
- Fermion Sampling: a robust quantum computational advantage scheme using fermionic linear optics and magic input states
- Characterization of solvable spin models via graph invariants
- Complexity of quantum circuits via sensitivity, magic, and coherence
- Classical simulation of non-Gaussian fermionic circuits
- Computational power of matchgates with supplementary resources
- Gravitational back-reaction is magical
- Teleporting quantum information encoded in fermionic modes
- Efficient learning of quantum states prepared with few fermionic non-Gaussian gates
- Complexity of Fermionic Dissipative Interactions and Applications to Quantum Computing
- Improved simulation of quantum circuits dominated by free fermionic operations
- Entanglement phase diagrams from partial transpose moments
- Characterization of variational quantum algorithms using free fermions
- The non-stabilizerness of fermionic Gaussian states
- Quantifying fermionic nonlinearity of quantum circuits
- Fermionic Magic Resources of Quantum Many-Body Systems
- Disentangling magic states with classically simulable quantum circuits
- Linear and Non-Linear Response of Quadratic Lindbladians
- The Hadamard gate cannot be replaced by a resource state in universal quantum computation
- Persistent non-Gaussian correlations in out-of-equilibrium Rydberg atom arrays
- Gaining confidence on the correct realization of arbitrary quantum computations
- Fermionic anyons: entanglement and quantum computation from a resource-theoretic perspective
- Classifying fermionic states via many-body correlation measures
- Complexity of Quantum Trajectories
- Spacetime quantum mechanics for bosonic and fermionic systems
- Optimizing Sparse SYK
- Approximate private quantum channels on fermionic Gaussian systems