New techniques for bounding stabilizer rank
arXiv:2110.07781 · doi:10.22331/q-2022-04-20-692
Abstract
In this work, we present number-theoretic and algebraic-geometric techniques for bounding the stabilizer rank of quantum states. First, we refine a number-theoretic theorem of Moulton to exhibit an explicit sequence of product states with exponential stabilizer rank but constant approximate stabilizer rank, and to provide alternate (and simplified) proofs of the best-known asymptotic lower bounds on stabilizer rank and approximate stabilizer rank, up to a log factor. Second, we find the first non-trivial examples of quantum states with multiplicative stabilizer rank under the tensor product. Third, we introduce and study the generic stabilizer rank using algebraic-geometric techniques.
arXiv comment22 pages. Feedback welcome!
References in corpus (14)
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Instantaneous non-local computation of low T-depth quantum circuits
- The Heisenberg Representation of Quantum Computers
- Hudson's Theorem for finite-dimensional quantum systems
- Improved classical simulation of quantum circuits dominated by Clifford gates
- Trading classical and quantum computational resources
- Simulation of quantum circuits by low-rank stabilizer decompositions
- The Clifford group, stabilizer states, and linear and quadratic operations over GF(2)
- Lower bounds on the non-Clifford resources for quantum computations
- Improved upper bounds on the stabilizer rank of magic states
- Entangled subspaces and generic local state discrimination with pre-shared entanglement
- Multi-partite separable states with unique decompositions and construction of three qubit entanglement with positive partial transpose
- A generalization of Kruskal's theorem on tensor decomposition
- Lower Bounds on Stabilizer Rank