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

The DOI matches its Crossref record; 53 of the 53 references it cites were found in a registry or an index.

Exponential suppression of bit or phase errors with cyclic error correction

Open access
Google Quantum AI, Chen, Zijun, Satzinger, Kevin J., Atalaya, Juan, Korotkov, Alexander N., Dunsworth, Andrew, Sank, Daniel, Quintana, Chris, McEwen, Matt, Barends, Rami, Klimov, Paul V., Hong, Sabrina, Jones, Cody, Petukhov, Andre, Kafri, Dvir, Demura, Sean, Burkett, Brian, Gidney, Craig, Fowler, Austin G., Paler, Alexandru, Putterman, Harald, Aleiner, Igor, Arute, Frank, Arya, Kunal, Babbush, Ryan, Bardin, Joseph C., Bengtsson, Andreas, Bourassa, Alexandre, Broughton, Michael, Buckley, Bob B., Buell, David A., Bushnell, Nicholas, Chiaro, Benjamin, Collins, Roberto, Courtney, William, Derk, Alan R., Eppens, Daniel, Erickson, Catherine, Farhi, Edward, Foxen, Brooks, Giustina, Marissa, Greene, Ami, Gross, Jonathan A., Harrigan, Matthew P., Harrington, Sean D., Hilton, Jeremy, Ho, Alan, Huang, Trent, Huggins, William J., Ioffe, L. B., Isakov, Sergei V., Jeffrey, Evan, Jiang, Zhang, Kechedzhi, Kostyantyn, Kim, Seon, Kitaev, Alexei, Kostritsa, Fedor, Landhuis, David, Laptev, Pavel, Lucero, Erik, Martin, Orion, McClean, Jarrod R., McCourt, Trevor, Mi, Xiao, Miao, Kevin C., Mohseni, Masoud, Montazeri, Shirin, Mruczkiewicz, Wojciech, Mutus, Josh, Naaman, Ofer, Neeley, Matthew, Neill, Charles, Newman, Michael, Niu, Murphy Yuezhen, O’Brien, Thomas E., Opremcak, Alex, Ostby, Eric, Pató, Bálint, Redd, Nicholas, Roushan, Pedram, Rubin, Nicholas C., Shvarts, Vladimir, Strain, Doug, Szalay, Marco, Trevithick, Matthew D., Villalonga, Benjamin, White, Theodore, Yao, Z. Jamie, Yeh, Ping, Yoo, Juhwan, Zalcman, Adam, Neven, Hartmut, Boixo, Sergio, Smelyanskiy, Vadim, Chen, Yu, Megrant, Anthony, Kelly, Julian · 2021 · Nature

Abstract

Realizing the potential of quantum computing requires sufficiently low logical error rates 1 . Many applications call for error rates as low as 10 −15 (refs. 2–9 ), but state-of-the-art quantum platforms typically have physical error rates near 10 −3 (refs. 10–14 ). Quantum error correction 15–17 promises to bridge this divide by distributing quantum logical information across many physical qubits in such a way that errors can be detected and corrected. Errors on the encoded logical qubit state can be exponentially suppressed as the number of physical qubits grows, provided that the physical error rates are below a certain threshold and stable over the course of a computation. Here we implement one-dimensional repetition codes embedded in a two-dimensional grid of superconducting qubits that demonstrate exponential suppression of bit-flip or phase-flip errors, reducing logical error per round more than 100-fold when increasing the number of qubits from 5 to 21. Crucially, this error suppression is stable over 50 rounds of error correction. We also introduce a method for analysing error correlations with high precision, allowing us to characterize error locality while performing quantum error correction. Finally, we perform error detection with a small logical qubit using the 2D surface code on the same device 18,19 and show that the results from both one- and two-dimensional codes agree with numerical simulations that use a simple depolarizing error model. These experimental demonstrations provide a foundation for building a scalable fault-tolerant quantum computer with superconducting qubits.

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.

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

Integrity signals

Registry

Crossref · 10.1038/s41586-021-03588-y

Cites

53 of 53 references verified0 citation errors · 0 not checkable

Statistics

Figures

