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

The DOI matches its Crossref record; 70 of the 70 references it cites were found in a registry or an index; 30 of the 38 sources its claims cite were checked for support.

Quantum error correction below the surface code threshold

Open access
Google Quantum AI and Collaborators, Acharya, Rajeev, Abanin, Dmitry A., Aghababaie-Beni, Laleh, Aleiner, Igor, Andersen, Trond I., Ansmann, Markus, Arute, Frank, Arya, Kunal, Asfaw, Abraham, Astrakhantsev, Nikita, Atalaya, Juan, Babbush, Ryan, Bacon, Dave, Ballard, Brian, Bardin, Joseph C., Bausch, Johannes, Bengtsson, Andreas, Bilmes, Alexander, Blackwell, Sam, Boixo, Sergio, Bortoli, Gina, Bourassa, Alexandre, Bovaird, Jenna, Brill, Leon, Broughton, Michael, Browne, David A., Buchea, Brett, Buckley, Bob B., Buell, David A., Burger, Tim, Burkett, Brian, Bushnell, Nicholas, Cabrera, Anthony, Campero, Juan, Chang, Hung-Shen, Chen, Yu, Chen, Zijun, Chiaro, Ben, Chik, Desmond, Chou, Charina, Claes, Jahan, Cleland, Agnetta Y., Cogan, Josh, Collins, Roberto, Conner, Paul, Courtney, William, Crook, Alexander L., Curtin, Ben, Das, Sayan, Davies, Alex, De Lorenzo, Laura, Debroy, Dripto M., Demura, Sean, Devoret, Michel, Di Paolo, Agustin, Donohoe, Paul, Drozdov, Ilya, Dunsworth, Andrew, Earle, Clint, Edlich, Thomas, Eickbusch, Alec, Elbag, Aviv Moshe, Elzouka, Mahmoud, Erickson, Catherine, Faoro, Lara, Farhi, Edward, Ferreira, Vinicius S., Burgos, Leslie Flores, Forati, Ebrahim, Fowler, Austin G., Foxen, Brooks, Ganjam, Suhas, Garcia, Gonzalo, Gasca, Robert, Genois, Élie, Giang, William, Gidney, Craig, Gilboa, Dar, Gosula, Raja, Dau, Alejandro Grajales, Graumann, Dietrich, Greene, Alex, Gross, Jonathan A., Habegger, Steve, Hall, John, Hamilton, Michael C., Hansen, Monica, Harrigan, Matthew P., Harrington, Sean D., Heras, Francisco J. H., Heslin, Stephen, Heu, Paula, Higgott, Oscar, Hill, Gordon, Hilton, Jeremy, Holland, George, Hong, Sabrina, Huang, Hsin-Yuan, Huff, Ashley, Huggins, William J., Ioffe, Lev B., Isakov, Sergei V., Iveland, Justin, Jeffrey, Evan, Jiang, Zhang, Jones, Cody, Jordan, Stephen, Joshi, Chaitali, Juhas, Pavol, Kafri, Dvir, Kang, Hui, Karamlou, Amir H., Kechedzhi, Kostyantyn, Kelly, Julian, Khaire, Trupti, Khattar, Tanuj, Khezri, Mostafa, Kim, Seon, Klimov, Paul V., Klots, Andrey R., Kobrin, Bryce, Kohli, Pushmeet, Korotkov, Alexander N., Kostritsa, Fedor, Kothari, Robin, Kozlovskii, Borislav, Kreikebaum, John Mark, Kurilovich, Vladislav D., Lacroix, Nathan, Landhuis, David, Lange-Dei, Tiano, Langley, Brandon W., Laptev, Pavel, Lau, Kim-Ming, Le Guevel, Loïck, Ledford, Justin, Lee, Joonho, Lee, Kenny, Lensky, Yuri D., Leon, Shannon, Lester, Brian J., Li, Wing Yan, Li, Yin, Lill, Alexander T., Liu, Wayne, Livingston, William P., Locharla, Aditya, Lucero, Erik, Lundahl, Daniel, Lunt, Aaron, Madhuk, Sid, Malone, Fionn D., Maloney, Ashley, Mandrà, Salvatore, Manyika, James, Martin, Leigh S., Martin, Orion, Martin, Steven, Maxfield, Cameron, McClean, Jarrod R., McEwen, Matt, Meeks, Seneca, Megrant, Anthony, Mi, Xiao, Miao, Kevin C., Mieszala, Amanda, Molavi, Reza, Molina, Sebastian, Montazeri, Shirin, Morvan, Alexis, Movassagh, Ramis, Mruczkiewicz, Wojciech, Naaman, Ofer, Neeley, Matthew, Neill, Charles, Nersisyan, Ani, Neven, Hartmut, Newman, Michael, Ng, Jiun How, Nguyen, Anthony, Nguyen, Murray, Ni, Chia-Hung, Niu, Murphy Yuezhen, O’Brien, Thomas E., Oliver, William D., Opremcak, Alex, Ottosson, Kristoffer, Petukhov, Andre, Pizzuto, Alex, Platt, John, Potter, Rebecca, Pritchard, Orion, Pryadko, Leonid P., Quintana, Chris, Ramachandran, Ganesh, Reagor, Matthew J., Redding, John, Rhodes, David M., Roberts, Gabrielle, Rosenberg, Eliott, Rosenfeld, Emma, Roushan, Pedram, Rubin, Nicholas C., Saei, Negar, Sank, Daniel, Sankaragomathi, Kannan, Satzinger, Kevin J., Schurkus, Henry F., Schuster, Christopher, Senior, Andrew W., Shearn, Michael J., Shorter, Aaron, Shutty, Noah, Shvarts, Vladimir, Singh, Shraddha, Sivak, Volodymyr, Skruzny, Jindra, Small, Spencer, Smelyanskiy, Vadim, Smith, W. Clarke, Somma, Rolando D., Springer, Sofia, Sterling, George, Strain, Doug, Suchard, Jordan, Szasz, Aaron, Sztein, Alex, Thor, Douglas, Torres, Alfredo, Torunbalci, M. Mert, Vaishnav, Abeer, Vargas, Justin, Vdovichev, Sergey, Vidal, Guifre, Villalonga, Benjamin, Heidweiller, Catherine Vollgraff, Waltman, Steven, Wang, Shannon X., Ware, Brayden, Weber, Kate, Weidel, Travis, White, Theodore, Wong, Kristi, Woo, Bryan W. K., Xing, Cheng, Yao, Z. Jamie, Yeh, Ping, Ying, Bicheng, Yoo, Juhwan, Yosri, Noureldin, Young, Grayson, Zalcman, Adam, Zhang, Yaxing, Zhu, Ningfeng, Zobrist, Nicholas·2025·Nature

