Topological quantum memory
Open accessThe DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
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.
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.
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
Items 101–148 of 148
The ZX calculus is a language for surface code lattice surgery
de Beaudrap, N., & Horsman, D. (2020) · Quantum · doi:10.22331/q-2020-01-09-218 · Cited by 83
Beverland, M. E., Kubica, A., & Svore, K. M. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020341 · Cited by 82
Error Mitigation for Universal Gates on Encoded Qubits
Piveteau, C., Sutter, D., Bravyi, S., Gambetta, J. M., & Temme, K. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.200505 · Cited by 81
“To measure the syndrome of the surface code S1 we use a well-known quantum circuit proposed in [12, 15].”
MethodFault-tolerant quantum computing with color codes
Landahl, A. J., Anderson, J. T., & Rice, P. R. (2011) · arXiv · doi:10.48550/arxiv.1108.5738 · Cited by 79
Self-citationMidcircuit Qubit Measurement and Rearrangement in a Yb 171 Atomic Array
Norcia, M. A., Cairncross, W. B., Barnes, K., Battaglino, P., Brown, A., Brown, M. O., Cassella, K., Chen, C.-A., Coxe, R., Crow, D., et al. (2023) · Physical Review X · doi:10.1103/physrevx.13.041034 · Cited by 78
A fault-tolerant non-Clifford gate for the surface code in two dimensions
Brown, B. J. (2020) · Science Advances · doi:10.1126/sciadv.aay4929 · Cited by 77
Measurement-based quantum computation with the toric code states
Bravyi, S., & Raussendorf, R. (2007) · Physical Review A · doi:10.1103/physreva.76.022304 · Cited by 69
Fault-Tolerant Operation of a Quantum Error-Correction Code
Egan, L., Debroy, D. M., Noel, C., Risinger, A., Zhu, D., Biswas, D., Newman, M., Li, M., Brown, K. R., Cetina, M., et al. (2020) · arXiv · doi:10.48550/arxiv.2009.11482 · Cited by 65
Coherence in logical quantum channels
Iverson, J. K., & Preskill, J. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab8e5c · Cited by 61
“Decoding the toric code is a well-studied problem and many good algorithms are known [30, 31, 32].”
BackgroundSelf-citationDecoding algorithms for surface codes
deMarti iOlius, A., Fuentes, P., Orús, R., Crespo, P. M., & Etxezarreta Martinez, J. (2024) · Quantum · doi:10.22331/q-2024-10-10-1498 · Cited by 60
“Surface codes are one of the most promising families of codes for constructing primitive fault-tolerant quantum computers in the near-term (Bombin and MartinDelgado, 2007; Bravyi et al., 2018; Dennis et al., 2002; Fowler et al., 2012, 2009; Kitaev, 2003; Raussendorf and Harrington, 2007).”
BackgroundHigh-fidelity teleportation of a logical qubit using transversal gates and lattice surgery
Ryan-Anderson, C., Brown, N. C., Baldwin, C. H., Dreiling, J. M., Foltz, C., Gaebler, J. P., Gatterman, T. M., Hewitt, N., Holliman, C., Horst, C. V., et al. (2024) · Science · doi:10.1126/science.adp6016 · Cited by 52
Scaling and logic in the colour code on a superconducting quantum processor
Lacroix, N., Bourassa, A., Heras, F. J. H., Zhang, L. M., Bausch, J., Senior, A. W., Edlich, T., Shutty, N., Sivak, V., Bengtsson, A., et al. (2025) · Nature · doi:10.1038/s41586-025-09061-4 · Cited by 51
QVECTOR: an algorithm for device-tailored quantum error correction
Johnson, P. D., Romero, J., Olson, J., Cao, Y., & Aspuru-Guzik, A. (2017) · arXiv · doi:10.48550/arxiv.1711.02249 · Cited by 50
Subsystem codes with high thresholds by gauge fixing and reduced qubit overhead
Higgott, O., & Breuckmann, N. P. (2021) · Physical Review X · doi:10.1103/physrevx.11.031039 · Cited by 48
“…(with two qubit stabilisers on the boundary), which has code parameters [[3 L 2 − 2 L, 1 , L ]], and in [35] a planar rotated subsystem code was introduced (with three-qubit stabilisers on the boundary) which has parameters − for the toric, planar and rotated surface codes respectively [1, 36].”
BackgroundMethodInfluentialQuRE: The Quantum Resource Estimator toolbox
Suchara, M., Kubiatowicz, J., Faruque, A., Chong, F. T., Lai, C.-Y., & Paz, G. (2013) · 2013 IEEE 31st International Conference on Computer Design (ICCD) · doi:10.1109/iccd.2013.6657074 · Cited by 45
Brennen, G., Giacobino, E., & Simon, C. (2015) · New Journal of Physics · doi:10.1088/1367-2630/17/5/050201 · Cited by 43
Statistical mechanical models and topological color codes
Bombin, H., & Martin-Delgado, M. A. (2008) · Physical Review A · doi:10.1103/physreva.77.042322 · Cited by 39
“The topological quantum code states considered so far in these studies correspond to the toric code states introduced by Kitaev [3], [4].”
ResultVasmer, M., & Kubica, A. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.030319 · Cited by 39
“We propose a decoding algorithm that connects two distinct decoders: the minimum-weight perfect-matching (MWPM) toric-code decoder [24,25] and the color-code-restriction decoder [26].”
BackgroundMethodInfluentialLeakage suppression in the toric code
Suchara, M., Cross, A. W., & Gambetta, J. M. (2015) · 2015 IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2015.7282629 · Cited by 38
Decoder for the Triangular Color Code by Matching on a Möbius Strip
Sahay, K., & Brown, B. J. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010310 · Cited by 38
Localized statistics decoding for quantum low-density parity-check codes
Hillmann, T., Berent, L., Quintavalle, A. O., Eisert, J., Wille, R., & Roffe, J. (2025) · Nature Communications · doi:10.1038/s41467-025-63214-7 · Cited by 37
FPGA-Based Distributed Union-Find Decoder for Surface Codes
(2024) · doi:10.1109/tqe.2024.3467271 · Cited by 36
Quantum Error Correction For Dummies
Chatterjee, A., Phalak, K., & Ghosh, S. (2023) · 2023 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00017 · Cited by 35
Entangling Four Logical Qubits beyond Break-Even in a Nonlocal Code
Hong, Y., Durso-Sabina, E., Hayes, D., & Lucas, A. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.180601 · Cited by 29
Investigating topological order using recurrent neural networks
Hibat-Allah, M., Melko, R. G., & Carrasquilla, J. (2023) · Physical Review B · doi:10.1103/physrevb.108.075152 · Cited by 27
Bravyi, S., & Cross, A. (2015) · arXiv · doi:10.48550/arxiv.1509.03239 · Cited by 27
Pipelined correlated minimum weight perfect matching of the surface code
Paler, A., & Fowler, A. G. (2023) · Quantum · doi:10.22331/q-2023-12-12-1205 · Cited by 22
Neural network decoder for near-term surface-code experiments
Varbanov, B. M., Serra-Peralta, M., Byfield, D., & Terhal, B. M. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.013029 · Cited by 20
Hierarchical memories: Simulating quantum LDPC codes with local gates
Pattison, C. A., Krishna, A., & Preskill, J. (2023) · arXiv · doi:10.48550/arxiv.2303.04798 · Cited by 20
Self-citationGeneral tensor network decoding of 2D Pauli codes
Chubb, C. T. (2021) · arXiv · doi:10.48550/arxiv.2101.04125 · Cited by 20
Distance-preserving stabilizer measurements in hypergraph product codes
Manes, A. G., & Claes, J. (2025) · Quantum · doi:10.22331/q-2025-01-30-1618 · Cited by 17
“One typically wants to measure stabilizers using ancilla qubits and low-depth quantum circuits, but these circuits must be optimized to simultaneously measure overlapping stabilizers [32–35].”
Color code decoder with improved scaling for correcting circuit-level noise
Lee, S.-H., Li, A., & Bartlett, S. D. (2025) · Quantum · doi:10.22331/q-2025-01-27-1609 · Cited by 16
“To understand the origin of the bias, it is helpful to compare the optimal schedule, A optimal = [2 , 3 , 6 , 5 , 4 , 1; 3 , 4 , 7 , 6 , 5 , 2] , (14) which exhibits a very small bias (discussed in Sec.”
High-performance repetition cat code using fast noisy operations
Régent, F.-M. L., Berdou, C., Leghtas, Z., Guillaud, J., & Mirrahimi, M. (2023) · Quantum · doi:10.22331/q-2023-12-06-1198 · Cited by 15
Low-overhead quantum computing with the color code
Thomsen, F., Kesselring, M. S., Bartlett, S. D., & Brown, B. J. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.043125 · Cited by 15
He, T., Lin, W., Wang, R., Li, Y., Bei, J., Cai, J., Cao, S., Chen, D., Chen, K., Chen, X., et al. (2025) · Physical Review Letters · doi:10.1103/rqkg-dw31 · Cited by 14
Decoding quantum color codes with MaxSAT
Berent, L., Burgholzer, L., Derks, P.-J. H. S., Eisert, J., & Wille, R. (2024) · Quantum · doi:10.22331/q-2024-10-23-1506 · Cited by 13
“More-over, in windowed decoding [18, 57] the size of the decoding problem considered at a time is considerably reduced, making it more amenable for the MaxSAT decoder.”
BackgroundThe prospects of Monte Carlo antibody loop modelling on a fault-tolerant quantum computer
Allcock, J., Vangone, A., Meyder, A., Adaszewski, S., Strahm, M., Hsieh, C.-Y., & Zhang, S. (2022) · Frontiers in Drug Discovery · doi:10.3389/fddsv.2022.908870 · Cited by 12
Preserving Phase Coherence and Linearity in Cat Qubits with Exponential Bit-Flip Suppression
(2025) · doi:10.1103/physrevx.15.011070 · Cited by 12
Facilitating practical fault-tolerant quantum computing based on color codes
Zhang, J., Wu, Y.-C., & Guo, G.-P. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033086 · Cited by 12
Improving Threshold for Fault-Tolerant Color-Code Quantum Computing by Flagged Weight Optimization
Takada, Y., & Fujii, K. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.030352 · Cited by 10
Fault-tolerant quantum speedup from constant depth quantum circuits
Mezher, R., Ghalbouni, J., Dgheim, J., & Markham, D. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033444 · Cited by 8
“[17] Dennis E, Kitaev A, Landahl A, Preskill J.”
BackgroundA New Recursion Relation for the 6j-Symbol
Bonzom, V., & Livine, E. R. (2012) · Annales Henri Poincaré · doi:10.1007/s00023-011-0143-y · Cited by 8
“It also gives a new way to think of fault-tolerant quantum computations [4].”
BackgroundQuantum error correction with an Ising machine under circuit-level noise
Fujisaki, J., Maruyama, K., Oshima, H., Sato, S., Sakashita, T., Takeuchi, Y., & Fujii, K. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.043261 · Cited by 5
Introduction to quantum error correction with stabilizer codes
Bradshaw, Z. P., Dale, J. J., & Evans, E. N. (2026) · Annals of Physics · doi:10.1016/j.aop.2026.170353 · Cited by 4
Using detector likelihood for benchmarking quantum error correction
Hesner, I., Hetényi, B., & Wootton, J. R. (2025) · Physical Review A · doi:10.1103/physreva.111.052452 · Cited by 3
“The first works that introduced topological codes drew a comparison between detectors and spin flips in solid state systems [1, 2].”
BackgroundPractical Quantum Error Correction with the XZZX Code and Kerr-Cat Qubits
Darmawan, A. S., Brown, B. J., Grimsmo, A. L., Tuckett, D. K., & Puri, S. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030345 · Cited by 2
“a surface-code variant [16,17,52], has recently been shown to have a very high threshold under biased noise.”
BackgroundMethodInfluentialGottesman-Kitaev-Preskill codes: A lattice perspective
Conrad, J., Eisert, J., & Arzani, F. (2022) · Quantum · doi:10.22331/q-2022-02-10-648
Accelerating the Tesseract Decoder for Quantum Error Correction
Grbic, D., Beni, L. A., & Shutty, N. (2026) · arXiv · doi:10.48550/arxiv.2602.02985
“This paper focuses on accelerating the decoding speed of several quantum code families: Surface Codes [8, 9, 36] (2D topological codes known for their high error thresholds and local qubit connectivity), Color Codes [2, 4, 10, 21, 22] (a generalization of topological codes defined on tri-colorable…”
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
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.