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

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

Scaling and logic in the colour code on a superconducting quantum processor

Open access
Lacroix, N., Bourassa, A., Heras, F. J. H., Zhang, L. M., Bausch, J., Senior, A. W., Edlich, T., Shutty, N., Sivak, V., Bengtsson, A., McEwen, M., Higgott, O., Kafri, D., Claes, J., Morvan, A., Chen, Z., Zalcman, A., Madhuk, S., Acharya, R., Aghababaie Beni, L., Aigeldinger, G., Alcaraz, R., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., Atalaya, J., Babbush, R., Ballard, B., Bardin, J. C., Bilmes, A., Blackwell, S., Bovaird, J., Bowers, D., Brill, L., Broughton, M., Browne, D. A., Buchea, B., Buckley, B. B., Burger, T., Burkett, B., Bushnell, N., Cabrera, A., Campero, J., Chang, H.-S., Chiaro, B., Chih, L.-Y., Cleland, A. Y., Cogan, J., Collins, R., Conner, P., Courtney, W., Crook, A. L., Curtin, B., Das, S., Demura, S., De Lorenzo, L., Di Paolo, A., Donohoe, P., Drozdov, I., Dunsworth, A., Eickbusch, A., Elbag, A. Moshe, Elzouka, M., Erickson, C., Ferreira, V. S., Flores Burgos, L., Forati, E., Fowler, A. G., Foxen, B., Ganjam, S., Garcia, G., Gasca, R., Genois, É., Giang, W., Gilboa, D., Gosula, R., Grajales Dau, A., Graumann, D., Greene, A., Gross, J. A., Ha, T., Habegger, S., Hansen, M., Harrigan, M. P., Harrington, S. D., Heslin, S., Heu, P., Hiltermann, R., Hilton, J., Hong, S., Huang, H.-Y., Huff, A., Huggins, W. J., Jeffrey, E., Jiang, Z., Jin, X., Joshi, C., Juhas, P., Kabel, A., Kang, H., Karamlou, A. H., Kechedzhi, K., Khaire, T., Khattar, T., Khezri, M., Kim, S., Klimov, P. V., Kobrin, B., Korotkov, A. N., Kostritsa, F., Kreikebaum, J. Mark, Kurilovich, V. D., Landhuis, D., Lange-Dei, T., Langley, B. W., Laptev, P., Lau, K.-M., Ledford, J., Lee, K., Lester, B. J., Le Guevel, L., Li, W. Yan, Li, Y., Lill, A. T., Livingston, W. P., Locharla, A., Lucero, E., Lundahl, D., Lunt, A., Maloney, A., Mandrà, S., Martin, L. S., Martin, O., Maxfield, C., McClean, J. R., Meeks, S., Megrant, A., Miao, K. C., Molavi, R., Molina, S., Montazeri, S., Movassagh, R., Neill, C., Newman, M., Nguyen, A., Nguyen, M., Ni, C.-H., Niu, M. Y., Oas, L., Oliver, W. D., Orosco, R., Ottosson, K., Pizzuto, A., Potter, R., Pritchard, O., Quintana, C., Ramachandran, G., Reagor, M. J., Resnick, R., Rhodes, D. M., Roberts, G., Rosenberg, E., Rosenfeld, E., Rossi, E., Roushan, P., Sankaragomathi, K., Schurkus, H. F., Shearn, M. J., Shorter, A., Shvarts, V., Small, S., Smith, W. Clarke, Springer, S., Sterling, G., Suchard, J., Szasz, A., Sztein, A., Thor, D., Tomita, E., Torres, A., Torunbalci, M. Mert, Vaishnav, A., Vargas, J., Vdovichev, S., Vidal, G., Vollgraff Heidweiller, C., Waltman, S., Waltz, J., Wang, S. X., Ware, B., Weidel, T., White, T., Wong, K., Woo, B. W. K., Woodson, M., Xing, C., Yao, Z. Jamie, Yeh, P., Ying, B., Yoo, J., Yosri, N., Young, G., Zhang, Y., Zhu, N., Zobrist, N., Neven, H., Kohli, P., Davies, A., Boixo, S., Kelly, J., Jones, C., Gidney, C., Satzinger, K. J. · 2025 · Nature

Abstract