Abstract

Quantum error correction [1, 2, 3, 4] provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit, where the logical error rate is suppressed exponentially as more qubits are added. However, this exponential suppression only occurs if the physical error rate is below a critical threshold. Here, we present two below-threshold surface code memories on our newest generation of superconducting processors, Willow: a distance-7 code, and a distance-5 code integrated with a real-time decoder. The logical error rate of our larger quantum memory is suppressed by a factor of $$\varLambda \mathrm{=2.14}\pm 0.02$$ when increasing the code distance by two, culminating in a 101-qubit distance-7 code with 0.143% ± 0.003% error per cycle of error correction. This logical memory is also beyond break-even, exceeding its best physical qubit’s lifetime by a factor of $$2.4\pm 0.3$$ . Our system maintains below-threshold performance when decoding in real time, achieving an average decoder latency of 63 μs at distance-5 up to a million cycles, with a cycle time of 1.1 μs. We also run repetition codes up to distance-29 and find that logical performance is limited by rare correlated error events occurring approximately once every hour, or $$3$$ $$\times $$ $${10}^{9}$$ cycles. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.

Overview

CoChat Summary

TL;DR

Google Quantum AI reports below-threshold surface code memories on superconducting Willow processors, including a distance-7 code with logical error suppressed by Λ = 2.14 ± 0.02 per distance increase of 2.

The distance-7 logical qubit exceeds its best physical qubit lifetime by a factor of 2.4 ± 0.3, and real-time decoding at distance 5 maintains below-threshold performance with 63 ± 17 μs average latency.

