Suppressing quantum errors by scaling a surface code logical qubit
Google Quantum AI, Rajeev Acharya, I. L. Aleǐner et al. · Nature · 2023
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.
Cited by 1,083 works. doi:10.1038/s41586-022-05434-1 Open-access PDF
Authors
- Rajeev Acharya
- I. L. Aleǐner
- R. M. Allen
- Trond I. Andersen
- M. Ansmann
- Frank Arute
- Kunal Arya
- Abraham T. Asfaw
- Juan Atalaya
- Ryan Babbush
- Dave Bacon
- Joseph C. Bardin
- Joao Basso
- Andreas Bengtsson
- Sergio Boixo
- Gina Bortoli
- Alexandre Bourassa
- Jenna Bovaird
References
- Scheme for reducing decoherence in quantum computer memory
- Simulating physics with computers
- Fault-tolerant quantum computation by anyons
- Universal Quantum Simulators
- Quantum supremacy using a programmable superconducting processor
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum machine learning
- Charge-insensitive qubit design derived from the Cooper pair box
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Surface codes: Towards practical large-scale quantum computation