• Corpus ID: 239009934

New techniques for bounding stabilizer rank

@article{Lovitz2021NewTF,
  title={New techniques for bounding stabilizer rank},
  author={Benjamin Lovitz and Vincent Steffan},
  journal={ArXiv},
  year={2021},
  volume={abs/2110.07781}
}
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… 

References

SHOWING 1-10 OF 28 REFERENCES
On representations by low-degree polynomials
  • R. Smolensky
  • Mathematics, Computer Science
    Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science
  • 1993
In the first part of the paper we show that a subset S of a boolean cube B/sub n/ embedded in the projective space P/sup n/ can be approximated by a subset of B/sub n/ defined by nonzeroes of a
Clifford group, stabilizer states, and linear and quadratic operations over GF(2)
We describe stabilizer states and Clifford group operations using linear operations and quadratic forms over binary vector spaces. We show how the n-qubit Clifford group is isomorphic to a group with
Hudson's theorem for finite-dimensional quantum systems
We show that, on a Hilbert space of odd dimension, the only pure states to possess a non-negative Wigner function are stabilizer states. The Clifford group is identified as the set of unitary
Simulation of quantum circuits by low-rank stabilizer decompositions
TLDR
A comprehensive mathematical theory of the stabilizerRank and the related approximate stabilizer rank is developed and a suite of classical simulation algorithms with broader applicability and significantly improved performance over the previous state-of-the-art are presented.
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
TLDR
It is proved that depth k circuits with gates NOT, OR and MODp where p is a prime require Exp(&Ogr;(n1/2k)) gates to calculate MODr functions for any r ≠ pm.
On the Foundations of Combinatorial Theory IV Finite Vector Spaces and Eulerian Generating Functions
Abstract : The paper studies combinatorial aspects of the lattice of subspaces of a vector space over a finite field and its use in deriving classical and new q-identities. Set theoretic
Multi-partite separable states with unique decompositions and construction of three qubit entanglement with positive partial transpose
We investigate conditions on a finite set of multi-partite product vectors for which separable states with corresponding product states have unique decompositions, and show that this is true in most
The Heisenberg Representation of Quantum Computers
Since Shor`s discovery of an algorithm to factor numbers on a quantum computer in polynomial time, quantum computation has become a subject of immense interest. Unfortunately, one of the key features
Stabilizer Codes and Quantum Error Correction
TLDR
An overview of the field of quantum error correction and the formalism of stabilizer codes is given and a number of known codes are discussed, the capacity of a quantum channel, bounds on quantum codes, and fault-tolerant quantum computation are discussed.
Lower Bounds on Stabilizer Rank
TLDR
The stabilizer rank of a quantum state ψ is the minimal r such that |ψ〉 = ∑j=1 cj ∣ ∣ so that ψ ≥ 1 and r ≥ 1.
...
1
2
3
...