A comparative code study for quantum fault tolerance
The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
We study a comprehensive list of quantum codes as candidates for codes used at the physical level in a fault-tolerant code architecture. Using the Aliferis-Gottesman-Preskill (AGP) ex-Rec method we calculate the pseudo-threshold for these codes against depolarizing noise at various levels of overhead. We estimate the logical noise rate as a function of overhead at a physical error rate of $p_0=1 \times 10^{-4}$. The Bacon-Shor codes and the Golay code are the best performers in our study.
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
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 9×
“We specifically chose to include the [[21 , 3 , 5]] (a concatenated [[7 , 1 , 4]] 8 ) and the [[60 , 4 , 10]] (a concatenated [[15 , 1 , 8]] 16 ) code from the family of dual-containing polynomial codes over GF (2 m ) , because they are the smallest error-correcting polynomial codes in this family.”
BackgroundMethodInfluentialImproved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515 · cited 2×
“In general, any unitary stabilizer circuit has an equivalent circuit with O ( n 2 ) gates and O (log n ) depth [48].”
BackgroundMethodQuantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184 · cited 7×
“However to demonstrate that this restriction to CSS codes is warranted we also consider the non-CSS 5-qubit code [[5, 1, 3]] which is the smallest code that can correct a single error.”
BackgroundMethodInfluentialStabilizer Codes and Quantum Error Correction
Gottesman, D. (1997) · arXiv · doi:10.48550/arxiv.quant-ph/9705052 · Cited by 753
Fault-Tolerant Quantum Computation with Constant Error Rate
Aharonov, D., & Ben-Or, M. (2008) · SIAM Journal on Computing · doi:10.1137/s0097539799359385 · Cited by 513
Quantum codes on a lattice with boundary
Bravyi, S. B., & Kitaev, A. Y. (1998) · arXiv · doi:10.48550/arxiv.quant-ph/9811052 · Cited by 394
Resilient quantum computation: error models and thresholds
Knill, E., Laflamme, R., & Zurek, W. H. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0166 · Cited by 346 · cited 3×
“PARAMETERS NOTES [[5, 1, 3]] non-CSS five qubit code [24] [[7, 1, 3]] Steane’s 7-qubit code (doubly-even dual-containing) [25] [[9, 1, 3]], [[25, 1, 5]], [[49, 1, 7]], [[81, 1, 9]] Bacon-Shor codes [14] [[15, 1, 3]] Quantum Reed-Muller code [19, 20] [[13, 1, 3]], [[41, 1, 5]], [[85, 1, 7]] Surface codes [17, 18] [[21,…”
BackgroundMethodEfficient networks for quantum factoring
Beckman, D., Chari, A. N., Devabhaktuni, S., & Preskill, J. (1996) · Physical Review A · doi:10.1103/physreva.54.1034 · Cited by 268
Subsystem Fault Tolerance with the Bacon-Shor Code
Aliferis, P., & Cross, A. W. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.220502 · Cited by 203
Self-citation
Cited by
Quantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
Self-citationRoads towards fault-tolerant universal quantum computation
Campbell, E. T., Terhal, B. M., & Vuillot, C. (2017) · Nature · doi:10.1038/nature23460 · Cited by 596
Self-citationUniversal Quantum Gate Set Approaching Fault-Tolerant Thresholds with Superconducting Qubits
Chow, J. M., Gambetta, J. M., Córcoles, A. D., Merkel, S. T., Smolin, J. A., Rigetti, C., Poletto, S., Keefe, G. A., Rothwell, M. B., Rozen, J. R., et al. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.060501 · Cited by 371
An introduction to quantum error correction and fault-tolerant quantum computation
Gottesman, D. (2010) · Proceedings of Symposia in Applied Mathematics · doi:10.1090/psapm/068/2762145 · Cited by 370
Flag fault-tolerant error correction with arbitrary distance codes
Chamberland, C., & Beverland, M. E. (2018) · Quantum · doi:10.22331/q-2018-02-08-53 · Cited by 159
Metadata
- Authors
- Cross, A. W., DiVincenzo, D. P., & Terhal, B. M.
- Venue
- Quantum Information and Computation
- Publisher
- Rinton Press
- Published
- 2009-07
- Volume
- 9
- Issue
- 7&8
- Pages
- 541-572
- ISSN
- 1533-7146 (ISSN-L)
- OpenAlex
- W2951109366
- Cited by
- 48
- References
- 9
- FWCI
- 2.89
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.