Student or educator? Sign up with your school email and get 6 months of Pro free.

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 access
Dennis, Eric, Kitaev, Alexei, Landahl, Andrew, Preskill, John·2002·Journal of Mathematical Physics

Abstract

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1063/1.1499754

Cites

33 of 33 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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?

9 more claims about this paper

Create a free account to see every claim other papers make about this one.

See all claims — free account

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

Show all 33 references

Research works printed but not linked: 16

  1. P. W. Shor , quant-ph/9605011. · arXiv
  2. E. Knill , R. Laflamme, and W. H. Zurek, quant-ph/9702058. · arXiv
  3. D. Aharonov and M. Ben-Or, quant-ph/9611025; · arXiv
  4. J. Preskill , quant-ph/9705031. · arXiv
  5. D. Gottesman , quant-ph/9705052. · arXiv
  6. A. R. Calderbank , E. M. Rains, P. W. Shor, and N. J. A. Sloane, quant-ph/9605005. · arXiv
  7. D. Gottesman , quant-ph/9604038. · arXiv
  8. I. A. Gruzberg , N. Read, and A. W. W. Ludwig, cond-mat/0007254. · arXiv
  9. M. G. Alford , K.-M. Lee, J. March-Russell, and J. Preskill, hep-th/9112038. · arXiv
  10. A. R. Calderbank and P. W. Shor, quant-ph/9512032. · arXiv
  11. A. Steane , quant-ph/9601029. · arXiv
  12. N. Kawashima and H. Rieger, cond-mat/9612116. · arXiv
  13. A. Steane , quant-ph/9611027. · arXiv
  14. D. Gottesman , quant-ph/9702029. · arXiv
  15. E. Dennis , quant-ph/9905027. · arXiv
  16. M. H. Freedman , A. Kitaev, M. J. Larsen, and Z. Wang, “Topological quantum computation,” quant-ph/0101025. · arXiv

Cited by

See all 1,768

Metadata

Authors
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J.
Affiliations
  • Princeton University (US)
  • California Institute of Technology (US)
Venue
Journal of Mathematical Physics
Published
2002-09-01
Volume
43
Issue
9
Pages
4452-4505
ISSN
  • 0022-2488 (ISSN-L)
  • 1089-7658
OpenAlex
W2088636071
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
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.