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

The DOI matches its Crossref record; 65 of the 69 references it cites were found in a registry or an index; 8 of the 13 sources its claims cite were checked for support.

Suppressing quantum errors by scaling a surface code logical qubit

Open access
Google Quantum AI, Acharya, Rajeev, Aleiner, Igor, Allen, Richard, Andersen, Trond I., Ansmann, Markus, Arute, Frank, Arya, Kunal, Asfaw, Abraham, Atalaya, Juan, Babbush, Ryan, Bacon, Dave, Bardin, Joseph C., Basso, Joao, Bengtsson, Andreas, Boixo, Sergio, Bortoli, Gina, Bourassa, Alexandre, Bovaird, Jenna, Brill, Leon, Broughton, Michael, Buckley, Bob B., Buell, David A., Burger, Tim, Burkett, Brian, Bushnell, Nicholas, Chen, Yu, Chen, Zijun, Chiaro, Ben, Cogan, Josh, Collins, Roberto, Conner, Paul, Courtney, William, Crook, Alexander L., Curtin, Ben, Debroy, Dripto M., Del Toro Barba, Alexander, Demura, Sean, Dunsworth, Andrew, Eppens, Daniel, Erickson, Catherine, Faoro, Lara, Farhi, Edward, Fatemi, Reza, Flores Burgos, Leslie, Forati, Ebrahim, Fowler, Austin G., Foxen, Brooks, Giang, William, Gidney, Craig, Gilboa, Dar, Giustina, Marissa, Grajales Dau, Alejandro, Gross, Jonathan A., Habegger, Steve, Hamilton, Michael C., Harrigan, Matthew P., Harrington, Sean D., Higgott, Oscar, Hilton, Jeremy, Hoffmann, Markus, Hong, Sabrina, Huang, Trent, Huff, Ashley, Huggins, William J., Ioffe, Lev B., Isakov, Sergei V., Iveland, Justin, Jeffrey, Evan, Jiang, Zhang, Jones, Cody, Juhas, Pavol, Kafri, Dvir, Kechedzhi, Kostyantyn, Kelly, Julian, Khattar, Tanuj, Khezri, Mostafa, Kieferová, Mária, Kim, Seon, Kitaev, Alexei, Klimov, Paul V., Klots, Andrey R., Korotkov, Alexander N., Kostritsa, Fedor, Kreikebaum, John Mark, Landhuis, David, Laptev, Pavel, Lau, Kim-Ming, Laws, Lily, Lee, Joonho, Lee, Kenny, Lester, Brian J., Lill, Alexander, Liu, Wayne, Locharla, Aditya, Lucero, Erik, Malone, Fionn D., Marshall, Jeffrey, Martin, Orion, McClean, Jarrod R., McCourt, Trevor, McEwen, Matt, Megrant, Anthony, Meurer Costa, Bernardo, Mi, Xiao, Miao, Kevin C., Mohseni, Masoud, Montazeri, Shirin, Morvan, Alexis, Mount, Emily, Mruczkiewicz, Wojciech, Naaman, Ofer, Neeley, Matthew, Neill, Charles, Nersisyan, Ani, Neven, Hartmut, Newman, Michael, Ng, Jiun How, Nguyen, Anthony, Nguyen, Murray, Niu, Murphy Yuezhen, O’Brien, Thomas E., Opremcak, Alex, Platt, John, Petukhov, Andre, Potter, Rebecca, Pryadko, Leonid P., Quintana, Chris, Roushan, Pedram, Rubin, Nicholas C., Saei, Negar, Sank, Daniel, Sankaragomathi, Kannan, Satzinger, Kevin J., Schurkus, Henry F., Schuster, Christopher, Shearn, Michael J., Shorter, Aaron, Shvarts, Vladimir, Skruzny, Jindra, Smelyanskiy, Vadim, Smith, W. Clarke, Sterling, George, Strain, Doug, Szalay, Marco, Torres, Alfredo, Vidal, Guifre, Villalonga, Benjamin, Vollgraff Heidweiller, Catherine, White, Theodore, Xing, Cheng, Yao, Z. Jamie, Yeh, Ping, Yoo, Juhwan, Young, Grayson, Zalcman, Adam, Zhang, Yaxing, Zhu, Ningfeng · 2023 · Nature

