Fibonacci scheme for fault-tolerant quantum computation
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
We rigorously analyze Knill's Fibonacci scheme for fault-tolerant quantum computation, which is based on the recursive preparation of Bell states protected by a concatenated error-detecting code. We prove lower bounds on the threshold fault rate of $0.67\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}3}$ for adversarial local stochastic noise, and $1.25\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}3}$ for independent depolarizing noise. In contrast to other schemes with comparable proved accuracy thresholds, the Fibonacci scheme has a significantly reduced overhead cost because it uses postselection far more sparingly.
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
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184 · cited 4×
“The goal of this paper was to rigorously analyze the scheme based on messagepassing decoding, and to support Knill’s numerical findings [2] that it has an accuracy threshold comparable to the postselection scheme (whose disadvantage is, of course, the extreme overhead cost incurred by the extreme use of postselection).”
BackgroundMethodInfluentialSubsystem 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 information with Rydberg atoms
Saffman, M., Walker, T. G., & Mølmer, K. (2010) · Reviews of Modern Physics · doi:10.1103/revmodphys.82.2313 · Cited by 2,836
Quantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
Blume-Kohout, R., Gamble, J. K., Nielsen, E., Rudinger, K., Mizrahi, J., Fortier, K., & Maunz, P. (2017) · Nature Communications · doi:10.1038/ncomms14485 · Cited by 401
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
Bias-preserving gates with stabilized cat qubits
Puri, S., St-Jean, L., Gross, J. A., Grimm, A., Frattini, N. E., Iyer, P. S., Krishna, A., Touzard, S., Jiang, L., Blais, A., et al. (2020) · Science Advances · doi:10.1126/sciadv.aay5901 · Cited by 201
“However, the uni-taries {CX, Z ( ), ZZ ( )}, in combination with state preparation, ∣± ⟩ , and measurements ℳ ˆ X , ˆ Z ( 20 ), are sufficient to implement universal fault-tolerant quantum computation ( 28 ).”
Metadata
- Authors
- Aliferis, P., & Preskill, J.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2009-01-30
- Volume
- 79
- Issue
- 1
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2170385165
- Cited by
- 47
- References
- 3
- FWCI
- 7.95
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Fibonacci scheme for fault-tolerant quantum computation. https://app.cochat.ai/papers/10.1103/physreva.79.012332
- The paper
- Aliferis, P., & Preskill, J. (2009). Fibonacci scheme for fault-tolerant quantum computation. Physical Review A. https://doi.org/10.1103/physreva.79.012332
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.