Simulation of quantum computation with magic states via Jordan-Wigner transformations

Abstract

Negativity in certain quasiprobability representations is a necessary condition for a quantum computational advantage. Here we define a quasiprobability representation exhibiting this property with respect to quantum computations in the magic state model. It is based on generalized Jordan-Wigner transformations, and it has a close connection to the probability representation of universal quantum computation based on the $\Lambda$ polytopes. For each number of qubits, it defines a polytope contained in the $\Lambda$ polytope with some shared vertices. It leads to an efficient classical simulation algorithm for magic state quantum circuits for which the input state is positively represented, and it outperforms previous representations in terms of the states that can be positively represented.

16 pages, 5 figures

References in corpus (24)

• Improved Simulation of Stabilizer Circuits
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Hidden Variables and the Two Theorems of John Bell
• Negativity of the Wigner function as an indicator of nonclassicality
• The Resource Theory of Stabilizer Computation
• Application of a resource theory for magic states to fault-tolerant quantum computing
• Negative Quasi-Probability as a Resource for Quantum Computation
• Hudson's Theorem for finite-dimensional quantum systems
• Trading classical and quantum computational resources
• Matchgates and classical simulation of quantum circuits
• Estimating outcome probabilities of quantum circuits using quasiprobabilities
• Wigner function negativity and contextuality in quantum computation on rebits
• Quantifying quantum speedups: improved classical simulation from tighter magic monotones
• Phase space simulation method for quantum computation with magic states on qubits
• Simulation of Qubit Quantum Circuits via Pauli Propagation
• A hidden variable model for universal quantum computation with magic states on qubits
• Characterization of solvable spin models via graph invariants
• Discrete Wigner Formalism for Qubits and Non-Contextuality of Clifford Gates on Qubit Stabilizer States
• Classical simulation of non-Gaussian fermionic circuits
• The role of cohomology in quantum computation with magic states
• Quantum circuit compilation and hybrid computation using Pauli-based computation
• Improved simulation of quantum circuits dominated by free fermionic operations
• Hidden variable model for quantum computation with magic states on qudits of any dimension
• Fast algorithms for classical specifications of stabiliser states and Clifford gates