Quantum error correction [1–4] is essential for bridging the gap between the error rates of physical devices and the extremely low error rates required for quantum algorithms. Recent error-correction demonstrations on superconducting processors [5–8] have focused primarily on the surface code [9], which offers a high error threshold but poses limitations for logical operations. The color code [10] enables more efficient logic, but it requires more complex stabilizer measurements and decoding. Measuring these stabilizers in planar architectures like superconducting qubits is challenging, and realizations of color codes [11–19] have not addressed performance scaling with code size on any platform. Here, we present a comprehensive demonstration of the color code on a superconducting processor [8]. Scaling the code distance from three to five suppresses logical errors by a factor of Λ 3/5 = 1.56(4). Simulations indicate this performance is below the threshold of the color code, and the color code may become more efficient than the surface code following modest device improvements. We test transversal Clifford gates with logical randomized benchmarking [20] and inject magic states [21], a key resource for universal computation, achieving fidelities exceeding 99 % with post-selection. Finally, we teleport logical states between color codes using lattice surgery [22]. This work establishes the color code as a compelling research direction to realize fault-tolerant quantum computation on superconducting processors in the near future.

Overview

CoChat Summary

## TL;DR

The paper reports a superconducting-processor demonstration of the colour code, showing logical error suppression when scaling from distance 3 to 5 and implementing several fault-tolerant building blocks. It also characterizes transversal Clifford gates, high-fidelity magic state injection, and logical-state teleportation with lattice surgery.

## Key findings

  • Scaling the colour code from distance 3 to 5 suppresses logical errors by a factor of Λ3/5 = 1.56(4); with the neural-network decoder the authors report ε5 = 0.0110(2).
  • For distance-5 memory experiments, the average error-detection probability was Pd,6 = 0.149 for weight-6 stabilizers versus Pd,4 = 0.112 for boundary weight-4 stabilizers.
  • Logical randomized benchmarking on a distance-3 code gives an average logical Clifford gate error of εC = 0.0027(3).
  • Magic state injection achieves average infidelity 0.039(3) with the Möbius decoder and 0.009(4) with post-selection (retaining 74.8% of runs); for specific magic states, post-selection infidelities are reported with retained data fractions of 75.2%, 74.6%, and 75.7%.
  • Lattice-surgery teleportation of four logical input states yields decoded fidelities between 86.5(1)% and 90.7(1)%.

## Methods

  • Experimental demonstration on the 72-qubit Willow superconducting processor using a hexagonal colour-code layout embedded in a square grid, with 19 data qubits and 18 auxiliary qubits for the distance-5 logical qubit.
  • Distance-scaling experiments: initialize logical states in the X and Z bases, run up to n = 29 error-correction cycles, measure final data qubits, and fit logical-error probabilities to extract per-cycle logical error and suppression factor.
  • Analysis uses new decoding strategies, including a neural-network decoder (AlphaQubit) and the Möbius decoder (Chromobius), plus logical randomized benchmarking, magic-state tomography, and lattice-surgery-based teleportation protocols.

## Limitations

  • The paper states that the observed performance is below the colour-code threshold; simulations suggest the colour code may only become more qubit-efficient than the surface code after modest device improvements or about a factor of four improvement in physical error rates.
  • The text notes that the magic-state injection protocol is not fault-tolerant against an error on the injection data qubit, because it starts from a single physical qubit; this is an inherent protocol limitation stated in the paper.
  • Evident from the text: the work demonstrates key building blocks, but does not present full large-scale fault-tolerant quantum computation; several results are limited to distance-3 or distance-5 codes and to post-selected state-injection performance.

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

Integrity signals

Registry

Crossref · 10.1038/s41586-025-09061-4

Cites

67 of 67 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Figures