Key findings

  • A distance-7 surface code memory achieved ε7 = (1.43 ± 0.03) × 10−3 logical error per cycle with a neural-network decoder, giving Λ = 2.14 ± 0.02; with ensembled matching synthesis, Λ = 2.04 ± 0.02 and ε7 = (1.71 ± 0.03) × 10−3.
  • The distance-7 logical qubit lifetime was 291 ± 6 μs, exceeding its best constituent physical qubit lifetime (119 ± 13 μs) by a factor of 2.4 ± 0.3.
  • Real-time decoding at distance 5 achieved ε5 = 0.35% ± 0.01% and Λ = 2.0 ± 0.1, with average decoder latency 63 ± 17 μs up to 106 cycles and a 1.1 μs cycle time; offline neural-network decoding gave ε5 = 0.269% ± 0.008% and Λ = 2.18 ± 0.09.
  • Repetition codes up to distance 29 gave Λ = 8.4 ± 0.1 between d = 5 and d = 11, but a logical error floor of 10−10 appeared at d ≥ 15, attributed to rare correlated error bursts occurring approximately once per hour or 3 × 109 cycles; six large bursts occurred over 2 × 1010 cycles.

Methods

  • Experiments used superconducting transmon Willow processors: a 105-qubit processor for the distance-7 surface code (49 data qubits, 48 measure qubits, 4 leakage-removal qubits) and a 72-qubit processor for distance-5 real-time decoding and repetition codes; mean coherence times were T1 = 68 μs and T2,CPMG = 89 μs.
  • Surface code memory operation prepared a logical eigenstate, repeated syndrome extraction cycles with data-qubit leakage removal, measured individual data qubits, and fit logical error per cycle up to 250 cycles; Λ was computed by linear regression of ln[εd] versus d, averaging nine distance-3 and four distance-5 subgrids.
  • Decoding used a neural-network decoder and a harmonized ensemble of correlated minimum-weight perfect matching decoders with matching synthesis; real-time decoding used sparse blossom with a constant-sized graph buffer. Repetition-code experiments used 2 × 107 shots of a distance-29 code with 1,000 cycles, totaling 2 × 1010 cycles and 5.5 h of processor execution.

Limitations

  • Paper-stated: scaling to algorithmically relevant error rates is resource intensive; extrapolation suggests a 10−6 error rate would require a distance-27 logical qubit using 1,457 physical qubits, and real-time decoding challenges grow quadratically with code distance.
  • Paper-stated: the repetition-code noise floor of 10−10 is caused by correlated bursts whose origin is not understood, and these events may affect surface codes differently; the error budget overpredicts Λ by 14%, indicating some error effects remain uncaptured.
  • Evident from text: real-time decoding is demonstrated at distance 5, while the distance-7 result uses offline decoders; the work focuses on memory rather than logical computation, and feedback for non-Clifford gates has not yet been implemented.

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

Integrity signals

Registry

Crossref · 10.1038/s41586-024-08449-y

Cites

70 of 70 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Figures

