Improved bounds on stabilizer extent and Clifford rank
quant-ph
Submitted: 2026-10-05
Updated: 2026-10-05
Comments: 31 pages
License: http://creativecommons.org/licenses/by/4.0/
The gist: We prove that every pure state of stabilizer rank at most k has stabilizer extent at most 2 O(sqrt k (k+1)), and establish the analogous bound for the squared Clifford coefficient norm of
Abstract
We prove that every pure state of stabilizer rank at most k has stabilizer extent at most 2 O(sqrt k (k+1)), and establish the analogous bound for the squared Clifford coefficient norm of Clifford-rank- k operators. This implies stabilizer fidelity at least 2-O(sqrt k (k+1)), resolving the quantitative conjecture of (Mehraban-Tamasbi, STOC, 2025), and proves an Ω(n 2/ n) lower bound for the approximate stabilizer rank of tensor powers of any non-stabilizer qubit state. The latter result generalizes the best-known lower bound for tensor powers of T-states (Mehraban-Tamasbi, STOC, 2024) to arbitrary non-stabilizer qubit states, including magic states. As a consequence of the Clifford rank--norm inequality, we obtain an Ω(n 2/ n) lower bound for exact representations of n-bit AND function by quadratic phases, improving the previous best-known linear bound. Further consequences rule out pseudorandom state and unitary ensembles with approximate stabilizer and Clifford rank O((n) 2/ n), respectively, a n improvement over prior work (Kalra-Sinha, Quantum, 2026). We also obtain tomography algorithms for states of stabilizer rank at most k, with poly(n)2 O(sqrt k (k+1)) time and copy complexity, a nearly square-root improvement in the exponent over the best-known algorithm.
Sources
- Tomography of quantum states with bounded extent
- Marton's conjecture in polynomial time
- Improved Simulation of Stabilizer Circuits
- Simulation of quantum circuits by low-rank stabilizer decompositions
- Improved classical simulation of quantum circuits dominated by Clifford gates
- Trading classical and quantum computational resources
- Learning Clifford-structured quantum unitaries and Hamiltonians
- The Clifford group, stabilizer states, and linear and quadratic operations over GF(2)
- A note on tomography of states with low stabilizer rank
- Entanglement in the stabilizer formalism
- Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom
- Stabilizer Codes and Quantum Error Correction
- The Heisenberg Representation of Quantum Computers
- Stabilizer extent is not multiplicative
- Pseudorandom States, Non-Cloning Theorems and Quantum Money
- Stabilizer Ranks, Barnes Wall Lattices and Magic Monotones
- Stabilizer rank and higher-order Fourier analysis
- New techniques for bounding stabilizer rank
- Quadratic Lower bounds on the Approximate Stabilizer Rank: A Probabilistic Approach
- Improved bounds for testing low stabilizer complexity states
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians