Accuracy threshold for postselected quantum computation
Open accessThe DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
We prove an accuracy threshold theorem for fault-tolerant quantum computation based on error detection and postselection. Our proof provides a rigorous foundation for the scheme suggested by Knill, in which preparation circuits for ancilla states are protected by a concatenated error-detecting code and the preparation is aborted if an error is detected. The proof applies to independent stochastic noise but (in contrast to proofs of the quantum accuracy threshold theorem based on concatenated error-correcting codes) not to strongly-correlated adversarial noise. Our rigorously established lower bound on the accuracy threshold, $1.04\times 10^{-3}$, is well below Knill's numerical estimates.
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
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
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 4×
“We consider the same protocol as in [25], which maps 15 noisy input copies to one output copy of the desired state.”
BackgroundMethodResultInfluentialQuantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424 · cited 2×
“In particular, the quantum accuracy threshold theorem [2, 3 , 4, 5, 6, 7, 8] asserts that an arbitrarily long quantum computation can be executed reliably, provided that the noise afflicting the computer’s hardware is weaker than a certain critical value, the accuracy threshold.”
BackgroundQuantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184 · cited 10×
“Following Knill [10], the error-detecting code C1 used in our fault-tolerant constructions has parameters [[n, k, d]]=[[4,2,2]]; that is, it encodes k = 2 logical qubits in n = 4 physical qubits and has distance d = 2.”
BackgroundMethodResultInfluentialPreskill, J. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0167 · Cited by 994
Self-citationFault-tolerant quantum computation with constant error
Aharonov, D., & Ben-Or, M. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258579 · Cited by 631
Operator quantum error-correcting subsystems for self-correcting quantum memories
Bacon, D. (2006) · Physical Review A · doi:10.1103/physreva.73.012340 · Cited by 486 · cited 3×
“The second logical qubit then acts as a “gauge” qubit [22, 23] (or “spectator” qubit [10]) whose state does not affect the computation.”
BackgroundMethodFault-Tolerant Quantum Computation with Long-Range Correlated Noise
Aharonov, D., Kitaev, A., & Preskill, J. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.050504 · Cited by 243 · cited 1×
“The threshold theorem based on concatenated error correcting codes also applies to nonstochastic noise models in which fault paths are added in superposition [2, 20, 7, 21].”
BackgroundSelf-citationSubsystem 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
Quantum error correction for beginners
Devitt, S. J., Munro, W. J., & Nemoto, K. (2013) · Reports on Progress in Physics · doi:10.1088/0034-4885/76/7/076001 · Cited by 759
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
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
Self-citationLayered architecture for quantum computing
Jones, N. C., Van Meter, R., Fowler, A. G., McMahon, P. L., Kim, J., Ladd, T. D., & Yamamoto, Y. (2012) · Physical Review X · doi:10.1103/physrevx.2.031007 · Cited by 332
“As examples, the C 4 /C 6 code [91, 92] and Bacon-Shor codes [32–34 , 93 ] Onekeymessage is worth emphasizing.”
Method
Metadata
- Authors
- Aliferis, P., Gottesman, D., & Preskill, J.
- Venue
- Quantum Information and Computation
- Publisher
- Rinton Press
- Published
- 2008-03
- Volume
- 8
- Issue
- 3&4
- Pages
- 181-244
- ISSN
- 1533-7146 (ISSN-L)
- OpenAlex
- W1677920491
- Cited by
- 96
- References
- 9
- FWCI
- 14.84
- 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: Accuracy threshold for postselected quantum computation. https://app.cochat.ai/papers/10.26421/qic8.3-4-1
- The paper
- Aliferis, P., Gottesman, D., & Preskill, J. (2008). Accuracy threshold for postselected quantum computation. Quantum Information and Computation. https://doi.org/10.26421/qic8.3-4-1
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.