Fig. 1 Surface code performance. a, Schematic of a distance-7 (d = 7) surface code on a 105-qubit processor. Each measure qubit (blue) is associated with a stabilizer (blue-coloured tile). Data qubits (gold) form a d × d array. We remove leakage from each data qubit using a neighbouring qubit below it, with additional leakage removal qubits at the boundary (green). b, Cumulative distributions of error probabilities measured on the 105-qubit processor. Red, Pauli errors for single-qubit gates; black, Pauli errors for CZ gates; gold, Pauli errors for data qubit idle during measurement and reset; blue, identification error for measurement; teal, weight-4 detection probabilities (distance 7, averaged for 250 cycles). c, Logical error probability pL for a range of memory experiment durations. Each data point represents 105 repetitions decoded with the neural network and is averaged over the logical basis (XL and ZL). Black and grey, data from ref. 17 for comparison. Curves, exponential fits after averaging pL over code and basis. To compute εd values, we fit each individual code and basis separately and report their average (Supplementary Information). d, Logical error per cycle, εd, reducing with surface code distance d. Uncertainty on each point is less than 7 × 10−5. The symbols match those in c. Means for d = 3 and d = 5 are computed from the separate εd fits for each code and basis. Line, fit to equation (1), determining Λ. The inset shows simulations up to d = 11 alongside experimental points, both decoded with ensembled matching synthesis for comparison. Line, fit to simulation; Λsim = 2.25 ± 0.02.
Fig. 1 Surface code performance. a, Schematic of a distance-7 (d = 7) surface code on a 105-qubit processor. Each measure qubit (blue) is associated with a stabilizer (blue-coloured tile). Data qubits (gold) form a d × d array. We remove leakage from each data qubit using a neighbouring qubit below it, with additional leakage removal qubits at the boundary (green). b, Cumulative distributions of error probabilities measured on the 105-qubit processor. Red, Pauli errors for single-qubit gates; black, Pauli errors for CZ gates; gold, Pauli errors for data qubit idle during measurement and reset; blue, identification error for measurement; teal, weight-4 detection probabilities (distance 7, averaged for 250 cycles). c, Logical error probability pL for a range of memory experiment durations. Each data point represents 105 repetitions decoded with the neural network and is averaged over the logical basis (XL and ZL). Black and grey, data from ref. 17 for comparison. Curves, exponential fits after averaging pL over code and basis. To compute εd values, we fit each individual code and basis separately and report their average (Supplementary Information). d, Logical error per cycle, εd, reducing with surface code distance d. Uncertainty on each point is less than 7 × 10−5. The symbols match those in c. Means for d = 3 and d = 5 are computed from the separate εd fits for each code and basis. Line, fit to equation (1), determining Λ. The inset shows simulations up to d = 11 alongside experimental points, both decoded with ensembled matching synthesis for comparison. Line, fit to simulation; Λsim = 2.25 ± 0.02.CC BY-NC-ND · PubMed Central
Fig. 2 Error sensitivity in the surface code. a, One cycle of the surface code circuit, focusing on one data qubit and one measure qubit. Black bar, CZ; H, Hadamard; M, measure; R, reset; DD, dynamical decoupling; orange, injected coherent errors; purple, DQLR32. b, Error injection in the surface code on a 105-qubit processor. Distance 3 averages over 9 subset codes, and distance 5 averages over 4 subset codes, as shown in Fig. 1. Logical performance is plotted against the mean weight-4 detection probability averaging over all codes, for which increasing the error injection angle α increases the detection probability. Each experiment is ten cycles with 2 × 104 total repetitions. Lines, power-law fits for data points at or below at which the codes cross. The inset shows the inverse error suppression factor, 1/Λ, versus the detection probability. Line, fit to points at which 1/Λ < 1, 3.4pdet + 0.29. c, Estimated error budget for the surface code based on component errors and simulations. CZ, CZ error, excluding leakage and stray interactions; CZ stray int., CZ error from unwanted interactions; data idle, data qubit idle error during measurement and reset; meas., measurement and reset error; leakage, leakage during CZs and due to heating; 1Q, single-qubit gate error; excess, unmodelled error, which is the difference between experimental and simulated 1/Λ (correlated matching). d, Comparison of logical performance with and without DQLR in each cycle. Distance-3 points (red triangles) are averaged over 4 quadrants. Each experiment is 105 repetitions. Curves, exponential fits. QEC, quantum error correction. e, Repeating experiments to assess performance stability, comparing distance 3 and distance 5. Each point represents a sweep of logical performance versus experiment duration, up to 250 cycles. To obtain the data in d and e, a 72-qubit processor is used.
Fig. 2 Error sensitivity in the surface code. a, One cycle of the surface code circuit, focusing on one data qubit and one measure qubit. Black bar, CZ; H, Hadamard; M, measure; R, reset; DD, dynamical decoupling; orange, injected coherent errors; purple, DQLR32. b, Error injection in the surface code on a 105-qubit processor. Distance 3 averages over 9 subset codes, and distance 5 averages over 4 subset codes, as shown in Fig. 1. Logical performance is plotted against the mean weight-4 detection probability averaging over all codes, for which increasing the error injection angle α increases the detection probability. Each experiment is ten cycles with 2 × 104 total repetitions. Lines, power-law fits for data points at or below at which the codes cross. The inset shows the inverse error suppression factor, 1/Λ, versus the detection probability. Line, fit to points at which 1/Λ < 1, 3.4pdet + 0.29. c, Estimated error budget for the surface code based on component errors and simulations. CZ, CZ error, excluding leakage and stray interactions; CZ stray int., CZ error from unwanted interactions; data idle, data qubit idle error during measurement and reset; meas., measurement and reset error; leakage, leakage during CZs and due to heating; 1Q, single-qubit gate error; excess, unmodelled error, which is the difference between experimental and simulated 1/Λ (correlated matching). d, Comparison of logical performance with and without DQLR in each cycle. Distance-3 points (red triangles) are averaged over 4 quadrants. Each experiment is 105 repetitions. Curves, exponential fits. QEC, quantum error correction. e, Repeating experiments to assess performance stability, comparing distance 3 and distance 5. Each point represents a sweep of logical performance versus experiment duration, up to 250 cycles. To obtain the data in d and e, a 72-qubit processor is used.CC BY-NC-ND · PubMed Central
Fig. 3 High-distance error scaling in repetition codes. a, εd versus d when decoding with minimum-weight perfect matching. The repetition code points are from d = 29, 103-cycle experiments, 107 repetitions for each basis X and Z. We subsample smaller codes from the same d = 29 dataset, averaging over subsamples. Line, fit of Λ. We include data from ref. 17 for comparison. b, Example event causing elevated detection probabilities, which decay exponentially with time constant 369 ± 6 μs (grey dashed line). Three consecutive experimental shots are plotted, delimited by the vertical grey lines. The 28 measure qubits are divided into four quartiles based on the average detection probability in the grey-shaded window. Each trace represents the detection probability averaged over one quartile and a time window of ten cycles. Roughly half the measure qubits experience an appreciable rise in detection probability. The inset shows the average detection probability for each measure qubit (coloured circle) in the grey-shaded window. c, Logical error scaling with the injected error. We inject a range of coherent errors on all the qubits and plot against the observed mean detection probability pdet. Each experiment is ten cycles, and we average over 106 repetitions. Smaller code distances are again subsampled from d = 29. Lines, power-law fits εd=Adpdet^((d+1)/2) (one fit parameter, Ad), restricted to εd > 10−7 and pdet < 0.3. d, 1/Λ scaling with the injected error. Typical relative fit uncertainty is 2%. Line, fit; 2.2pdet. To obtain the data in this figure, a 72-qubit processor is used.
Fig. 3 High-distance error scaling in repetition codes. a, εd versus d when decoding with minimum-weight perfect matching. The repetition code points are from d = 29, 103-cycle experiments, 107 repetitions for each basis X and Z. We subsample smaller codes from the same d = 29 dataset, averaging over subsamples. Line, fit of Λ. We include data from ref. 17 for comparison. b, Example event causing elevated detection probabilities, which decay exponentially with time constant 369 ± 6 μs (grey dashed line). Three consecutive experimental shots are plotted, delimited by the vertical grey lines. The 28 measure qubits are divided into four quartiles based on the average detection probability in the grey-shaded window. Each trace represents the detection probability averaged over one quartile and a time window of ten cycles. Roughly half the measure qubits experience an appreciable rise in detection probability. The inset shows the average detection probability for each measure qubit (coloured circle) in the grey-shaded window. c, Logical error scaling with the injected error. We inject a range of coherent errors on all the qubits and plot against the observed mean detection probability pdet. Each experiment is ten cycles, and we average over 106 repetitions. Smaller code distances are again subsampled from d = 29. Lines, power-law fits εd=Adpdet^((d+1)/2) (one fit parameter, Ad), restricted to εd > 10−7 and pdet < 0.3. d, 1/Λ scaling with the injected error. Typical relative fit uncertainty is 2%. Line, fit; 2.2pdet. To obtain the data in this figure, a 72-qubit processor is used.CC BY-NC-ND · PubMed Central
Fig. 4 Real-time decoding. a, Schematic of the streaming decoding algorithm. The decoding problems are subdivided into blocks, with different threads responsible for different blocks. b, Task graph for processing blocks. Detections are enabled to match to the block boundaries, which will then be processed downstream during a fuse step. If a configuration of detection events cannot be resolved by a future fuse step, the decoder heralds failure. We use ten-cycle blocks to ensure that the heralded failure rate is negligible compared with the logical failure rate. c, Decoder latency versus experiment duration. Each blue point corresponds to a latency measurement for a full shot (ten shots per duration; horizontal bar, median; blue shading, violin plot). The yellow histograms represent fine-grained latency measurements of the time between receiving data and completing decoding for each ten-cycle block in a shot. The values from these fine-grained measurements, which we refer to as subshot latencies, tend to be slightly larger than those from full-shot latency measurements as the decoder may need to wait to fuse with detection events in future cycles. Infrequently, we see brief subshot latency spikes above 1 ms (Supplementary Information). d, Accuracy comparison for the surface code with three decoders. We include the real-time decoder (RT), ensembled matching synthesis (Ens.) and the neural network decoder (NN). Uncertainty on each point is less than 4 × 10−4 (Supplementary Information). To obtain the data in this figure, a 72-qubit processor is used.
Fig. 4 Real-time decoding. a, Schematic of the streaming decoding algorithm. The decoding problems are subdivided into blocks, with different threads responsible for different blocks. b, Task graph for processing blocks. Detections are enabled to match to the block boundaries, which will then be processed downstream during a fuse step. If a configuration of detection events cannot be resolved by a future fuse step, the decoder heralds failure. We use ten-cycle blocks to ensure that the heralded failure rate is negligible compared with the logical failure rate. c, Decoder latency versus experiment duration. Each blue point corresponds to a latency measurement for a full shot (ten shots per duration; horizontal bar, median; blue shading, violin plot). The yellow histograms represent fine-grained latency measurements of the time between receiving data and completing decoding for each ten-cycle block in a shot. The values from these fine-grained measurements, which we refer to as subshot latencies, tend to be slightly larger than those from full-shot latency measurements as the decoder may need to wait to fuse with detection events in future cycles. Infrequently, we see brief subshot latency spikes above 1 ms (Supplementary Information). d, Accuracy comparison for the surface code with three decoders. We include the real-time decoder (RT), ensembled matching synthesis (Ens.) and the neural network decoder (NN). Uncertainty on each point is less than 4 × 10−4 (Supplementary Information). To obtain the data in this figure, a 72-qubit processor is used.CC BY-NC-ND · PubMed Central

