A magic state’s fidelity can be superior to the operations that created it
Open accessThe DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
The leading approach to fault tolerant quantum computing requires a continual supply of magic states . When a new magic state is first encoded, its initial fidelity will be too poor for use in the computation. This necessitates a resource-intensive distillation process that occupies the majority of the computer's hardware; creating magic states with a high initial fidelity minimizes this cost and is therefore crucial for practical quantum computing. Here we present the surprising and encouraging result that raw magic states can have a fidelity significantly better than that of the two-qubit gate operations used to construct them. Our protocol exploits post-selection without significantly slowing the rate of generation and tolerates finite error rates in initializations, measurements and single-qubit gates. This approach may dramatically reduce the size of the hardware needed for a given quantum computing task.
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
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
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
Fault-Tolerant Quantum Computation with High Threshold in Two Dimensions
Raussendorf, R., & Harrington, J. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.190504 · Cited by 812
Surface code quantum computing by lattice surgery
Horsman, D., Fowler, A. G., Devitt, S., & Meter, R. V. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/12/123011 · Cited by 598
High-threshold universal quantum computation on the surface code
Fowler, A. G., Stephens, A. M., & Groszkowski, P. (2009) · Physical Review A · doi:10.1103/physreva.80.052312 · Cited by 486
Restrictions on Transversal Encoded Quantum Gate Sets
Eastin, B., & Knill, E. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.110502 · Cited by 457
A fault-tolerant one-way quantum computer
Raussendorf, R., Harrington, J., & Goyal, K. (2006) · Annals of Physics · doi:10.1016/j.aop.2006.01.012 · Cited by 397
Gauge color codes: optimal transversal gates and gauge fixing in topological stabilizer codes
Bombín, H. (2015) · New Journal of Physics · doi:10.1088/1367-2630/17/8/083002 · Cited by 217
Surface code implementation of block code state distillation
Fowler, A. G., Devitt, S. J., & Jones, C. (2013) · Scientific Reports · doi:10.1038/srep01939 · Cited by 99
Research works printed but not linked: 15
- 10.1109/TIT.2011.2161917 · DOI · Paper page
- 10.1103/PhysRevLett.112.010505 · DOI · Paper page
- 10.1103/PhysRevLett.111.090505 · DOI · Paper page
- 10.1103/PhysRevLett.113.080501 · DOI · Paper page
- 10.1016/S0003-4916(02)00018-0 · DOI · Paper page
- 10.1063/1.1499754 · DOI · Paper page
- Raussendorf R, 2007, New J. Phys., 9, 199, 10.1088/1367-2630/9/6/199 · DOI · Paper page
- 10.1103/PhysRevA.86.052329 · DOI · Paper page
- 10.1103/PhysRevA.87.042305 · DOI · Paper page
- 10.1103/PhysRevX.2.041021 · DOI · Paper page
- 10.1103/PhysRevLett.113.230501 · DOI · Paper page
- 10.1103/PhysRevA.81.012310 · DOI
- 10.1103/PhysRevA.90.062311 · DOI
- 10.1103/PhysRevA.85.062330 · DOI
- 10.1007/s12532-009-0002-8 · DOI · Paper page
Cited by
A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
Litinski, D. (2019) · Quantum · doi:10.22331/q-2019-03-05-128 · Cited by 408
The future of quantum computing with superconducting qubits
Bravyi, S., Dial, O., Gambetta, J. M., Gil, D., & Nazario, Z. (2022) · Journal of Applied Physics · doi:10.1063/5.0082975 · Cited by 334
Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
Bourassa, J. E., Alexander, R. N., Vasmer, M., Patil, A., Tzitrin, I., Matsuura, T., Su, D., Baragiola, B. Q., Guha, S., Dauphinais, G., et al. (2021) · Quantum · doi:10.22331/q-2021-02-04-392 · Cited by 302
Magic State Distillation: Not as Costly as You Think
Litinski, D. (2019) · Quantum · doi:10.22331/q-2019-12-02-205 · Cited by 220
Quantum computation with realistic magic-state factories
O'Gorman, J., & Campbell, E. T. (2017) · Physical Review A · doi:10.1103/physreva.95.032338 · Cited by 158
Metadata
- Authors
- Li, Y.
- Venue
- New Journal of Physics
- Publisher
- IOP Publishing
- Published
- 2015-02-13
- Volume
- 17
- Issue
- 2
- Pages
- 023037
- ISSN
- 1367-2630 (ISSN-L)
- OpenAlex
- W2045342516
- Cited by
- 88
- References
- 9
- FWCI
- 2.50
- Type
- journal article
- Language
- en
- Open access
- gold
- Licence
- iopscience.iop.org/info/page/text-and-data-mining (tdm)
- creativecommons.org/licenses/by/3.0/ (vor)
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: A magic state’s fidelity can be superior to the operations that created it. https://app.cochat.ai/papers/10.1088/1367-2630/17/2/023037
- The paper
- Li, Y. (2015). A magic state’s fidelity can be superior to the operations that created it. New Journal of Physics. https://doi.org/10.1088/1367-2630/17/2/023037
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.