Exponential suppression of bit or phase flip errors with repetitive error correction
Zijun Chen, Kevin J. Satzinger, Juan Atalaya, Alexander N. Korotkov,, Andrew Dunsworth, Daniel Sank, Chris Quintana, Matt McEwen, Rami Barends,, Paul V. Klimov, Sabrina Hong, Cody Jones, Andre Petukhov, Dvir Kafri, Sean, Demura, Brian Burkett, Craig Gidney, Austin G. Fowler

TL;DR
This paper demonstrates exponential suppression of logical errors in superconducting qubits using 1D repetition codes embedded in a 2D grid, achieving over 100-fold error reduction and stable performance over 50 rounds, advancing fault-tolerant quantum computing.
Contribution
It introduces a scalable method for error suppression in superconducting qubits and analyzes error correlations and locality, supporting the viability of fault-tolerant quantum computing.
Findings
Logical error per round reduced by over 100x with more qubits
Error suppression remains stable over 50 rounds
Error correlations characterized and match simple models
Abstract
Realizing the potential of quantum computing will require achieving sufficiently low logical error rates. Many applications call for error rates in the regime, but state-of-the-art quantum platforms typically have physical error rates near . Quantum error correction (QEC) promises to bridge this divide by distributing quantum logical information across many physical qubits so that errors can be detected and corrected. Logical errors are then exponentially suppressed as the number of physical qubits grows, provided that the physical error rates are below a certain threshold. QEC also requires that the errors are local and that performance is maintained over many rounds of error correction, two major outstanding experimental challenges. Here, we implement 1D repetition codes embedded in a 2D grid of superconducting qubits which demonstrate exponential suppression of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
