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

ORAL  · Invited

Abstract

Quantum error correction<span style="font-size:10.8333px"> 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 have focused primarily on the surface code, which offers a high error threshold but poses limitations for logical operations. The color code<span style="font-size:10.8333px"> enables more efficient logic, but it requires more complex stabilizer measurements and decoding. Measuring these stabilizers in planar architectures such as superconducting qubits is challenging, and realizations of color codes 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. 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 and inject magic states, a key resource for universal computation, achieving fidelities exceeding 99% with post-selection. Finally, we teleport logical states between colour codes using lattice surgery. This work establishes the colour code as a compelling research direction to realize fault-tolerant quantum computation on superconducting processors in the near future.

Publication: Lacroix, N., Bourassa, A., et al. Scaling and logic in the colour code on a superconducting quantum processor. Nature 645, 614–619 (2025). https://doi.org/10.1038/s41586-025-09061-4

Presenters

  • Nathan Lacroix

    • Google Quantum AI
    • ETH Zurich

Authors

  • Nathan Lacroix

    • Google Quantum AI
    • ETH Zurich