The DOI matches its Crossref record; 65 of the 65 references it cites were found in a registry or an index.
Quantum error correction: an introductory guide
Open accessAbstract
Quantum error correction protocols will play a central role in the realisation of quantum computing; the choice of error correction code will influence the full quantum computing stack, from the layout of qubits at the physical level to gate compilation strategies at the software level. As such, familiarity with quantum coding is an essential prerequisite for the understanding of current and future quantum computing architectures. In this review, we provide an introductory guide to the theory and implementation of quantum error correction codes. Where possible, fundamental concepts are described using the simplest examples of detection and correction codes, the working of which can be verified by hand. We outline the construction and operation of the surface code, the most widely pursued error correction protocol for experiment. Finally, we discuss issues that arise in the practical implementation of the surface code and other quantum error correction codes.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Quantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436
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
A single quantum cannot be cloned
Wootters, W. K., & Zurek, W. H. (1982) · Nature · doi:10.1038/299802a0 · Cited by 5,406 · cited 2×
“The first complication is the no-cloning theorem for quantum states [20,21], which asserts that it is not possible to construct a unitary operator Uclone which performs the following operation”
BackgroundError Detecting and Error Correcting Codes
Hamming, R. W. (1950) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1950.tb00463.x · Cited by 5,377
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
A silicon-based nuclear spin quantum computer
Kane, B. E. (1998) · Nature · doi:10.1038/30156 · Cited by 3,779
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 · cited 3×
“ions required for fault tolerance, will reduce the threshold for the code. For example, the threshold for the surface code with noisy ancilla measurements is ≈ 1%, compared to ≈ 10% in the ideal case [34,64]. 6.4. Encoded computation A universal quantum computer is a device that can perform any unitary operation Uthat…”
BackgroundResultInfluentialError 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 · cited 1×
“Other constructions include methods for repurposing classical codes to obtain commuting stabilizer checks [42–45].”
MethodEdmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499754 · Cited by 1,768
Theory of quantum error-correcting codes
Knill, E., & Laflamme, R. (1997) · Physical Review A · doi:10.1103/physreva.55.900 · Cited by 1,593
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 · cited 2×
“Various methods have been proposed [67–70], but these typically impose a high cost in terms of the number of additional qubits required.”
MethodQuantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424
Simulated Quantum Computation of Molecular Energies
Aspuru-Guzik, A., Dutoi, A. D., Love, P. J., & Head-Gordon, M. (2005) · Science · doi:10.1126/science.1113479 · Cited by 1,418
An introduction to quantum machine learning
Schuld, M., Sinayskiy, I., & Petruccione, F. (2015) · Contemporary Physics · doi:10.1080/00107514.2014.964942 · Cited by 1,381
Quantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
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
Theory of fault-tolerant quantum computation
Gottesman, D. (1998) · Physical Review A · doi:10.1103/physreva.57.127 · Cited by 947
Quantum information processing with superconducting circuits: a review
Wendin, G. (2017) · Reports on Progress in Physics · doi:10.1088/1361-6633/aa7e1a · Cited by 890
Demonstration of a small programmable quantum computer with atomic qubits
Debnath, S., Linke, N. M., Figgatt, C., Landsman, K. A., Wright, K., & Monroe, C. (2016) · Nature · doi:10.1038/nature18648 · Cited by 777
High-Fidelity Quantum Logic Gates Using Trapped-Ion Hyperfine Qubits
Ballance, C. J., Harty, T. P., Linke, N. M., Sepiol, M. A., & Lucas, D. M. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.060504 · Cited by 777
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
Knill, E., Laflamme, R., & Zurek, W. H. (1998) · Science · doi:10.1126/science.279.5349.342 · Cited by 663
(2013) · Cambridge University Press eBooks · doi:10.1017/cbo9781139034807 · Cited by 655
High-Fidelity Preparation, Gates, Memory, and Readout of a Trapped-Ion Quantum Bit
Harty, T. P., Allcock, D. T. C., Ballance, C. J., Guidoni, L., Janacek, H. A., Linke, N. M., Stacey, D. N., & Lucas, D. M. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.220501 · Cited by 632
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
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 · cited 1×
“Figure 8(a) shows the five-qubit surface code formed by tiling together four four-cycles in a square lattice [55].”
BackgroundRoads towards fault-tolerant universal quantum computation
Campbell, E. T., Terhal, B. M., & Vuillot, C. (2017) · Nature · doi:10.1038/nature23460 · Cited by 596
Qubit Architecture with High Coherence and Fast Tunable Coupling
Chen, Y., Neill, C., Roushan, P., Leung, N., Fang, M., Barends, R., Kelly, J., Campbell, B., Chen, Z., Chiaro, B., et al. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.220502 · Cited by 584
Experimental Ten-Photon Entanglement
Wang, X.-L., Chen, L.-K., Li, W., Huang, H.-L., Liu, C., Chen, C., Luo, Y.-H., Su, Z.-E., Wu, D., Li, Z.-D., et al. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.210502 · Cited by 549
Large-scale silicon quantum photonics implementing arbitrary two-qubit processing
Qiang, X., Zhou, X., Wang, J., Wilkes, C. M., Loke, T., O’Gara, S., Kling, L., Marshall, G. D., Santagati, R., Ralph, T. C., et al. (2018) · Nature Photonics · doi:10.1038/s41566-018-0236-y · Cited by 516
Restrictions on Transversal Encoded Quantum Gate Sets
Eastin, B., & Knill, E. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.110502 · Cited by 457
Blossom V: a new implementation of a minimum cost perfect matching algorithm
Kolmogorov, V. (2009) · Mathematical Programming Computation · doi:10.1007/s12532-009-0002-8 · Cited by 414
Quantum codes on a lattice with boundary
Bravyi, S. B., & Kitaev, A. Y. (1998) · arXiv · doi:10.48550/arxiv.quant-ph/9811052 · Cited by 394
Codes for the quantum erasure channel
Grassl, M., Beth, T., & Pellizzari, T. (1997) · Physical Review A · doi:10.1103/physreva.56.33 · Cited by 374 · cited 1×
“Example: The [[4,2,2]] detection code The [[4, 2, 2]] detection code is the smallest stabilizer code to offer protection against a quantum noise model in which the qubits are susceptible to bothX- and Z-errors [38,39].”
BackgroundUniversal 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
Active Stabilization, Quantum Computation, and Quantum State Synthesis
Steane, A. M. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.2252 · Cited by 323
The concept of transition in quantum mechanics
Park, J. L. (1970) · Foundations of Physics · doi:10.1007/bf00708652 · Cited by 301
Tillich, J.-P., & Zemor, G. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2292061 · Cited by 288
Detecting bit-flip errors in a logical qubit using stabilizer measurements
Ristè, D., Poletto, S., Huang, M.-Z., Bruno, A., Vesterinen, V., Saira, O.-P., & DiCarlo, L. (2015) · Nature Communications · doi:10.1038/ncomms7983 · Cited by 262
A surface code quantum computer in silicon
Hill, C. D., Peretz, E., Hile, S. J., House, M. G., Fuechsle, M., Rogge, S., Simmons, M. Y., & Hollenberg, L. C. L. (2015) · Science Advances · doi:10.1126/sciadv.1500707 · Cited by 245
Experimental Demonstration of Fault-Tolerant State Preparation with Superconducting Qubits
Takita, M., Cross, A. W., Córcoles, A. D., Chow, J. M., & Gambetta, J. M. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.180501 · Cited by 228
Quantum Error Correction with Only Two Extra Qubits
Chao, R., & Reichardt, B. W. (2018) · Physical Review Letters · doi:10.1103/physrevlett.121.050502 · Cited by 221
Fault-Tolerant Logical Gates in the IBM Quantum Experience
Harper, R., & Flammia, S. T. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.080504 · Cited by 193
Constructions and Noise Threshold of Hyperbolic Surface Codes
Breuckmann, N. P., & Terhal, B. M. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2555700 · Cited by 181
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
Fault-tolerant quantum error detection
Linke, N. M., Gutierrez, M., Landsman, K. A., Figgatt, C., Debnath, S., Brown, K. R., & Monroe, C. (2017) · Science Advances · doi:10.1126/sciadv.1701074 · Cited by 172
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
Quantum computation with realistic magic-state factories
O'Gorman, J., & Campbell, E. T. (2017) · Physical Review A · doi:10.1103/physreva.95.032338 · Cited by 158
Quantum Kronecker sum-product low-density parity-check codes with finite rate
Kovalev, A. A., & Pryadko, L. P. (2013) · Physical Review A · doi:10.1103/physreva.88.012311 · Cited by 145
Effective Fault-Tolerant Quantum Computation with Slow Measurements
Divincenzo, D. P., & Aliferis, P. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.020501 · Cited by 144
Error prevention scheme with four particles
Lev Vaidman, A., Goldenberg, L., & Wiesner, S. J. (1996) · Physical Review A · doi:10.1103/physreva.54.r1745 · Cited by 131
Three-dimensional surface codes: Transversal gates and fault-tolerant architectures
Vasmer, M., & Browne, D. E. (2019) · Physical Review A · doi:10.1103/physreva.100.012312 · Cited by 102
Cryogenic setup for trapped ion quantum computing
Brandl, M. F., van Mourik, M. W., Postler, L., Nolf, A., Lakhmanskiy, K., Paiva, R. R., Möller, S., Daniilidis, N., Häffner, H., Kaushal, V., et al. (2016) · Review of Scientific Instruments · doi:10.1063/1.4966970 · Cited by 97
Wootton, J. R., & Loss, D. (2018) · Physical Review A · doi:10.1103/physreva.97.052313 · Cited by 76
Multi-path Summation for Decoding 2D Topological Codes
Criger, B., & Ashraf, I. (2018) · Quantum · doi:10.22331/q-2018-10-19-102 · Cited by 72
Scalablein situqubit calibration during repetitive error detection
Kelly, J., Barends, R., Fowler, A. G., Megrant, A., Jeffrey, E. R., White, T., Sank, D., Mutus, J., Campbell, B., Chen, Y., et al. (2016) · Physical Review A · doi:10.1103/physreva.94.032321 · Cited by 68
Efficient preparation and detection of microwave dressed-state qubits and qutrits with trapped ions
Randall, J., Weidt, S., Standing, E., Lake, K., Webster, S. C., Murgia, D., Navickas, T., Roth, K., & Hensinger, W. K. (2015) · Physical Review A · doi:10.1103/physreva.91.012322 · Cited by 66
Protecting quantum memories using coherent parity check codes
Roffe, J., Headley, D., Chancellor, N., Horsman, D., & Kendon, V. M. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aac64e · Cited by 65
Self-citationFault-tolerant quantum computing in the Pauli or Clifford frame with slow error diagnostics
Chamberland, C., Iyer, P. S., & Poulin, D. (2018) · Quantum · doi:10.22331/q-2018-01-04-43 · Cited by 59
Is error detection helpful on IBM 5Q chips?
Vuillot, C. (2018) · Quantum Information and Computation · doi:10.26421/qic18.11-12-4 · Cited by 56
Readout and control of the spin-orbit states of two coupled acceptor atoms in a silicon transistor
van der Heijden, J., Kobayashi, T., House, M. G., Salfi, J., Barraud, S., Laviéville, R., Simmons, M. Y., & Rogge, S. M. J. (2018) · Science Advances · doi:10.1126/sciadv.aat9199 · Cited by 36
Cited by
6G and Beyond: The Future of Wireless Communications Systems
Akyildiz, I. F., Kak, A., & Nie, S. (2020) · IEEE Access · doi:10.1109/access.2020.3010896 · Cited by 1,385
Challenges and opportunities in quantum machine learning
Cerezo, M., Verdon, G., Huang, H.-Y., Cincio, L., & Coles, P. J. (2022) · Nature Computational Science · doi:10.1038/s43588-022-00311-3 · Cited by 689
Practical quantum advantage in quantum simulation
Daley, A. J., Bloch, I., Kokail, C., Flannigan, S., Pearson, N., Troyer, M., & Zoller, P. (2022) · Nature · doi:10.1038/s41586-022-04940-6 · Cited by 669
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
Self-citationPerspective on the Current State-of-the-Art of Quantum Computing for Drug Discovery Applications
Blunt, N. S., Camps, J., Crawford, O., Izsák, R., Leontica, S., Mirani, A., Moylett, A. E., Scivier, S. A., Sünderhauf, C., Schopf, P., et al. (2022) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.2c00574 · Cited by 192
Metadata
- Authors
- Roffe, J.
- Venue
- Contemporary Physics
- Publisher
- Informa UK Limited
- Published
- 2019-07-03
- Volume
- 60
- Issue
- 3
- Pages
- 226-245
- ISSN
- 0010-7514 (ISSN-L)
- 1366-5812
- OpenAlex
- W2963127785
- Cited by
- 356
- References
- 65
- FWCI
- 7.02
- Type
- journal article
- Language
- en
- Open access
- green
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.