Fig. 1 Stabilizer circuits on Sycamore. a, Layout of distance-11 repetition code and distance-2 surface code in the Sycamore processor. In the experiment, the two codes use overlapping sets of qubits, which are offset in the figure for clarity. b, Pauli error rates for single-qubit and CZ gates and identification error rates for measurement, each benchmarked in simultaneous operation. c, Circuit schematic for the phase-flip code. Data qubits are randomly initialized into |+⟩ or |−⟩, followed by repeated application of XX stabilizer measurements and finally X-basis measurements of the data qubits. Hadamard refers to the Hadamard gate, a quantum operation. d, Illustration of error detection events that occur when a measurement disagrees with the previous round. e, Fraction of measurements (out of 80,000) that detected an error versus measurement round for the d = 11 phase-flip code. The dark line is an average of the individual traces (grey lines) for each of the 10 measure qubits. The first (last) round also uses data qubit initialization (measurement) values to identify detection events.
Fig. 1 Stabilizer circuits on Sycamore. a, Layout of distance-11 repetition code and distance-2 surface code in the Sycamore processor. In the experiment, the two codes use overlapping sets of qubits, which are offset in the figure for clarity. b, Pauli error rates for single-qubit and CZ gates and identification error rates for measurement, each benchmarked in simultaneous operation. c, Circuit schematic for the phase-flip code. Data qubits are randomly initialized into |+⟩ or |−⟩, followed by repeated application of XX stabilizer measurements and finally X-basis measurements of the data qubits. Hadamard refers to the Hadamard gate, a quantum operation. d, Illustration of error detection events that occur when a measurement disagrees with the previous round. e, Fraction of measurements (out of 80,000) that detected an error versus measurement round for the d = 11 phase-flip code. The dark line is an average of the individual traces (grey lines) for each of the 10 measure qubits. The first (last) round also uses data qubit initialization (measurement) values to identify detection events.CC BY · PubMed Central
Fig. 2 Analysis of error detections. a, Detection event graph. Errors in the code trigger two detections (except at the ends of the chain), each represented by a node. Edges represent the expected correlations due to data qubit errors (spacelike and spacetimelike) and measure qubit errors (timelike). b, Ordering of the measure qubits in the repetition code. c, Measured two-point correlations (pij) between detection events represented as a symmetric matrix. The axes correspond to possible locations of detection events, with major ticks marking measure qubits (space) and minor ticks marking difference (Δround) in rounds (time). For the purpose of illustration, we have averaged together the matrices for 4-round segments of the 50-round experiment shown in Fig. 1e and also set pij = 0 if i = j. A description of the uncertainties on the matrix values can be found in Supplementary Information section IX. The upper triangle shows the full scale, where only the expected spacelike and timelike correlations are apparent. The lower triangle shows a truncated colour scale, highlighting unexpected detection pairs due to crosstalk and leakage. Note that observed crosstalk errors occur between next-nearest neighbours in the 2D array. d, Top: observed high-energy event in a time series of repetition code runs. Bottom: zoom-in on high-energy event, showing rapid rise and exponential decay of device-wide errors, and data that are removed when computing logical error probabilities.
Fig. 2 Analysis of error detections. a, Detection event graph. Errors in the code trigger two detections (except at the ends of the chain), each represented by a node. Edges represent the expected correlations due to data qubit errors (spacelike and spacetimelike) and measure qubit errors (timelike). b, Ordering of the measure qubits in the repetition code. c, Measured two-point correlations (pij) between detection events represented as a symmetric matrix. The axes correspond to possible locations of detection events, with major ticks marking measure qubits (space) and minor ticks marking difference (Δround) in rounds (time). For the purpose of illustration, we have averaged together the matrices for 4-round segments of the 50-round experiment shown in Fig. 1e and also set pij = 0 if i = j. A description of the uncertainties on the matrix values can be found in Supplementary Information section IX. The upper triangle shows the full scale, where only the expected spacelike and timelike correlations are apparent. The lower triangle shows a truncated colour scale, highlighting unexpected detection pairs due to crosstalk and leakage. Note that observed crosstalk errors occur between next-nearest neighbours in the 2D array. d, Top: observed high-energy event in a time series of repetition code runs. Bottom: zoom-in on high-energy event, showing rapid rise and exponential decay of device-wide errors, and data that are removed when computing logical error probabilities.CC BY · PubMed Central
Fig. 3 Logical errors in the repetition code. a, Logical error probability versus number of detection rounds and number of qubits for the phase-flip code. Smaller code sizes are subsampled from the 21-qubit code as shown in the inset; small dots are data from subsamples and large dots are averages. b, Semilog plot of the averages from a showing even spacing in log(error probability) between the code sizes. Error bars are estimated standard error from binomial sampling given the total number of statistics over all subsamples. The lines are exponential fits to data for rounds greater than 10. c, Logical error per round (εL) versus number of qubits, showing exponential suppression of error rate for both bit-flip and phase-flip, with extracted Λ factors. The fits for Λ and uncertainties were obtained using a linear regression on the log of the logical error per round versus the code distance. The fit excludes nqubits = 5 to reduce the influence of spatial boundary effects (Supplementary Information section VII).
Fig. 3 Logical errors in the repetition code. a, Logical error probability versus number of detection rounds and number of qubits for the phase-flip code. Smaller code sizes are subsampled from the 21-qubit code as shown in the inset; small dots are data from subsamples and large dots are averages. b, Semilog plot of the averages from a showing even spacing in log(error probability) between the code sizes. Error bars are estimated standard error from binomial sampling given the total number of statistics over all subsamples. The lines are exponential fits to data for rounds greater than 10. c, Logical error per round (εL) versus number of qubits, showing exponential suppression of error rate for both bit-flip and phase-flip, with extracted Λ factors. The fits for Λ and uncertainties were obtained using a linear regression on the log of the logical error per round versus the code distance. The fit excludes nqubits = 5 to reduce the influence of spatial boundary effects (Supplementary Information section VII).CC BY · PubMed Central
Fig. 4 Error budgeting repetition and surface codes. a, Depolarizing error probability (bit flip errors for M and R) for various operations in the stabilizer circuit, derived from averaging quantities in Fig. 1b. Note that the idle gate (I) and dynamical decoupling (DD) values depend on the code being run because the data qubits occupy different states. Op., operation; Rep., repetition. b, Estimated error budgets for the bit-flip and phase-flip codes, and projected error budget for the surface code, based on the depolarizing errors from a. The repetition code budgets slightly underestimate the experimental errors, and the discrepancy is labelled stray error. For the surface code, the estimated 1/Λ corresponds to the difference in εL between a d = 3 and d = 5 surface code, and is ~4 times higher than in the repetition codes owing to the more stringent threshold for the surface code. Rep., repetition c, For the d = 2 surface code, the fraction of runs that had no detection events versus number of rounds, plotted with the prediction from a similar error model as the repetition code (dashed line). Inset: physical qubit layout of the d = 2 surface code, seven qubits embedded in a 2D array. d, Probability of logical error in the surface code among runs with no detection events versus number of rounds. Depolarizing model simulations that do not include leakage or crosstalk (dashed lines) show good agreement. Error bars for c (not visible) and d are estimated standard error from binomial sampling with 240,000 experimental shots, minus the shots removed by post-selection in d.
Fig. 4 Error budgeting repetition and surface codes. a, Depolarizing error probability (bit flip errors for M and R) for various operations in the stabilizer circuit, derived from averaging quantities in Fig. 1b. Note that the idle gate (I) and dynamical decoupling (DD) values depend on the code being run because the data qubits occupy different states. Op., operation; Rep., repetition. b, Estimated error budgets for the bit-flip and phase-flip codes, and projected error budget for the surface code, based on the depolarizing errors from a. The repetition code budgets slightly underestimate the experimental errors, and the discrepancy is labelled stray error. For the surface code, the estimated 1/Λ corresponds to the difference in εL between a d = 3 and d = 5 surface code, and is ~4 times higher than in the repetition codes owing to the more stringent threshold for the surface code. Rep., repetition c, For the d = 2 surface code, the fraction of runs that had no detection events versus number of rounds, plotted with the prediction from a similar error model as the repetition code (dashed line). Inset: physical qubit layout of the d = 2 surface code, seven qubits embedded in a 2D array. d, Probability of logical error in the surface code among runs with no detection events versus number of rounds. Depolarizing model simulations that do not include leakage or crosstalk (dashed lines) show good agreement. Error bars for c (not visible) and d are estimated standard error from binomial sampling with 240,000 experimental shots, minus the shots removed by post-selection in d.CC BY · PubMed Central

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.

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?

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 53 references

