The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
Application of a Resource Theory for Magic States to Fault-Tolerant Quantum Computing
Open accessAbstract
Motivated by their necessity for most fault-tolerant quantum computation schemes, we formulate a resource theory for magic states. First, we show that robustness of magic is a well-behaved magic monotone that operationally quantifies the classical simulation overhead for a Gottesman-Knill-type scheme using ancillary magic states. Our framework subsequently finds immediate application in the task of synthesizing non-Clifford gates using magic states. When magic states are interspersed with Clifford gates, Pauli measurements, and stabilizer ancillas-the most general synthesis scenario-then the class of synthesizable unitaries is hard to characterize. Our techniques can place nontrivial lower bounds on the number of magic states required for implementing a given target unitary. Guided by these results, we have found new and optimal examples of such synthesis.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Decoding by Linear Programming
Candes, E. J., & Tao, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858979 · Cited by 7,121
Gottesman, 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
Improved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184
Contextuality supplies the ‘magic’ for quantum computation
Howard, M., Wallman, J., Veitch, V., & Emerson, J. (2014) · Nature · doi:10.1038/nature13460 · Cited by 616
Self-citationVidal, G., & Tarrach, R. (1999) · Physical Review A · doi:10.1103/physreva.59.141 · Cited by 599
Roads towards fault-tolerant universal quantum computation
Campbell, E. T., Terhal, B. M., & Vuillot, C. (2017) · Nature · doi:10.1038/nature23460 · Cited by 596
Self-citationRobustness of Coherence: An Operational and Observable Measure of Quantum Coherence
Napoli, C., Bromley, T. R., Cianciaruso, M., Piani, M., Johnston, N., & Adesso, G. (2016) · Physical Review Letters · doi:10.1103/physrevlett.116.150502 · Cited by 581
The resource theory of stabilizer quantum computation
Veitch, V., Hamed Mousavian, S. A., Gottesman, D., & Emerson, J. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/1/013009 · Cited by 501
Cited by
Chitambar, E., & Gour, G. (2019) · Reviews of Modern Physics · doi:10.1103/revmodphys.91.025001 · Cited by 1,276
Practical Quantum Error Mitigation for Near-Future Applications
Endo, S., Benjamin, S. C., & Li, Y. (2018) · Physical Review X · doi:10.1103/physrevx.8.031027 · Cited by 562
Simulation of quantum circuits by low-rank stabilizer decompositions
Bravyi, S., Browne, D., Calpin, P., Campbell, E., Gosset, D., & Howard, M. (2019) · Quantum · doi:10.22331/q-2019-09-02-181 · Cited by 302
Self-citationHalving the cost of quantum addition
Gidney, C. (2018) · Quantum · doi:10.22331/q-2018-06-18-74 · Cited by 279
“In [14] it is proven that a Toffoli gate requires at least 4 T gates, though the specific nature of the proof does not eliminate the possibility that n Toffolis could be implemented with fewer than 4n T gates for some large n.”
BackgroundLeone, L., Oliviero, S. F. E., & Hamma, A. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.050402 · Cited by 276
Metadata
- Authors
- Howard, M., & Campbell, E.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2017-03-03
- Volume
- 118
- Issue
- 9
- Pages
- 090501-090501
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2524307097
- Cited by
- 387
- References
- 45
- FWCI
- 10.82
- 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: Application of a Resource Theory for Magic States to Fault-Tolerant Quantum Computing. https://app.cochat.ai/papers/10.1103/physrevlett.118.090501
- The paper
- Howard, M., & Campbell, E. (2017). Application of a Resource Theory for Magic States to Fault-Tolerant Quantum Computing. Physical Review Letters. https://doi.org/10.1103/physrevlett.118.090501
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.