Verification

Claims the paper makes

12 Valid · 5 Not valid · 1 Not checked · 45 Own results and interpretations

34 more claims · 3 with their cited sources checked

Create a free account to see all 63 claims and every source verdict.

See all claims — free account
  • Probably not a substantial claim. 5
  • It may state two separate claims as one. 20
  • Borderline: one of the tests for a substantial claim is unclear. 1
  • The quote only partly states this claim. 1

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?

Citations

Cites

Show all 68 references

Cited by

See all 778

Metadata

Authors
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., Astrakhantsev, N., Atalaya, J., Babbush, R., Bacon, D., Ballard, B., Bardin, J. C., Bausch, J., Bengtsson, A., Bilmes, A., Blackwell, S., Boixo, S., Bortoli, G., Bourassa, A., Bovaird, J., Brill, L., Broughton, M., Browne, D. A., Buchea, B., Buckley, B. B., Buell, D. A., Burger, T., Burkett, B., Bushnell, N., Cabrera, A., Campero, J., Chang, H.-S., Chen, Y., Chen, Z., Chiaro, B., Chik, D., Chou, C., Claes, J., Cleland, A. Y., Cogan, J., Collins, R., Conner, P., Courtney, W., Crook, A. L., Curtin, B., Das, S., Davies, A., De Lorenzo, L., Debroy, D. M., Demura, S., Devoret, M., Di Paolo, A., Donohoe, P., Drozdov, I., Dunsworth, A., Earle, C., Edlich, T., Eickbusch, A., Elbag, A. M., Elzouka, M., Erickson, C., Faoro, L., Farhi, E., Ferreira, V. S., Burgos, L. F., Forati, E., Fowler, A. G., Foxen, B., Ganjam, S., Garcia, G., Gasca, R., Genois, É., Giang, W., Gidney, C., Gilboa, D., Gosula, R., Dau, A. G., Graumann, D., Greene, A., Gross, J. A., Habegger, S., Hall, J., Hamilton, M. C., Hansen, M., Harrigan, M. P., Harrington, S. D., Heras, F. J. H., Heslin, S., Heu, P., Higgott, O., Hill, G., Hilton, J., Holland, G., Hong, S., Huang, H.-Y., Huff, A., Huggins, W. J., Ioffe, L. B., Isakov, S. V., Iveland, J., Jeffrey, E., Jiang, Z., Jones, C., Jordan, S., Joshi, C., Juhas, P., Kafri, D., Kang, H., Karamlou, A. H., Kechedzhi, K., Kelly, J., Khaire, T., Khattar, T., Khezri, M., Kim, S., Klimov, P. V., Klots, A. R., Kobrin, B., Kohli, P., Korotkov, A. N., Kostritsa, F., Kothari, R., Kozlovskii, B., Kreikebaum, J. M., Kurilovich, V. D., Lacroix, N., Landhuis, D., Lange-Dei, T., Langley, B. W., Laptev, P., Lau, K.-M., Le Guevel, L., Ledford, J., Lee, J., Lee, K., Lensky, Y. D., Leon, S., Lester, B. J., Li, W. Y., Li, Y., Lill, A. T., Liu, W., Livingston, W. P., Locharla, A., Lucero, E., Lundahl, D., Lunt, A., Madhuk, S., Malone, F. D., Maloney, A., Mandrà, S., Manyika, J., Martin, L. S., Martin, O., Martin, S., Maxfield, C., McClean, J. R., McEwen, M., Meeks, S., Megrant, A., Mi, X., Miao, K. C., Mieszala, A., Molavi, R., Molina, S., Montazeri, S., Morvan, A., Movassagh, R., Mruczkiewicz, W., Naaman, O., Neeley, M., Neill, C., Nersisyan, A., Neven, H., Newman, M., Ng, J. H., Nguyen, A., Nguyen, M., Ni, C.-H., Niu, M. Y., O’Brien, T. E., Oliver, W. D., Opremcak, A., Ottosson, K., Petukhov, A., Pizzuto, A., Platt, J., Potter, R., Pritchard, O., Pryadko, L. P., Quintana, C., Ramachandran, G., Reagor, M. J., Redding, J., Rhodes, D. M., Roberts, G., Rosenberg, E., Rosenfeld, E., Roushan, P., Rubin, N. C., Saei, N., Sank, D., Sankaragomathi, K., Satzinger, K. J., Schurkus, H. F., Schuster, C., Senior, A. W., Shearn, M. J., Shorter, A., Shutty, N., Shvarts, V., Singh, S., Sivak, V., Skruzny, J., Small, S., Smelyanskiy, V., Smith, W. C., Somma, R. D., Springer, S., Sterling, G., Strain, D., Suchard, J., Szasz, A., Sztein, A., Thor, D., Torres, A., Torunbalci, M. M., Vaishnav, A., Vargas, J., Vdovichev, S., Vidal, G., Villalonga, B., Heidweiller, C. V., Waltman, S., Wang, S. X., Ware, B., Weber, K., Weidel, T., White, T., Wong, K., Woo, B. W. K., Xing, C., Yao, Z. J., Yeh, P., Ying, B., Yoo, J., Yosri, N., Young, G., Zalcman, A., Zhang, Y., Zhu, N., & Zobrist, N.
Affiliations
  • Google (United States) (US)
  • University of California, Riverside (US)