Fig. 1 Superdense colour code. a, Example tile in the bulk of a red, green and blue hexagonal lattice used for the superdense colour code. The lattice is embedded on a square grid of data qubits (golden circles labelled D1–D6) and X/Z auxiliary qubits (red, green and blue circles), with their connectivity indicated by solid grey lines. b, Superdense syndrome extraction circuit for the tile shown in a (see the main text). c, Distance-5 colour code qubit, with one of the distance-3 qubit subsets outlined in purple. Data qubits included in the logical operators XL and ZL are circled and connected by a solid black line. Red arrows indicate qubit pairs interchanged for the implementation of the colour code on our quantum device. d, Deformed code layout after interchanging the qubits to ensure that each readout line contains only data or auxiliary qubits. The readout lines are oriented diagonally from top left to bottom right (two dashed grey lines).
Fig. 1 Superdense colour code. a, Example tile in the bulk of a red, green and blue hexagonal lattice used for the superdense colour code. The lattice is embedded on a square grid of data qubits (golden circles labelled D1–D6) and X/Z auxiliary qubits (red, green and blue circles), with their connectivity indicated by solid grey lines. b, Superdense syndrome extraction circuit for the tile shown in a (see the main text). c, Distance-5 colour code qubit, with one of the distance-3 qubit subsets outlined in purple. Data qubits included in the logical operators XL and ZL are circled and connected by a solid black line. Red arrows indicate qubit pairs interchanged for the implementation of the colour code on our quantum device. d, Deformed code layout after interchanging the qubits to ensure that each readout line contains only data or auxiliary qubits. The readout lines are oriented diagonally from top left to bottom right (two dashed grey lines).CC BY-NC-ND · PubMed Central
Fig. 2 Distance scaling experiment. a, Detection probability Pd as a function of QEC cycle n for individual stabilizers (faded lines) and their average (solid line) for an X-basis state-preservation experiment in a distance-5 colour code. Weight-6 stabilizers are coloured in red and weight-4 stabilizers are coloured in gold. b, Detection probability for each tile of the distance-5 colour code, averaged over cycles and bases. c, Measured logical error PL for distance-3 (green triangles) and distance-5 (blue pentagons) codes averaged over the X and Z bases. Faded symbols correspond to individual distance-3 subsets. The solid lines, shown for the averaged distance-3 code and the distance-5 code, are fits to PL=ε0×(1−2×εd)ⁿ+1/2, with fitting parameters ε0 and εd. d, Logical error per cycle, εd, compared with code distance, d. Same symbols as in c. e, Relative contributions of different error sources to the error budget for the colour code: CZ errors (CZ); errors from spurious interactions during two-qubit gates (CZ stray int.); leakage errors during two-qubit gates (CZ leakage); measurement errors (Meas.); single-qubit gate error (1Q); data-qubit idle error during measurement and reset of auxiliary qubits (Data idle); reset error (Reset); leakage due to incoherent heating from |1⟩ to |2⟩ (Heating). The relative contributions of the different error channels are indicated.
Fig. 2 Distance scaling experiment. a, Detection probability Pd as a function of QEC cycle n for individual stabilizers (faded lines) and their average (solid line) for an X-basis state-preservation experiment in a distance-5 colour code. Weight-6 stabilizers are coloured in red and weight-4 stabilizers are coloured in gold. b, Detection probability for each tile of the distance-5 colour code, averaged over cycles and bases. c, Measured logical error PL for distance-3 (green triangles) and distance-5 (blue pentagons) codes averaged over the X and Z bases. Faded symbols correspond to individual distance-3 subsets. The solid lines, shown for the averaged distance-3 code and the distance-5 code, are fits to PL=ε0×(1−2×εd)ⁿ+1/2, with fitting parameters ε0 and εd. d, Logical error per cycle, εd, compared with code distance, d. Same symbols as in c. e, Relative contributions of different error sources to the error budget for the colour code: CZ errors (CZ); errors from spurious interactions during two-qubit gates (CZ stray int.); leakage errors during two-qubit gates (CZ leakage); measurement errors (Meas.); single-qubit gate error (1Q); data-qubit idle error during measurement and reset of auxiliary qubits (Data idle); reset error (Reset); leakage due to incoherent heating from |1⟩ to |2⟩ (Heating). The relative contributions of the different error channels are indicated.CC BY-NC-ND · PubMed Central
Fig. 3 Logical randomized benchmarking. a, Logical-qubit-level reference (Ref.; green) and interleaved randomized benchmarking (IRB; blue) circuit diagrams, consisting of error correction cycles (QEC), randomly selected Clifford gates (C1, …, Cm), a Clifford recovery gate C−1 and a Z basis measurement (MZ). b–d, Simplified circuit diagrams for a tile of the colour code indicating measurements included in an X-stabilizer error-detecting region spanning across two consecutive cycles without logical gate (b), and how it changes on the application of a logical Hadamard gate H (c), or a logical phase gate S (d) between two error correction cycles, see text for details. The green, blue and purple highlighted sections correspond to regions in which the detecting region is sensitive to Z, X and both X and Z errors, respectively. A CNOT gate symbol spanning three qubit wires indicates three consecutive CNOTs between the auxiliary qubit and its neighbouring data qubits. e, Measured fidelity (symbols) and exponential fits (solid lines) for the interleaved (blue) and reference (green) sequences compared with the number of logical Clifford gates m. The data are decoded using the neural-network decoder. Error bars represent the standard deviation of fidelity over 25 random Clifford sequences, each repeated 20,000 times.
Fig. 3 Logical randomized benchmarking. a, Logical-qubit-level reference (Ref.; green) and interleaved randomized benchmarking (IRB; blue) circuit diagrams, consisting of error correction cycles (QEC), randomly selected Clifford gates (C1, …, Cm), a Clifford recovery gate C−1 and a Z basis measurement (MZ). b–d, Simplified circuit diagrams for a tile of the colour code indicating measurements included in an X-stabilizer error-detecting region spanning across two consecutive cycles without logical gate (b), and how it changes on the application of a logical Hadamard gate H (c), or a logical phase gate S (d) between two error correction cycles, see text for details. The green, blue and purple highlighted sections correspond to regions in which the detecting region is sensitive to Z, X and both X and Z errors, respectively. A CNOT gate symbol spanning three qubit wires indicates three consecutive CNOTs between the auxiliary qubit and its neighbouring data qubits. e, Measured fidelity (symbols) and exponential fits (solid lines) for the interleaved (blue) and reference (green) sequences compared with the number of logical Clifford gates m. The data are decoded using the neural-network decoder. Error bars represent the standard deviation of fidelity over 25 random Clifford sequences, each repeated 20,000 times.CC BY-NC-ND · PubMed Central
Fig. 4 Arbitrary state injection in a distance-3 colour code. a, Schematic of a distance-3 colour code. The arbitrary state |ψ⟩ is prepared on the data qubit indicated by a black arrow. The black line indicates the logical operators of the colour code, and the purple ellipses indicate Bell pairs, see the main text. b, Simplified circuit diagram for the state injection. Each line corresponds to one of the data qubits, on which we apply single-qubit Y- and Z-rotations (yellow boxes), Bell pair preparation circuits (purple boxes), a QEC cycle and a measurement in the X, Y or Z basis (MXYZ) for logical state tomography. c, Decoded (semi-transparent circles) and post-selected (solid dots) expectation value of the logical Pauli operators XL (blue), YL (red) and ZL (green) when sweeping the polar angle θ. The solid lines correspond to ideal expectation values. d, Decoded (semi-transparent circles) and post-selected (solid dots) infidelities for the prepared logical state |ψL⟩. e, Magic state |mL⟩ infidelity as a function of rejected data fraction for |AL⟩ (green squares), |HL⟩ (blue diamonds) and |TL⟩ (red triangles), see the main text and Supplementary Information section G. The dashed lines serve as a guide to the eye, and the error bars indicate a 95% bootstrapped confidence interval. Each state is shown on the Bloch sphere by an arrow of the corresponding colour.
Fig. 4 Arbitrary state injection in a distance-3 colour code. a, Schematic of a distance-3 colour code. The arbitrary state |ψ⟩ is prepared on the data qubit indicated by a black arrow. The black line indicates the logical operators of the colour code, and the purple ellipses indicate Bell pairs, see the main text. b, Simplified circuit diagram for the state injection. Each line corresponds to one of the data qubits, on which we apply single-qubit Y- and Z-rotations (yellow boxes), Bell pair preparation circuits (purple boxes), a QEC cycle and a measurement in the X, Y or Z basis (MXYZ) for logical state tomography. c, Decoded (semi-transparent circles) and post-selected (solid dots) expectation value of the logical Pauli operators XL (blue), YL (red) and ZL (green) when sweeping the polar angle θ. The solid lines correspond to ideal expectation values. d, Decoded (semi-transparent circles) and post-selected (solid dots) infidelities for the prepared logical state |ψL⟩. e, Magic state |mL⟩ infidelity as a function of rejected data fraction for |AL⟩ (green squares), |HL⟩ (blue diamonds) and |TL⟩ (red triangles), see the main text and Supplementary Information section G. The dashed lines serve as a guide to the eye, and the error bars indicate a 95% bootstrapped confidence interval. Each state is shown on the Bloch sphere by an arrow of the corresponding colour.CC BY-NC-ND · PubMed Central
Fig. 5 State teleportation in the colour code using lattice surgery. a, Simplified circuit diagram to teleport a state |ψL⟩ from logical qubit L1 to a logical qubit L2 using an XX-parity measurement (MXX) realized by lattice surgery, and Pauli frame updates conditioned on the measurement outcomes m1 and m2 performed in post-processing (dashed boxes). b, Space-time block diagram showing the MXX lattice surgery operation, with horizontal cuts displaying the evolution of the stabilizers as a function of the QEC cycles, as detailed in c–e. c–e, Representation of the active qubits (coloured) and stabilizers before (c) and after (d) the merge operation, and after the split operation (e). The hatched tiles indicate stabilizers in the X basis only, whereas filled tiles indicate both X and Z stabilizers with support on its vertices. The black line indicates the teleported logical operator from L1 to L2, after the Pauli frame update. f–i, Measured (colour), simulated (black wireframe) and ideal (dotted grey wireframe) expectation values of the Pauli logical operators of L2 after teleporting state |0L⟩, |1L⟩, |+L⟩ and |−L⟩, respectively. j, Measured (gold bars) and simulated (black wireframe) teleported state fidelity F of the four logical X and Z eigenstates.
Fig. 5 State teleportation in the colour code using lattice surgery. a, Simplified circuit diagram to teleport a state |ψL⟩ from logical qubit L1 to a logical qubit L2 using an XX-parity measurement (MXX) realized by lattice surgery, and Pauli frame updates conditioned on the measurement outcomes m1 and m2 performed in post-processing (dashed boxes). b, Space-time block diagram showing the MXX lattice surgery operation, with horizontal cuts displaying the evolution of the stabilizers as a function of the QEC cycles, as detailed in c–e. c–e, Representation of the active qubits (coloured) and stabilizers before (c) and after (d) the merge operation, and after the split operation (e). The hatched tiles indicate stabilizers in the X basis only, whereas filled tiles indicate both X and Z stabilizers with support on its vertices. The black line indicates the teleported logical operator from L1 to L2, after the Pauli frame update. f–i, Measured (colour), simulated (black wireframe) and ideal (dotted grey wireframe) expectation values of the Pauli logical operators of L2 after teleporting state |0L⟩, |1L⟩, |+L⟩ and |−L⟩, respectively. j, Measured (gold bars) and simulated (black wireframe) teleported state fidelity F of the four logical X and Z eigenstates.CC BY-NC-ND · PubMed Central