Research works printed but not linked: 1

  1. Gottesman, D. Stabilizer Codes and Quantum Error Correction. PhD thesis, CalTech (1997)

Cited by

See all 393

Metadata

Authors
Google Quantum, A. I., Chen, Z., Satzinger, K. J., Atalaya, J., Korotkov, A. N., Dunsworth, A., Sank, D., Quintana, C., McEwen, M., Barends, R., Klimov, P. V., Hong, S., Jones, C., Petukhov, A., Kafri, D., Demura, S., Burkett, B., Gidney, C., Fowler, A. G., Paler, A., Putterman, H., Aleiner, I., Arute, F., Arya, K., Babbush, R., Bardin, J. C., Bengtsson, A., Bourassa, A., Broughton, M., Buckley, B. B., Buell, D. A., Bushnell, N., Chiaro, B., Collins, R., Courtney, W., Derk, A. R., Eppens, D., Erickson, C., Farhi, E., Foxen, B., Giustina, M., Greene, A., Gross, J. A., Harrigan, M. P., Harrington, S. D., Hilton, J., Ho, A., Huang, T., Huggins, W. J., Ioffe, L. B., Isakov, S. V., Jeffrey, E., Jiang, Z., Kechedzhi, K., Kim, S., Kitaev, A., Kostritsa, F., Landhuis, D., Laptev, P., Lucero, E., Martin, O., McClean, J. R., McCourt, T., Mi, X., Miao, K. C., Mohseni, M., Montazeri, S., Mruczkiewicz, W., Mutus, J., Naaman, O., Neeley, M., Neill, C., Newman, M., Niu, M. Y., O’Brien, T. E., Opremcak, A., Ostby, E., Pató, B., Redd, N., Roushan, P., Rubin, N. C., Shvarts, V., Strain, D., Szalay, M., Trevithick, M. D., Villalonga, B., White, T., Yao, Z. J., Yeh, P., Yoo, J., Zalcman, A., Neven, H., Boixo, S., Smelyanskiy, V., Chen, Y., Megrant, A., & Kelly, J.
Affiliations
  • Google (United States) (US)
  • University of California, Riverside (US)
  • Johannes Kepler University of Linz (AT)
  • California Institute of Technology (US)
