The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Topological quantum memory
Open accessAbstract
We analyze surface codes, the topological quantum error-correcting codes introduced by Kitaev. In these codes, qubits are arranged in a two-dimensional array on a surface of nontrivial topology, and encoded quantum operations are associated with nontrivial homology cycles of the surface. We formulate protocols for error recovery, and study the efficacy of these protocols. An order-disorder phase transition occurs in this system at a nonzero critical value of the error rate; if the error rate is below the critical value (the accuracy threshold), encoded information can be protected arbitrarily well in the limit of a large code block. This phase transition can be accurately modeled by a three-dimensional Z2 lattice gauge theory with quenched disorder. We estimate the accuracy threshold, assuming that all quantum gates are local, that qubits can be measured rapidly, and that polynomial-size classical computations can be executed instantaneously. We also devise a robust recovery procedure that does not require measurement or fast classical processing; however, for this procedure the quantum gates are local only if the qubits are arranged in four or more spatial dimensions. We discuss procedures for encoding, measurement, and performing fault-tolerant universal quantum computation with surface codes, and argue that these codes provide a promising framework for quantum computing architectures.
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source doesn’t support the claim as written.
In the citing paper
“recent results on fault tolerance in non-Markovian settings [19, 20, 21, 22], while representing a significant step forward, make a crucial assumption about the smallness of the norm of the system-bath interaction Hamiltonian, which severely restricts the class of physical reservoirs.”
From Internal consistency of fault-tolerant quantum error correction in light of rigorous derivations of the quantum Markovian limit (2006) · cites this paper as [21]
Checked by a reasoning model — may be wrong.
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“If the physical operations are below a critical noise threshold, the logical error rate should be suppressed exponentially as we increase the number of physical qubits per logical qubit.”
From Quantum error correction below the surface code threshold (2025) · cites this paper as [3]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Quantum error correction1–4 provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit, in which the logical error rate is suppressed exponentially as more qubits are added.”
From Quantum error correction below the surface code threshold (2025) · cites this paper as [3]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“More quantitatively, the logical phase-flip rate is expected to scale as (|α|2)γ (refs. 53,59), where ∣α∣2 is a proxy for the cat qubit phase-flip error rate.”
From Hardware-efficient quantum error correction via concatenated bosonic qubits (2025) · cites this paper as [59]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“on par with the surface code7–10 that for 20 years was the leading code in terms of error threshold”
From High-threshold and low-overhead fault-tolerant quantum memory (2024) · cites this paper as [9]
Experimental — accuracy not yet measured
9 more claims about this paper
Create a free account to see every claim other papers make about this one.
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
Fault-tolerant quantum computation by anyons
Kitaev, A. Y. (2003) · Annals of Physics · doi:10.1016/s0003-4916(02)00018-0 · Cited by 7,238
Self-citationScheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
Error Correcting Codes in Quantum Theory
Steane, A. M. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.793 · Cited by 2,677
Good quantum error-correcting codes exist
Calderbank, A. R., & Shor, P. W. (1996) · Physical Review A · doi:10.1103/physreva.54.1098 · Cited by 2,516
Edmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424
Self-citationMultiple-particle interference and quantum error correction
(1996) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1996.0136 · Cited by 1,284
Class of quantum error-correcting codes saturating the quantum Hamming bound
Gottesman, D. (1996) · Physical Review A · doi:10.1103/physreva.54.1862 · Cited by 1,227
Preskill, 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-citationTheory of fault-tolerant quantum computation
Gottesman, D. (1998) · Physical Review A · doi:10.1103/physreva.57.127 · Cited by 947
Research works printed but not linked: 16
- P. W. Shor , quant-ph/9605011. · arXiv
- E. Knill , R. Laflamme, and W. H. Zurek, quant-ph/9702058. · arXiv
- D. Aharonov and M. Ben-Or, quant-ph/9611025; · arXiv
- J. Preskill , quant-ph/9705031. · arXiv
- D. Gottesman , quant-ph/9705052. · arXiv
- A. R. Calderbank , E. M. Rains, P. W. Shor, and N. J. A. Sloane, quant-ph/9605005. · arXiv
- D. Gottesman , quant-ph/9604038. · arXiv
- I. A. Gruzberg , N. Read, and A. W. W. Ludwig, cond-mat/0007254. · arXiv
- M. G. Alford , K.-M. Lee, J. March-Russell, and J. Preskill, hep-th/9112038. · arXiv
- A. R. Calderbank and P. W. Shor, quant-ph/9512032. · arXiv
- A. Steane , quant-ph/9601029. · arXiv
- N. Kawashima and H. Rieger, cond-mat/9612116. · arXiv
- A. Steane , quant-ph/9611027. · arXiv
- D. Gottesman , quant-ph/9702029. · arXiv
- E. Dennis , quant-ph/9905027. · arXiv
- M. H. Freedman , A. Kitaev, M. J. Larsen, and Z. Wang, “Topological quantum computation,” quant-ph/0101025. · arXiv
Cited by
Non-Abelian anyons and topological quantum computation
Nayak, C., Simon, S. H., Stern, A., Freedman, M., & Das Sarma, S. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1083 · Cited by 6,861
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
Self-citationQuantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
Predicting many properties of a quantum system from very few measurements
Huang, H.-Y., Kueng, R., & Preskill, J. (2020) · Nature Physics · doi:10.1038/s41567-020-0932-7 · Cited by 1,240
Self-citation
Metadata
- Authors
- Dennis, E., Kitaev, A., Landahl, A., & Preskill, J.
- Affiliations
- Princeton University (US)
- California Institute of Technology (US)
- Venue
- Journal of Mathematical Physics
- Publisher
- AIP Publishing
- Published
- 2002-09-01
- Volume
- 43
- Issue
- 9
- Pages
- 4452-4505
- ISSN
- 0022-2488 (ISSN-L)
- 1089-7658
- OpenAlex
- W2088636071
- Semantic Scholar
- 8ba3a176211e3e9959c36cbb2e22dbdee84d3b00
- Cited by
- 1,768
- References
- 33
- Citations by year
- 2026: 184 · 2025: 307 · 2024: 215 · 2023: 137 · 2022: 120 · 2021: 79 · 2020: 87 · 2019: 71 · 2018: 50 · 2017: 70 · 2016: 52 · 2015: 51 · 2014: 54 · 2013: 64 · 2012: 47
- FWCI
- 7.24
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Journal of Mathematical Physics (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- CaltechAUTHORS (California Institute of Technology) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Keywords
- topological quantum memory, surface code, topological quantum error correction, homology cycles, order-disorder transition, accuracy threshold, Z2 lattice gauge theory, quenched disorder, fault-tolerant quantum computing, quantum error correction, quantum computing architecture
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: Topological quantum memory. https://app.cochat.ai/papers/10.1063/1.1499754
- The paper
- Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002). Topological quantum memory. Journal of Mathematical Physics. https://doi.org/10.1063/1.1499754
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.