Verification

Claims the paper makes

17 Valid · 2 Not valid · 1 Not checked · 18 Own results and interpretations

22 more claims · 6 with their cited sources checked

Create a free account to see all 38 claims and to verify the 7 references still open.

See all claims — free account
  • Probably not a substantial claim. 7
  • It may state two separate claims as one. 7
  • 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 58 references

Research works printed but not linked: 1

  1. Gottesman, D. Stabilizer Codes and Quantum Error Correction. PhD thesis (California Institute of Technology, 1997).

Cited by

See all 52

Metadata

Authors
Lacroix, N., Bourassa, A., Heras, F. J. H., Zhang, L. M., Bausch, J., Senior, A. W., Edlich, T., Shutty, N., Sivak, V., Bengtsson, A., McEwen, M., Higgott, O., Kafri, D., Claes, J., Morvan, A., Chen, Z., Zalcman, A., Madhuk, S., Acharya, R., Aghababaie Beni, L., Aigeldinger, G., Alcaraz, R., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., Atalaya, J., Babbush, R., Ballard, B., Bardin, J. C., Bilmes, A., Blackwell, S., Bovaird, J., Bowers, D., Brill, L., Broughton, M., Browne, D. A., Buchea, B., Buckley, B. B., Burger, T., Burkett, B., Bushnell, N., Cabrera, A., Campero, J., Chang, H.-S., Chiaro, B., Chih, L.-Y., Cleland, A. Y., Cogan, J., Collins, R., Conner, P., Courtney, W., Crook, A. L., Curtin, B., Das, S., Demura, S., De Lorenzo, L., Di Paolo, A., Donohoe, P., Drozdov, I., Dunsworth, A., Eickbusch, A., Elbag, A. M., Elzouka, M., Erickson, C., Ferreira, V. S., Flores Burgos, L., Forati, E., Fowler, A. G., Foxen, B., Ganjam, S., Garcia, G., Gasca, R., Genois, É., Giang, W., Gilboa, D., Gosula, R., Grajales Dau, A., Graumann, D., Greene, A., Gross, J. A., Ha, T., Habegger, S., Hansen, M., Harrigan, M. P., Harrington, S. D., Heslin, S., Heu, P., Hiltermann, R., Hilton, J., Hong, S., Huang, H.-Y., Huff, A., Huggins, W. J., Jeffrey, E., Jiang, Z., Jin, X., Joshi, C., Juhas, P., Kabel, A., Kang, H., Karamlou, A. H., Kechedzhi, K., Khaire, T., Khattar, T., Khezri, M., Kim, S., Klimov, P. V., Kobrin, B., Korotkov, A. N., Kostritsa, F., Kreikebaum, J. M., Kurilovich, V. D., Landhuis, D., Lange-Dei, T., Langley, B. W., Laptev, P., Lau, K.-M., Ledford, J., Lee, K., Lester, B. J., Le Guevel, L., Li, W. Y., Li, Y., Lill, A. T., Livingston, W. P., Locharla, A., Lucero, E., Lundahl, D., Lunt, A., Maloney, A., Mandrà, S., Martin, L. S., Martin, O., Maxfield, C., McClean, J. R., Meeks, S., Megrant, A., Miao, K. C., Molavi, R., Molina, S., Montazeri, S., Movassagh, R., Neill, C., Newman, M., Nguyen, A., Nguyen, M., Ni, C.-H., Niu, M. Y., Oas, L., Oliver, W. D., Orosco, R., Ottosson, K., Pizzuto, A., Potter, R., Pritchard, O., Quintana, C., Ramachandran, G., Reagor, M. J., Resnick, R., Rhodes, D. M., Roberts, G., Rosenberg, E., Rosenfeld, E., Rossi, E., Roushan, P., Sankaragomathi, K., Schurkus, H. F., Shearn, M. J., Shorter, A., Shvarts, V., Small, S., Smith, W. C., Springer, S., Sterling, G., Suchard, J., Szasz, A., Sztein, A., Thor, D., Tomita, E., Torres, A., Torunbalci, M. M., Vaishnav, A., Vargas, J., Vdovichev, S., Vidal, G., Vollgraff Heidweiller, C., Waltman, S., Waltz, J., Wang, S. X., Ware, B., Weidel, T., White, T., Wong, K., Woo, B. W. K., Woodson, M., Xing, C., Yao, Z. J., Yeh, P., Ying, B., Yoo, J., Yosri, N., Young, G., Zhang, Y., Zhu, N., Zobrist, N., Neven, H., Kohli, P., Davies, A., Boixo, S., Kelly, J., Jones, C., Gidney, C., & Satzinger, K. J.
Affiliations
  • Google (United States) (US)
  • Google DeepMind (United Kingdom) (GB)