Corresponding author
  • Megrant, Anthony
  • Kelly, Julian
Venue
Nature
Published
2021-07-14
Volume
595
Issue
7867
Pages
383-387
ISSN
  • 0028-0836 (ISSN-L)
  • 1476-4687
OpenAlex
W3178633198
Cited by
393
References
53
Citations by year
2026: 44 · 2025: 80 · 2024: 74 · 2023: 91 · 2022: 80 · 2021: 23
FWCI
23.47
Type
journal article
Language
en
Open access
Licence
Locations
  • Nature (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • CaltechAUTHORS (California Institute of Technology) (submittedVersion, cc-by)
  • eScholarship (California Digital Library) (submittedVersion, cc-by)
  • arXiv (Cornell University) (cc-by)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
Keywords
quantum error correction, repetition codes, superconducting qubits, bit-flip errors, phase-flip errors, error correlation, surface code, fault-tolerant quantum computing, error threshold

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: Exponential suppression of bit or phase errors with cyclic error correction. https://app.cochat.ai/papers/10.1038/s41586-021-03588-y
The paper
Google Quantum, A. I., Chen, Z., Satzinger, K. J., Atalaya, J., Korotkov, A. N., Dunsworth, A., Sank, D., Quintana, C., McEwen, M., Barends, R., Klimov, P. V., Hong, S., Jones, C., Petukhov, A., Kafri, D., Demura, S., Burkett, B., Gidney, C., Fowler, A. G., . . . Kelly, J. (2021). Exponential suppression of bit or phase errors with cyclic error correction. Nature. https://doi.org/10.1038/s41586-021-03588-y

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.