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
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-citationHigh-Temperature Fractional Quantum Hall States
Tang, E., Mei, J.-W., & Wen, X.-G. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.236802 · Cited by 1,195
Logical quantum processor based on reconfigurable atom arrays
Bluvstein, D., Evered, S. J., Geim, A. A., Li, S. H., Zhou, H., Manovitz, T., Ebadi, S., Cain, M., Kalinowski, M., Hangleiter, D., et al. (2024) · Nature · doi:10.1038/s41586-023-06927-3 · Cited by 1,119
“6, which can be understood as preparing two four-qubit GHZ states (corresponding to [[4,2,2]] codes 95 ), that is, GHZ ⊗GHZ , and subsequently entangling them as illustrated in Extended Data Fig.”
BackgroundInfluentialSuppressing quantum errors by scaling a surface code logical qubit
Google Quantum, A. I., Acharya, R., Aleiner, I., Allen, R., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., Atalaya, J., et al. (2023) · Nature · doi:10.1038/s41586-022-05434-1 · Cited by 1,103
“These two error graphs are then decoded using a MWPM decoder [34].”
InfluentialSelf-citationA toolbox for lattice-spin models with polar molecules
Micheli, A., Brennen, G. K., & Zoller, P. (2006) · Nature Physics · doi:10.1038/nphys287 · Cited by 1,079
Fault-Tolerant Quantum Computation with High Threshold in Two Dimensions
Raussendorf, R., & Harrington, J. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.190504 · Cited by 812
Probing topological spin liquids on a programmable quantum simulator
Semeghini, G., Levine, H., Keesling, A., Ebadi, S., Wang, T. T., Bluvstein, D., Verresen, R., Pichler, H., Kalinowski, M., Samajdar, R., et al. (2021) · Science · doi:10.1126/science.abi8794 · Cited by 781
Matrix product states and projected entangled pair states: Concepts, symmetries, theorems
Cirac, J. I., Pérez-García, D., Schuch, N., & Verstraete, F. (2021) · Reviews of Modern Physics · doi:10.1103/revmodphys.93.045003 · Cited by 769
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
Quantum error correction below the surface code threshold
Collaborators, G. Q. A. A., Acharya, R., Abanin, D. A., Aghababaie-Beni, L., Aleiner, I., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., et al. (2025) · Nature · doi:10.1038/s41586-024-08449-y · Cited by 778
“1b). pulse duration, and readout pulse power are jointly optimized [3] to attain simultaneous high fidelity mid-circuit readout.”
Topological Quantum Distillation
Bombin, H., & Martin-Delgado, M. A. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.180501 · Cited by 700
Large-scale modular quantum-computer architecture with atomic memory and photonic interconnects
Monroe, C., Raussendorf, R., Ruthven, A., Brown, K. R., Maunz, P., Duan, L.-M., & Kim, J. (2014) · Physical Review A · doi:10.1103/physreva.89.022317 · Cited by 700
Local stabilizer codes in three dimensions without string logical operators
Haah, J. (2011) · Physical Review A · doi:10.1103/physreva.83.042330 · Cited by 690
Lieb-Robinson Bounds and the Generation of Correlations and Topological Quantum Order
Bravyi, S., Hastings, M. B., & Verstraete, F. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.050401 · Cited by 664
Realizing repeated quantum error correction in a distance-three surface code
Krinner, S., Lacroix, N., Remm, A., Di Paolo, A., Genois, E., Leroux, C., Hellings, C., Lazar, S., Swiadek, F., Herrmann, J., et al. (2022) · Nature · doi:10.1038/s41586-022-04566-8 · Cited by 686
A Survey on quantum computing technology
Gyongyosi, L., & Imre, S. (2019) · Computer Science Review · doi:10.1016/j.cosrev.2018.11.002 · Cited by 646
Building logical qubits in a superconducting quantum computing system
Gambetta, J. M., Chow, J. M., & Steffen, M. (2017) · npj Quantum Information · doi:10.1038/s41534-016-0004-0 · Cited by 622
Topological fault-tolerance in cluster state quantum computation
Raussendorf, R., Harrington, J., & Goyal, K. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/6/199 · Cited by 617
Contextuality supplies the ‘magic’ for quantum computation
Howard, M., Wallman, J., Veitch, V., & Emerson, J. (2014) · Nature · doi:10.1038/nature13460 · Cited by 616
Maurand, R., Jehl, X., Kotekar-Patil, D., Corna, A., Bohuslavskyi, H., Laviéville, R., Hutin, L., Barraud, S., Vinet, M., Sanquer, M., et al. (2016) · Nature Communications · doi:10.1038/ncomms13575 · Cited by 604
Roads towards fault-tolerant universal quantum computation
Campbell, E. T., Terhal, B. M., & Vuillot, C. (2017) · Nature · doi:10.1038/nature23460 · Cited by 596
Surface code quantum computing by lattice surgery
Horsman, D., Fowler, A. G., Devitt, S., & Meter, R. V. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/12/123011 · Cited by 598
“The general procedure was given for the planar code in [2], and a worked example for general surface codes in [4, section VI(C)].”
MethodQuantum computing with neutral atoms
Henriet, L., Beguin, L., Signoles, A., Lahaye, T., Browaeys, A., Reymond, G.-O., & Jurczak, C. (2020) · Quantum · doi:10.22331/q-2020-09-21-327 · Cited by 550
“for the exploration of more industry-relevant usecases, but it will also make possible the implementation of quantum error correcting codes such as the surface code [48, 49, 81] on large system sizes.”
BackgroundQuantum advantage in learning from experiments
Huang, H.-Y., Broughton, M., Cotler, J., Chen, S., Li, J., Mohseni, M., Neven, H., Babbush, R., Kueng, R., Preskill, J., et al. (2022) · Science · doi:10.1126/science.abn7293 · Cited by 519
Self-citationArea laws in a many-body localized state and its implications for topological order
Bauer, B., & Nayak, C. (2013) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2013/09/p09005 · Cited by 515
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
Córcoles, A. D., Magesan, E., Srinivasan, S. J., Cross, A. W., Steffen, M., Gambetta, J. M., & Chow, J. M. (2015) · Nature Communications · doi:10.1038/ncomms7979 · Cited by 490
High-threshold universal quantum computation on the surface code
Fowler, A. G., Stephens, A. M., & Groszkowski, P. (2009) · Physical Review A · doi:10.1103/physreva.80.052312 · Cited by 486
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
Quantum computing: A taxonomy, systematic review and future directions
Gill, S. S., Kumar, A., Singh, H., Singh, M., Kaur, K., Usman, M., & Buyya, R. (2022) · Software: Practice and Experience · doi:10.1002/spe.3039 · Cited by 476
High-threshold and low-overhead fault-tolerant quantum memory
Bravyi, S., Cross, A. W., Gambetta, J. M., Maslov, D., Rall, P., & Yoder, T. J. (2024) · Nature · doi:10.1038/s41586-024-07107-7 · Cited by 456
“The sources of noise include imperfections in qubits, materials used, controlling apparatus, state preparation and measurement errors and a variety of external factors ranging from local man-made, such as stray electromagnetic fields, to those inherent to the Universe, such as cosmic rays.”
BackgroundQuantum computations on a topologically encoded qubit
Nigg, D., Müller, M., Martinez, E. A., Schindler, P., Hennrich, M., Monz, T., Martin-Delgado, M. A., & Blatt, R. (2014) · Science · doi:10.1126/science.1253742 · Cited by 400
Silicon CMOS architecture for a spin-based quantum computer
Veldhorst, M., Eenink, H. G. J., Yang, C. H., & Dzurak, A. S. (2017) · Nature Communications · doi:10.1038/s41467-017-01905-6 · Cited by 398
Dynamical Purification Phase Transition Induced by Quantum Measurements
Gullans, M. J., & Huse, D. A. (2020) · Physical Review X · doi:10.1103/physrevx.10.041020 · Cited by 391
Exponential suppression of bit or phase errors with cyclic error correction
Google Quantum, A. I., Chen, Z., Satzinger, K. J., Atalaya, J., Korotkov, A. N., Dunsworth, A., Sank, D., Quintana, C., McEwen, M., Barends, R., et al. (2021) · Nature · doi:10.1038/s41586-021-03588-y · Cited by 393
Self-citationEncoding Electronic Spectra in Quantum Circuits with Linear T Complexity
Babbush, R., Gidney, C., Berry, D. W., Wiebe, N., McClean, J., Paler, A., Fowler, A., & Neven, H. (2018) · Physical Review X · doi:10.1103/physrevx.8.041015 · Cited by 383
Sparse-Graph Codes for Quantum Error Correction
MacKay, D. J. C., Mitchison, G., & McFadden, P. L. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.834737 · Cited by 376
Fusion-based quantum computation
Bartolucci, S., Birchall, P., Bombín, H., Cable, H., Dawson, C., Gimeno-Segovia, M., Johnston, E., Kieling, K., Nickerson, N., Pant, M., et al. (2023) · Nature Communications · doi:10.1038/s41467-023-36493-1 · Cited by 371
Universal Quantum Gate Set Approaching Fault-Tolerant Thresholds with Superconducting Qubits
Chow, J. M., Gambetta, J. M., Córcoles, A. D., Merkel, S. T., Smolin, J. A., Rigetti, C., Poletto, S., Keefe, G. A., Rothwell, M. B., Rozen, J. R., et al. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.060501 · Cited by 371
Topological Order with a Twist: Ising Anyons from an Abelian Model
Bombin, H. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.030403 · Cited by 369
A Race-Track Trapped-Ion Quantum Processor
Moses, S. A., Baldwin, C. H., Allman, M. S., Ancona, R., Ascarrunz, L., Barnes, C., Bartolotta, J., Bjork, B., Blanchard, P., Bohn, M., et al. (2023) · Physical Review X · doi:10.1103/physrevx.13.041052 · Cited by 391
Quantum error correction: an introductory guide
Roffe, J. (2019) · Contemporary Physics · doi:10.1080/00107514.2019.1667078 · Cited by 356
Fault-tolerant control of an error-corrected qubit
Egan, L., Debroy, D. M., Noel, C., Risinger, A., Zhu, D., Biswas, D., Newman, M., Li, M., Brown, K. R., Cetina, M., et al. (2021) · Nature · doi:10.1038/s41586-021-03928-y · Cited by 348
Surface code quantum computing with error rates over 1%
Wang, D. S., Fowler, A. G., & Hollenberg, L. C. L. (2011) · Physical Review A · doi:10.1103/physreva.83.020302 · Cited by 343
Topological Quantum Computation—From Basic Concepts to First Experiments
Stern, A., & Lindner, N. H. (2013) · Science · doi:10.1126/science.1231473 · Cited by 342
Magic-state distillation with low overhead
Bravyi, S., & Haah, J. (2012) · Physical Review A · doi:10.1103/physreva.86.052329 · Cited by 341
Repeated quantum error detection in a surface code
Andersen, C. K., Remm, A., Lazar, S., Krinner, S., Lacroix, N., Norris, G. J., Gabureac, M., Eichler, C., & Wallraff, A. (2020) · Nature Physics · doi:10.1038/s41567-020-0920-y · Cited by 337
Wang, C., Harrington, J., & Preskill, J. (2003) · Annals of Physics · doi:10.1016/s0003-4916(02)00019-2 · Cited by 330
Self-citationQuantum Low-Density Parity-Check Codes
Breuckmann, N. P., & Eberhardt, J. N. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040101 · Cited by 328
Engineered Open Systems and Quantum Simulations with Atoms and Ions
Müller, M., Diehl, S., Pupillo, G., & Zoller, P. (2012) · Advances In Atomic, Molecular, and Optical Physics · doi:10.1016/b978-0-12-396482-3.00001-6 · Cited by 315
Quantum computing and the entanglement frontier
Preskill, J. (2012) · arXiv · doi:10.48550/arxiv.1203.5813 · Cited by 308
Self-citationRealization of Real-Time Fault-Tolerant Quantum Error Correction
Ryan-Anderson, C., Bohnet, J. G., Lee, K., Gresh, D., Hankin, A., Gaebler, J. P., Francois, D., Chernoguzov, A., Lucchetti, D., Brown, N. C., et al. (2021) · Physical Review X · doi:10.1103/physrevx.11.041058 · Cited by 306
Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
Bourassa, J. E., Alexander, R. N., Vasmer, M., Patil, A., Tzitrin, I., Matsuura, T., Su, D., Baragiola, B. Q., Guha, S., Dauphinais, G., et al. (2021) · Quantum · doi:10.22331/q-2021-02-04-392 · Cited by 302
Entanglement spectrum and boundary theories with projected entangled-pair states
Cirac, J. I., Poilblanc, D., Schuch, N., & Verstraete, F. (2011) · Physical Review B · doi:10.1103/physrevb.83.245134 · Cited by 297
Quantum Self-Correction in the 3D Cubic Code Model
Bravyi, S., & Haah, J. (2013) · Physical Review Letters · doi:10.1103/physrevlett.111.200501 · Cited by 291
Building a Fault-Tolerant Quantum Computer Using Concatenated Cat Codes
Chamberland, C., Noh, K., Arrangoiz-Arriola, P., Campbell, E. T., Hann, C. T., Iverson, J., Putterman, H., Bohdanowicz, T. C., Flammia, S. T., Keller, A., et al. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010329 · Cited by 281
Self-citationHalving the cost of quantum addition
Gidney, C. (2018) · Quantum · doi:10.22331/q-2018-06-18-74 · Cited by 279
“The surface code [5, 8, 21, 22, 11] is a quantum error correcting code that works on a 2D nearest-neighbour array of qubits and achieves a threshold error rate of approximately 1%.”
BackgroundImplementing a strand of a scalable fault-tolerant quantum computing fabric
Chow, J. M., Gambetta, J. M., Magesan, E., Abraham, D. W., Cross, A. W., Johnson, B. R., Masluk, N. A., Ryan, C. A., Smolin, J. A., Srinivasan, S. J., et al. (2014) · Nature Communications · doi:10.1038/ncomms5015 · Cited by 281
Low-distance surface codes under realistic quantum noise
Tomita, Y., & Svore, K. M. (2014) · Physical Review A · doi:10.1103/physreva.90.062320 · Cited by 281
Bonilla Ataides, J. P., Tuckett, D. K., Bartlett, S. D., Flammia, S. T., & Brown, B. J. (2021) · Nature Communications · doi:10.1038/s41467-021-22274-1 · Cited by 262
A quantum annealing architecture with all-to-all connectivity from local interactions
Lechner, W., Hauke, P., & Zoller, P. (2015) · Science Advances · doi:10.1126/sciadv.1500838 · Cited by 256
A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes
Bravyi, S., & Terhal, B. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/4/043029 · Cited by 255
Repetition Cat Qubits for Fault-Tolerant Quantum Computation
Guillaud, J., & Mirrahimi, M. (2019) · Physical Review X · doi:10.1103/physrevx.9.041053 · Cited by 243
Almost-linear time decoding algorithm for topological codes
Delfosse, N., & Nickerson, N. H. (2021) · Quantum · doi:10.22331/q-2021-12-02-595 · Cited by 242
Degenerate Quantum LDPC Codes With Good Finite Length Performance
Panteleev, P., & Kalachev, G. (2021) · Quantum · doi:10.22331/q-2021-11-22-585 · Cited by 257
Topological and Subsystem Codes on Low-Degree Graphs with Flag Qubits
Chamberland, C., Zhu, G., Yoder, T. J., Hertzberg, J. B., & Cross, A. W. (2020) · Physical Review X · doi:10.1103/physrevx.10.011022 · Cited by 223
Asymptotically good Quantum and locally testable classical LDPC codes
Panteleev, P., & Kalachev, G. (2022) · Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing · doi:10.1145/3519935.3520017 · Cited by 222
Gauge color codes: optimal transversal gates and gauge fixing in topological stabilizer codes
Bombín, H. (2015) · New Journal of Physics · doi:10.1088/1367-2630/17/8/083002 · Cited by 217
Ultrahigh Error Threshold for Surface Codes with Biased Noise
Tuckett, D. K., Bartlett, S. D., & Flammia, S. T. (2018) · Physical Review Letters · doi:10.1103/physrevlett.120.050505 · Cited by 216
Efficient algorithms for maximum likelihood decoding in the surface code
Bravyi, S., Suchara, M., & Vargo, A. (2014) · Physical Review A · doi:10.1103/physreva.90.032326 · Cited by 214
Challenges and Opportunities of Near-Term Quantum Computing Systems
Corcoles, A. D., Kandala, A., Javadi-Abhari, A., McClure, D. T., Cross, A. W., Temme, K., Nation, P. D., Steffen, M., & Gambetta, J. M. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2954005 · Cited by 203
Decoding across the quantum low-density parity-check code landscape
Roffe, J., White, D. R., Burton, S., & Campbell, E. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.043423 · Cited by 192
Sparse blossom: correcting a million errors per core second with minimum-weight matching
Higgott, O., & Gidney, C. (2025) · Quantum · doi:10.22331/q-2025-01-20-1600 · Cited by 180
Optimal resources for topological two-dimensional stabilizer codes: Comparative study
Bombin, H., & Martin-Delgado, M. A. (2007) · Physical Review A · doi:10.1103/physreva.76.012305 · Cited by 178
Efficient quantum measurement of Pauli operators in the presence of finite sampling error
Crawford, O., Straaten, B. V., Wang, D., Parks, T., Campbell, E., & Brierley, S. (2021) · Quantum · doi:10.22331/q-2021-01-20-385 · Cited by 188
PyMatching: A Python Package for Decoding Quantum Codes with Minimum-Weight Perfect Matching
Higgott, O. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3505637 · Cited by 181
Fault-tolerant bosonic quantum error correction with the surface–Gottesman-Kitaev-Preskill code
Noh, K., & Chamberland, C. (2020) · Physical Review A · doi:10.1103/physreva.101.012316 · Cited by 164
Flag fault-tolerant error correction with arbitrary distance codes
Chamberland, C., & Beverland, M. E. (2018) · Quantum · doi:10.22331/q-2018-02-08-53 · Cited by 159
Efficient magic state factories with a catalyzed | C C Z ⟩ to 2 | T ⟩ transformation
Gidney, C., & Fowler, A. G. (2019) · Quantum · doi:10.22331/q-2019-04-30-135 · Cited by 152
Quantum advantage with noisy shallow circuits
Bravyi, S., Gosset, D., König, R., & Tomamichel, M. (2020) · Nature Physics · doi:10.1038/s41567-020-0948-z · Cited by 144
Correcting coherent errors with surface codes
Bravyi, S., Englbrecht, M., König, R., & Peard, N. (2018) · npj Quantum Information · doi:10.1038/s41534-018-0106-y · Cited by 157
Alicki, R., Lidar, D. A., & Zanardi, P. (2006) · Physical Review A · doi:10.1103/physreva.73.052311 · Cited by 132
Fault-tolerant thresholds for quantum error correction with the surface code
Stephens, A. M. (2014) · Physical Review A · doi:10.1103/physreva.89.022321 · Cited by 133
Simulating open quantum systems: from many-body interactions to stabilizer pumping
Müller, M., Hammerer, K., Zhou, Y. L., Roos, C. F., & Zoller, P. (2011) · New Journal of Physics · doi:10.1088/1367-2630/13/8/085007 · Cited by 127
DISTRIBUTED QUANTUM COMPUTATION ARCHITECTURE USING SEMICONDUCTOR NANOPHOTONICS
VAN METER, R., LADD, T. D., FOWLER, A. G., & YAMAMOTO, Y. (2010) · International Journal of Quantum Information · doi:10.1142/s0219749910006435 · Cited by 109
Sundaresan, N., Yoder, T. J., Kim, Y., Li, M., Chen, E. H., Harper, G., Thorbeck, T., Cross, A. W., Córcoles, A. D., & Takita, M. (2023) · Nature Communications · doi:10.1038/s41467-023-38247-5 · Cited by 108
Continuous Symmetries and Approximate Quantum Error Correction
Faist, P., Nezami, S., Albert, V. V., Salton, G., Pastawski, F., Hayden, P., & Preskill, J. (2020) · Physical Review X · doi:10.1103/physrevx.10.041018 · Cited by 107
Self-citationHardware-efficient quantum error correction via concatenated bosonic qubits
Putterman, H., Noh, K., Hann, C. T., MacCabe, G. S., Aghaeimeibodi, S., Patel, R. N., Lee, M., Jones, W. M., Moradinejad, H., Rodriguez, R., et al. (2025) · Nature · doi:10.1038/s41586-025-08642-7 · Cited by 108
Self-citationEntanglement renormalization and gauge symmetry
Tagliacozzo, L., & Vidal, G. (2011) · Physical Review B · doi:10.1103/physrevb.83.115127 · Cited by 104
Early Fault-Tolerant Quantum Computing
Katabarwa, A., Gratsea, K., Caesura, A., & Johnson, P. D. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.020101 · Cited by 103
“For the surface code [69], which is a leading contender for practical quantum computing [70], such simulations have led to the prediction of quite optimistic thresholds of ∼ 1% [71], which have also been argued for analytically [72].”
BackgroundLow-overhead fault-tolerant quantum computing using long-range connectivity
Cohen, L. Z., Kim, I. H., Bartlett, S. D., & Brown, B. J. (2022) · Science Advances · doi:10.1126/sciadv.abn1717 · Cited by 98
Surface code implementation of block code state distillation
Fowler, A. G., Devitt, S. J., & Jones, C. (2013) · Scientific Reports · doi:10.1038/srep01939 · Cited by 99
Mid-Circuit Cavity Measurement in a Neutral Atom Array
Deist, E., Lu, Y.-H., Ho, J., Pasha, M. K., Zeiher, J., Yan, Z., & Stamper-Kurn, D. M. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.203602 · Cited by 94
Triangular color codes on trivalent graphs with flag qubits
Chamberland, C., Kubica, A., Yoder, T. J., & Zhu, G. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab68fd · Cited by 105
Learning high-accuracy error decoding for quantum processors
Bausch, J., Senior, A. W., Heras, F. J. H., Edlich, T., Davies, A., Newman, M., Jones, C., Satzinger, K., Niu, M. Y., Blackwell, S., et al. (2024) · Nature · doi:10.1038/s41586-024-08148-8 · Cited by 106
“Quantum error correction frequently requires different decoding methods to classical error correction 15,16 and, despite recent significant progress 4,17–21 , challenges remain.”
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
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.