Corresponding author
  • Lacroix, N.
  • Bourassa, A.
  • Satzinger, K. J.
Venue
Nature
Published
2025-05-26
Volume
645
Issue
8081
Pages
614-619
ISSN
  • 0028-0836 (ISSN-L)
  • 1476-4687
OpenAlex
W4410741913
Cited by
51
References
58
Citations by year
2026: 34 · 2025: 17
FWCI
20.30
Type
journal article
Language
en
Open access
Licence
Locations
  • Nature (publishedVersion, cc-by-nc-nd)
  • Europe PMC (PubMed Central) (publishedVersion, cc-by-nc-nd)
  • PubMed (publishedVersion)
  • PubMed Central (publishedVersion, cc-by-nc-nd)
  • 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
DeepMind
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
color codes, quantum error correction, superconducting qubits, magic state distillation, lattice surgery, 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-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-10-10 (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: Scaling and logic in the colour code on a superconducting quantum processor. https://app.cochat.ai/papers/10.1038/s41586-025-09061-4
The paper
Lacroix, N., Bourassa, A., Heras, F. J. H., Zhang, L. M., Bausch, J., Senior, A. W., Edlich, T., Shutty, N., Sivak, V., Bengtsson, A., McEwen, M., Higgott, O., Kafri, D., Claes, J., Morvan, A., Chen, Z., Zalcman, A., Madhuk, S., Acharya, R., . . . Satzinger, K. J. (2025). Scaling and logic in the colour code on a superconducting quantum processor. Nature. https://doi.org/10.1038/s41586-025-09061-4

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.