Exponential lower bound on the stabilizer rank of magic states
36No. 1,369 in all physics · No. 65 in Quantum Information and Foundations
The stabilizer rank $\chi(\psi)$ is the least number of stabilizer states whose linear combination equals $\psi$. Prove $\chi(\left|T\right>^{\otimes n}) \ge 2^{c n}$ for some constant $c > 0$, where $\left|T\right> = (\left|0\right> + e^{i \pi/4} \left|1\right>)/\sqrt{2}$. Known upper bounds are of order $2^{0.4 n}$ (approximate exponent) and known lower bounds are only polynomial in n.
What would settle it
A proof of an exponential lower bound, or a construction with subexponential rank.
No solutions, ideas or subproblems yet.
Details, signature and history
- Kind
- Well-posed question
- Answer
- Proof
- Posed
- 2016
- Topic review
- R. Orus, Tensor networks for complex quantum systems, Nature Reviews Physics, 2019. Link
- Record
- Revision 2 · notation repaired by the platform · compiled by AI, not yet reviewed by an editor
- Batch approval
- Approved for the batch by Victor Galitski (ORCID 0000-0001-5532-1096) · approval record · bundle This approves the batch, not each problem (what it means).
- AI systems
- AI systems used to prepare this seed revision, as listed in its record: ai:gpt-5.5 (how the seed revision was made)
- Earlier revisions
- revision 1 bundle
Proof
- Fingerprint
- d5c69c47dcde…
- Public log
- Entry 1,976, in checkpoint 2,123
- In the log by
- Block 969,698, 2026-10-03
This text was in the PubPhys log by that date. The date says nothing about when the problem was first posed.
Comments (0)
Comments are not records: they are not signed, stamped or logged. How comments work
No comments yet.
Sign in to comment.