On the extremal points of the $\Lambda$-polytopes and classical simulation of quantum computation with magic states

Abstract

We investigate the $\Lambda$-polytopes, a convex-linear structure recently defined and applied to the classical simulation of quantum computation with magic states by sampling. There is one such polytope, ${\Lambda }_n$, for every number $n$ of qubits. We establish two properties of the family $\{{\Lambda }_n,n\in \mathbb{N}\}$, namely (i) Any extremal point (vertex) $A_{\alpha }\in {\Lambda }_m$ can be used to construct vertices in ${\Lambda }_n$, for all $n>m$. (ii) For vertices obtained through this mapping, the classical simulation of quantum computation with magic states can be efficiently reduced to the classical simulation based on the preimage $A_{\alpha }$. In addition, we describe a new class of vertices in ${\Lambda }_2$ which is outside the known classification. While the hardness of classical simulation remains an open problem for most extremal points of ${\Lambda }_n$, the above results extend efficient classical simulation of quantum computations beyond the presently known range.

arXiv comment19 pages

References in corpus (15)

• Efficient classical simulation of slightly entangled quantum computations
• Quantum Teleportation is a Universal Computational Primitive
• Quantum Algorithms Revisited
• Contextuality supplies the magic for quantum computation
• The Resource Theory of Stabilizer Computation
• Application of a resource theory for magic states to fault-tolerant quantum computing
• Improved classical simulation of quantum circuits dominated by Clifford gates
• Most quantum states are too entangled to be useful as computational resources
• Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space
• Estimating outcome probabilities of quantum circuits using quasiprobabilities
• Universal quantum computation with little entanglement
• Classical simulation versus universality in measurement based quantum computation
• Phase space simulation method for quantum computation with magic states on qubits
• A hidden variable model for universal quantum computation with magic states on qubits
• Contextuality Test of the Nonclassicality of Variational Quantum Eigensolvers