Abstract

Practical quantum computing will require error rates well below those achievable with physical qubits. Quantum error correction 1,2 offers a path to algorithmically relevant error rates by encoding logical qubits within many physical qubits, for which increasing the number of physical qubits enhances protection against physical errors. However, introducing more qubits also increases the number of error sources, so the density of errors must be sufficiently low for logical performance to improve with increasing code size. Here we report the measurement of logical qubit performance scaling across several code sizes, and demonstrate that our system of superconducting qubits has sufficient performance to overcome the additional errors from increasing qubit number. We find that our distance-5 surface code logical qubit modestly outperforms an ensemble of distance-3 logical qubits on average, in terms of both logical error probability over 25 cycles and logical error per cycle ((2.914 ± 0.016)% compared to (3.028 ± 0.023)%). To investigate damaging, low-probability error sources, we run a distance-25 repetition code and observe a 1.7 × 10 −6 logical error per cycle floor set by a single high-energy event (1.6 × 10 −7 excluding this event). We accurately model our experiment, extracting error budgets that highlight the biggest challenges for future systems. These results mark an experimental demonstration in which quantum error correction begins to improve performance with increasing qubit number, illuminating the path to reaching the logical error rates required for computation.

Overview

CoChat Summary

TL;DR

Google Quantum AI reports a 72-qubit superconducting device running a distance-5 surface code logical qubit that modestly outperforms an ensemble of distance-3 logical qubits over 25 cycles. The result demonstrates that quantum error correction can begin to improve logical performance with increasing code size, while identifying leakage, stray interactions, and high-energy events as key remaining challenges.

Key findings

  • The distance-5 surface code achieved a logical error per cycle of (2.914 ± 0.016)% versus (3.028 ± 0.023)% averaged over four distance-3 subgrids, a relative reduction of about 4% with the approximate maximum-likelihood decoder; with belief-matching decoding, the values were (3.056 ± 0.015)% versus (3.118 ± 0.025)%, about 2%.
  • Detection probabilities were similar across code distances: weight-4 stabilizers averaged 0.185 ± 0.018 for distance-5 and 0.175 ± 0.017 for distance-3; weight-2 stabilizers averaged 0.119 ± 0.012 and 0.115 ± 0.008, respectively.
  • A distance-25 repetition code reached (1.7 ± 0.3) × 10⁻⁶ logical error per cycle without post-selection; after removing one high-energy event (0.15% of trials), it reached (1.6 ± 0.8) × 10⁻⁷.
  • Error budgets identify CZ gate error and data-qubit decoherence during measurement and reset as dominant contributors; the paper estimates component performance must improve by at least 20% to move below threshold.

Methods

  • Implemented the surface code on an expanded Sycamore device with 72 transmon qubits and 121 tunable couplers, mean T1 = 20 μs and T2,CPMG = 30 μs. The distance-5 code used a 49-qubit subset (25 data, 24 measure qubits) and was compared with the average of four distance-3 subgrids, each with nine data and eight measure qubits.
  • Each experimental instance initialized a logical state, ran 25 cycles of error correction, and measured the final logical state; detection probabilities were measured over 50,000 instances. Decoding used belief-matching and tensor-network approximate maximum-likelihood decoders, with error hypergraphs derived from detection-event correlations.
  • Logical fidelity F = 1 − 2pL was fit to an exponential decay starting at t = 3. Simulations included depolarizing, Pauli+, and Pauli-only models; the distance-25 repetition code was decoded with minimum-weight perfect matching.

Limitations

  • The paper states that device inhomogeneity makes comparing distance-5 and distance-3 under identical noise difficult; the distance-5 logical error per cycle was slightly higher than two individual distance-3 codes, and leakage accumulation may cause distance-5 performance to degrade faster as logical error probability approaches 50%.
  • The paper states that projections to future devices rely on simplified models and must be validated experimentally, and that leakage, stray interactions, and high-energy events such as cosmic-ray impacts must be mitigated.
  • Evident from the text: the demonstration is modest, with only about 2–4% relative improvement over the distance-3 average, and the repetition-code floor was dominated by a single high-energy event; the repetition code also does not correct phase-flip errors and is not suitable for quantum algorithms.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1038/s41586-022-05434-1

Cites

65 of 65 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Figures