Corresponding author
Neven, Hartmut
ORCID
Venue
Nature
Published
2024-12-09
Volume
638
Issue
8052
Pages
920-926
ISSN
  • 0028-0836 (ISSN-L)
  • 1476-4687
OpenAlex
W4405183524
Cited by
778
References
68
Citations by year
2026: 377 · 2025: 392 · 2024: 9
FWCI
114.48
Type
journal article
Language
en
Open access
Licence
Locations
  • Nature (publishedVersion, cc-by-nc-nd)
  • PubMed Central (publishedVersion, cc-by-nc-nd)
  • PubMed (publishedVersion)
  • Repository for Publications and Research Data (ETH Zurich) (publishedVersion, cc-by-nc-nd)
  • arXiv (Cornell University) (submittedVersion, cc-by)
  • arXiv (Cornell University) (cc-by)
  • ETH Zürich Research Collection
Funders
Curtin University of Technology
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, surface code, superconducting qubits, logical error rate, real-time decoding, repetition codes, correlated errors, quantum memory, fault-tolerant quantum computing

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 (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: Quantum error correction below the surface code threshold. https://app.cochat.ai/papers/10.1038/s41586-024-08449-y
The paper
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., Astrakhantsev, N., Atalaya, J., Babbush, R., Bacon, D., Ballard, B., Bardin, J. C., Bausch, J., Bengtsson, A., Bilmes, A., . . . Zobrist, N. (2025). Quantum error correction below the surface code threshold. Nature. https://doi.org/10.1038/s41586-024-08449-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.