Lower bounds on the non-Clifford resources for quantum computations
Open accessThe DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Abstract
Treating stabilizer operations as free, we establish lower bounds on the number of resource states, also known as magic states, needed to perform various quantum computing tasks. Our bounds apply to adaptive computations using measurements with an arbitrary number of stabilizer ancillas. We consider (1) resource state conversion, (2) single-qubit unitary synthesis, and (3) computational subroutines including the quantum adder and the multiply-controlled Z gate. To prove our resource conversion bounds we introduce two new monotones, the stabilizer nullity and the dyadic monotone, and make use of the already-known stabilizer extent. We consider conversions that borrow resource states, known as catalyst states, and return them at the end of the algorithm. We show that catalysis is necessary for many conversions and introduce new catalytic conversions, some of which are optimal. By finding a canonical form for post-selected stabilizer computations, we show that approximating a single-qubit unitary to within diamond-norm precision ɛ requires at least 1/7 ⋅ log 2 (1/ ɛ ) − 4/3 T -states on average. This is the first lower bound that applies to synthesis protocols using fall-back, mixing techniques, and where the number of ancillas used can depend on ɛ . Up to multiplicative factors, we optimally lower bound the number of T or CCZ states needed to implement the ubiquitous modular adder and multiply-controlled- Z operations. When the probability of Pauli measurement outcomes is 1/2, some of our bounds become tight to within a small additive constant.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Elementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311
Surface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059 · cited 1×
“Many promising architectures for universal fault-tolerant quantum computing [20, 34] perform computation by applying stabilizer operations to carefully prepared resource states known as magic states [6, 13, 38].”
BackgroundGottesman, D., & Chuang, I. L. (1999) · Nature · doi:10.1038/46503 · Cited by 1,860
Universal quantum computation with ideal Clifford gates and noisy ancillas
Bravyi, S., & Kitaev, A. (2005) · Physical Review A · doi:10.1103/physreva.71.022316 · Cited by 1,525 · cited 1×
“Many promising architectures for universal fault-tolerant quantum computing [20, 34] perform computation by applying stabilizer operations to carefully prepared resource states known as magic states [6, 13, 38].”
BackgroundQuantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184 · cited 1×
“Many promising architectures for universal fault-tolerant quantum computing [20, 34] perform computation by applying stabilizer operations to carefully prepared resource states known as magic states [6, 13, 38].”
BackgroundRoads towards fault-tolerant universal quantum computation
Campbell, E. T., Terhal, B. M., & Vuillot, C. (2017) · Nature · doi:10.1038/nature23460 · Cited by 596 · cited 1×
“Many promising architectures for universal fault-tolerant quantum computing [20, 34] perform computation by applying stabilizer operations to carefully prepared resource states known as magic states [6, 13, 38].”
BackgroundSelf-citationRestrictions on Transversal Encoded Quantum Gate Sets
Eastin, B., & Knill, E. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.110502 · Cited by 457 · cited 1×
“On the other hand, due to restrictions imposed by error correction [3, 7, 18, 40], the resource states tend to be produced by hefty distillation protocols [5, 12, 27, 33], that dominate the space-time overhead of the overall computation.”
BackgroundMinimal universal two-qubit controlled-NOT-based circuits
Shende, V. V., Markov, I. L., & Bullock, S. S. (2004) · Physical Review A · doi:10.1103/physreva.69.062321 · Cited by 288
Halving the cost of quantum addition
Gidney, C. (2018) · Quantum · doi:10.22331/q-2018-06-18-74 · Cited by 279
Cited by
Leone, L., Oliviero, S. F. E., & Hamma, A. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.050402 · Cited by 276
Scalable Measures of Magic Resource for Quantum Computers
Haug, T., & Kim, M. S. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.010301 · Cited by 104
“Magic quantifies a lower bound on the non-stabilizer resources needed to synthesize a particular state or unitary [5, 20, 25].”
Beverland, M. E., Kubica, A., & Svore, K. M. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020341 · Cited by 82
Self-citationEarly fault-tolerant simulations of the Hubbard model
Campbell, E. T. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac3110 · Cited by 81
Self-citationBell Sampling from Quantum Circuits
Hangleiter, D., & Gullans, M. J. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.020601 · Cited by 28
“We further show that the Bell samples can be used to efficiently measure the stabilizer nullity—a magic monotone [19]—and give a protocol to efficiently learn a full description of any quantum state that can be prepared by a circuit with low T -count.”
Method
Metadata
- Authors
- Beverland, M., Campbell, E., Howard, M., & Kliuchnikov, V.
- Venue
- Quantum Science and Technology
- Publisher
- IOP Publishing
- Published
- 2020-05-28
- Volume
- 5
- Issue
- 3
- Pages
- 035009
- ISSN
- 2058-9565 (ISSN-L)
- OpenAlex
- W2934956484
- Cited by
- 140
- References
- 14
- FWCI
- 3.88
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Lower bounds on the non-Clifford resources for quantum computations. https://app.cochat.ai/papers/10.1088/2058-9565/ab8963
- The paper
- Beverland, M., Campbell, E., Howard, M., & Kliuchnikov, V. (2020). Lower bounds on the non-Clifford resources for quantum computations. Quantum Science and Technology. https://doi.org/10.1088/2058-9565/ab8963
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.