Fig. 1 Implementing surface code logical qubits. a, Schematic of a 72-qubit Sycamore device with a distance-5 surface code embedded, consisting of 25 data qubits (gold) and 24 measure qubits (blue). Each measure qubit is associated with a stabilizer (blue coloured tile, dark: X, light: Z). Representative logical operators ZL (black) and XL (green) traverse the array, intersecting at the lower-left data qubit. The upper right quadrant (red outline) is one of four subset distance-3 codes (the four quadrants) that we compare to distance-5. b, Illustration of a stabilizer measurement, focusing on one data qubit (labelled ψ) and one measure qubit (labelled 0), in perspective view with time progressing to the right. Each qubit participates in four CZ gates (black) with its four nearest neighbours, interspersed with Hadamard gates (H), and finally, the measure qubit is measured and reset to |0⟩ (MR). Data qubits perform dynamical decoupling (DD) while waiting for the measurement and reset. All stabilizers are measured in this manner concurrently. Cycle duration is 921 ns, including 25-ns single-qubit gates, 34-ns two-qubit gates, 500-ns measurement and 160-ns reset (see Supplementary Information for compilation details). The readout and reset take up most of the cycle time, so the concurrent data qubit idling is a dominant source of error. c, Cumulative distributions of errors for single-qubit gates (1Q), CZ gates, measurement (Meas.) and data qubit dynamical decoupling (idle during measurement and reset), which we refer to as component errors. The circuits were benchmarked in simultaneous operation using random circuit techniques, on the 49 qubits used in distance-5 and the 4 CZ layers from the stabilizer circuit38,59 (see Supplementary Information). Vertical lines are means.
Fig. 1 Implementing surface code logical qubits. a, Schematic of a 72-qubit Sycamore device with a distance-5 surface code embedded, consisting of 25 data qubits (gold) and 24 measure qubits (blue). Each measure qubit is associated with a stabilizer (blue coloured tile, dark: X, light: Z). Representative logical operators ZL (black) and XL (green) traverse the array, intersecting at the lower-left data qubit. The upper right quadrant (red outline) is one of four subset distance-3 codes (the four quadrants) that we compare to distance-5. b, Illustration of a stabilizer measurement, focusing on one data qubit (labelled ψ) and one measure qubit (labelled 0), in perspective view with time progressing to the right. Each qubit participates in four CZ gates (black) with its four nearest neighbours, interspersed with Hadamard gates (H), and finally, the measure qubit is measured and reset to |0⟩ (MR). Data qubits perform dynamical decoupling (DD) while waiting for the measurement and reset. All stabilizers are measured in this manner concurrently. Cycle duration is 921 ns, including 25-ns single-qubit gates, 34-ns two-qubit gates, 500-ns measurement and 160-ns reset (see Supplementary Information for compilation details). The readout and reset take up most of the cycle time, so the concurrent data qubit idling is a dominant source of error. c, Cumulative distributions of errors for single-qubit gates (1Q), CZ gates, measurement (Meas.) and data qubit dynamical decoupling (idle during measurement and reset), which we refer to as component errors. The circuits were benchmarked in simultaneous operation using random circuit techniques, on the 49 qubits used in distance-5 and the 4 CZ layers from the stabilizer circuit38,59 (see Supplementary Information). Vertical lines are means.CC BY · PubMed Central
Fig. 2 Error detection in the surface code. a, Illustration of a surface code experiment, in perspective view with time progressing to the right. We begin with an initial data qubit state that has known parities in one stabilizer basis (here, Z). We show example errors that manifest in detection pairs: a Z error (red) on a data qubit (spacelike pair), a measurement error (purple) on a measure qubit (timelike pair), an X error (blue) during the CZ gates (spacetimelike pair) and a measurement error (green) on a data qubit (detected in the final inferred Z parities). b, Detection probability for each stabilizer over a 25-cycle distance-5 experiment (50,000 repetitions). Darker lines: average over all stabilizers with the same weight. There are fewer detections at timestep t = 0 because there is no preceding syndrome extraction, and at t = 25 because the final parities are calculated from data qubit measurements directly. QEC, quantum error correction. c, Detection probability heatmap, averaging over t = 1 to 24. d,e, Similar to b,c for four separate distance-3 experiments covering the four quadrants of the distance-5 code. f,g, Similar to b,c using a simulation with Pauli errors plus leakage, crosstalk and stray interactions (Pauli+). h, Bar chart summarizing the detection correlation matrix pij, comparing the distance-5 experiment from b to the simulation in f (Pauli+) and a simpler simulation with only Pauli errors. We aggregate four groups of correlations: timelike pairs; spacelike pairs; spacetimelike pairs expected for Pauli noise; and spacetimelike pairs unexpected for Pauli noise (Unexp.), including correlations over two timesteps. Each bar shows a mean and standard deviation of correlations from a 25-cycle, 50,000-repetition dataset.
Fig. 2 Error detection in the surface code. a, Illustration of a surface code experiment, in perspective view with time progressing to the right. We begin with an initial data qubit state that has known parities in one stabilizer basis (here, Z). We show example errors that manifest in detection pairs: a Z error (red) on a data qubit (spacelike pair), a measurement error (purple) on a measure qubit (timelike pair), an X error (blue) during the CZ gates (spacetimelike pair) and a measurement error (green) on a data qubit (detected in the final inferred Z parities). b, Detection probability for each stabilizer over a 25-cycle distance-5 experiment (50,000 repetitions). Darker lines: average over all stabilizers with the same weight. There are fewer detections at timestep t = 0 because there is no preceding syndrome extraction, and at t = 25 because the final parities are calculated from data qubit measurements directly. QEC, quantum error correction. c, Detection probability heatmap, averaging over t = 1 to 24. d,e, Similar to b,c for four separate distance-3 experiments covering the four quadrants of the distance-5 code. f,g, Similar to b,c using a simulation with Pauli errors plus leakage, crosstalk and stray interactions (Pauli+). h, Bar chart summarizing the detection correlation matrix pij, comparing the distance-5 experiment from b to the simulation in f (Pauli+) and a simpler simulation with only Pauli errors. We aggregate four groups of correlations: timelike pairs; spacelike pairs; spacetimelike pairs expected for Pauli noise; and spacetimelike pairs unexpected for Pauli noise (Unexp.), including correlations over two timesteps. Each bar shows a mean and standard deviation of correlations from a 25-cycle, 50,000-repetition dataset.CC BY · PubMed Central
Fig. 3 Logical error reduction. a, Logical error probability pL versus cycle comparing distance-5 (blue) to distance-3 (pink: four separate quadrants, red: average), all averaged over ZL and XL. Each individual data point represents 100,000 repetitions. Solid line: fit to experimental average, t = 3 to 25 (see main text). Dotted line: comparison to Pauli+ simulation. b, Logical fidelity F = 1 − 2pL versus cycle, semilog plot. The datapoints and fits are the experimental averages and fits from a. c, Summary of experimental progression comparing logical error per cycle εd (specifically plotting 1 − εd) between distance-3 and distance-5, for which system improvements lead to faster improvement for distance-5 (see main text). Each open circle is a comparison to a specific distance-3 code, and filled circles average over several distance-3 codes measured in the same session. Markers are coloured chronologically from light to dark. Typical 1σ statistical and fit uncertainty is 0.02%, smaller than the points.
Fig. 3 Logical error reduction. a, Logical error probability pL versus cycle comparing distance-5 (blue) to distance-3 (pink: four separate quadrants, red: average), all averaged over ZL and XL. Each individual data point represents 100,000 repetitions. Solid line: fit to experimental average, t = 3 to 25 (see main text). Dotted line: comparison to Pauli+ simulation. b, Logical fidelity F = 1 − 2pL versus cycle, semilog plot. The datapoints and fits are the experimental averages and fits from a. c, Summary of experimental progression comparing logical error per cycle εd (specifically plotting 1 − εd) between distance-3 and distance-5, for which system improvements lead to faster improvement for distance-5 (see main text). Each open circle is a comparison to a specific distance-3 code, and filled circles average over several distance-3 codes measured in the same session. Markers are coloured chronologically from light to dark. Typical 1σ statistical and fit uncertainty is 0.02%, smaller than the points.CC BY · PubMed Central
Fig. 4 Towards algorithmically relevant error rates. a, Estimated error budget for the surface code, based on component errors (see Fig. 1c) and Pauli+ simulations. Λ3/5 = ε3/ε5. CZ, contributions from CZ error (excluding leakage and stray interactions). CZ stray int., CZ error from unwanted interactions. DD, dynamical decoupling (data qubit idle error during measurement and reset). Measure, measurement and reset error. Leakage, leakage during CZs and due to heating. 1Q, single-qubit gate error. b, Logical error for repetition codes. Inset: schematic of the distance-25 repetition code, using the same data and measure qubits as the distance-5 surface code. Smaller codes are subsampled from the same distance-25 data42. A high-energy event resulted in an apparent error floor around 10−6. After removing the instances nearby (light blue), error decreases more rapidly with code distance. The dataset has 50 cycles, 5 × 105 repetitions. We also plot the surface code error per cycle from Fig. 3b in black. c, Contour plot of simulated surface code logical error per cycle εd as a function of code distance d and a scale factor s on the error model in Fig. 1c (Pauli simulation, s = 1.0 corresponds to the current device error model). d, Horizontal slices from c, each for a value of error-model scale factor s. s = 1.3 is above threshold (larger codes are worse), and s = 1.2 to 1.0 represent the crossover regime, for which progressively larger codes get better until a turnaround. s = 0.9 is below threshold (larger codes are better).
Fig. 4 Towards algorithmically relevant error rates. a, Estimated error budget for the surface code, based on component errors (see Fig. 1c) and Pauli+ simulations. Λ3/5 = ε3/ε5. CZ, contributions from CZ error (excluding leakage and stray interactions). CZ stray int., CZ error from unwanted interactions. DD, dynamical decoupling (data qubit idle error during measurement and reset). Measure, measurement and reset error. Leakage, leakage during CZs and due to heating. 1Q, single-qubit gate error. b, Logical error for repetition codes. Inset: schematic of the distance-25 repetition code, using the same data and measure qubits as the distance-5 surface code. Smaller codes are subsampled from the same distance-25 data42. A high-energy event resulted in an apparent error floor around 10−6. After removing the instances nearby (light blue), error decreases more rapidly with code distance. The dataset has 50 cycles, 5 × 105 repetitions. We also plot the surface code error per cycle from Fig. 3b in black. c, Contour plot of simulated surface code logical error per cycle εd as a function of code distance d and a scale factor s on the error model in Fig. 1c (Pauli simulation, s = 1.0 corresponds to the current device error model). d, Horizontal slices from c, each for a value of error-model scale factor s. s = 1.3 is above threshold (larger codes are worse), and s = 1.2 to 1.0 represent the crossover regime, for which progressively larger codes get better until a turnaround. s = 0.9 is below threshold (larger codes are better).CC BY · PubMed Central

Verification

Claims the paper makes

6 Valid · 1 Not valid · 2 Not checked · 35 Own results and interpretations

22 more claims · 1 with their cited sources checked

Create a free account to see all 44 claims and to verify the 5 references still open.

See all claims — free account
  • It may state two separate claims as one. 13
  • Probably not a substantial claim. 6

Create a free account to see these claims.

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?

4 more claims about this paper

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

See all claims — free account

Citations

Cites

Show all 69 references

Research works printed but not linked: 3

  1. Gottesman, D. Stabilizer Codes and Quantum Error Correction. PhD thesis, California Institute of Technology (1997).
  2. Neill, C. A Path towards Quantum Supremacy with Superconducting Qubits. PhD thesis, Univ. California Santa Barbara (2017).
  3. Aliferis, P. & Terhal, B. M. Fault-tolerant quantum computation for local leakage faults. Quantum Inf. Comput. 7, 139–156 (2007).

Cited by

See all 1,103

Metadata

Authors
Google Quantum, A. I., Acharya, R., Aleiner, I., Allen, R., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., Atalaya, J., Babbush, R., Bacon, D., Bardin, J. C., Basso, J., Bengtsson, A., Boixo, S., Bortoli, G., Bourassa, A., Bovaird, J., Brill, L., Broughton, M., Buckley, B. B., Buell, D. A., Burger, T., Burkett, B., Bushnell, N., Chen, Y., Chen, Z., Chiaro, B., Cogan, J., Collins, R., Conner, P., Courtney, W., Crook, A. L., Curtin, B., Debroy, D. M., Del Toro Barba, A., Demura, S., Dunsworth, A., Eppens, D., Erickson, C., Faoro, L., Farhi, E., Fatemi, R., Flores Burgos, L., Forati, E., Fowler, A. G., Foxen, B., Giang, W., Gidney, C., Gilboa, D., Giustina, M., Grajales Dau, A., Gross, J. A., Habegger, S., Hamilton, M. C., Harrigan, M. P., Harrington, S. D., Higgott, O., Hilton, J., Hoffmann, M., Hong, S., Huang, T., Huff, A., Huggins, W. J., Ioffe, L. B., Isakov, S. V., Iveland, J., Jeffrey, E., Jiang, Z., Jones, C., Juhas, P., Kafri, D., Kechedzhi, K., Kelly, J., Khattar, T., Khezri, M., Kieferová, M., Kim, S., Kitaev, A., Klimov, P. V., Klots, A. R., Korotkov, A. N., Kostritsa, F., Kreikebaum, J. M., Landhuis, D., Laptev, P., Lau, K.-M., Laws, L., Lee, J., Lee, K., Lester, B. J., Lill, A., Liu, W., Locharla, A., Lucero, E., Malone, F. D., Marshall, J., Martin, O., McClean, J. R., McCourt, T., McEwen, M., Megrant, A., Meurer Costa, B., Mi, X., Miao, K. C., Mohseni, M., Montazeri, S., Morvan, A., Mount, E., Mruczkiewicz, W., Naaman, O., Neeley, M., Neill, C., Nersisyan, A., Neven, H., Newman, M., Ng, J. H., Nguyen, A., Nguyen, M., Niu, M. Y., O’Brien, T. E., Opremcak, A., Platt, J., Petukhov, A., Potter, R., Pryadko, L. P., Quintana, C., Roushan, P., Rubin, N. C., Saei, N., Sank, D., Sankaragomathi, K., Satzinger, K. J., Schurkus, H. F., Schuster, C., Shearn, M. J., Shorter, A., Shvarts, V., Skruzny, J., Smelyanskiy, V., Smith, W. C., Sterling, G., Strain, D., Szalay, M., Torres, A., Vidal, G., Villalonga, B., Vollgraff Heidweiller, C., White, T., Xing, C., Yao, Z. J., Yeh, P., Yoo, J., Young, G., Zalcman, A., Zhang, Y., & Zhu, N.
Affiliations
  • Google (United States) (US)
  • University of Technology Sydney (AU)
  • California Institute of Technology (US)
  • University of California, Riverside (US)
  • Ames Research Center (US)
Corresponding author
Neven, Hartmut
ORCID
Venue
Nature
Published
2023-02-22
Volume
614
Issue
7949
Pages
676-681
ISSN
  • 0028-0836 (ISSN-L)
  • 1476-4687
OpenAlex
W4321610982
Cited by
1,103
References
69
Citations by year
2026: 222 · 2025: 418 · 2024: 290 · 2023: 160
FWCI
102.62
Type
journal article
Language
en
Open access
Licence
Locations
  • Nature (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University) (cc-by)
Funders
  • National Aeronautics and Space Administration (NNA16BD14C, SAA 403512)
  • Canadian Institute for Advanced Research
  • Ames Research Center (NNA16BD14C)
  • University of California, Santa Barbara
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
surface code, logical qubits, quantum error correction, superconducting qubits, logical error rate, error budget, high-energy events, repetition codes

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.

The claim verdicts this report counts are experimental: their accuracy is not yet measured.

A language model drew the claims from the paper on 2026-09-29, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-09-29 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

Cited sources are checked with a language model’s help (qwen3.8-omni-flash and gpt-6-sol).

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: Suppressing quantum errors by scaling a surface code logical qubit. https://app.cochat.ai/papers/10.1038/s41586-022-05434-1
The paper
Google Quantum, A. I., Acharya, R., Aleiner, I., Allen, R., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., Atalaya, J., Babbush, R., Bacon, D., Bardin, J. C., Basso, J., Bengtsson, A., Boixo, S., Bortoli, G., Bourassa, A., Bovaird, J., . . . Zhu, N. (2023). Suppressing quantum errors by scaling a surface code logical qubit. Nature. https://doi.org/10.1038/s41586-022-05434-1

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.