English

Exponential suppression of bit or phase flip errors with repetitive error correction

Quantum Physics 2022-07-19 v1

Abstract

Realizing the potential of quantum computing will require achieving sufficiently low logical error rates. Many applications call for error rates in the 101510^{-15} regime, but state-of-the-art quantum platforms typically have physical error rates near 10310^{-3}. 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 bit or phase-flip errors, reducing logical error per round by more than 100×100\times when increasing the number of qubits from 5 to 21. Crucially, this error suppression is stable over 50 rounds of error correction. We also introduce a method for analyzing error correlations with high precision, and characterize the locality of errors in a device performing QEC for the first time. Finally, we perform error detection using a small 2D surface code logical qubit on the same device, and show that the results from both 1D and 2D codes agree with numerical simulations using a simple depolarizing error model. These findings demonstrate that superconducting qubits are on a viable path towards fault tolerant quantum computing.

Keywords

Cite

@article{arxiv.2102.06132,
  title  = {Exponential suppression of bit or phase flip errors with repetitive error correction},
  author = {Zijun Chen and Kevin J. Satzinger and Juan Atalaya and Alexander N. Korotkov and Andrew Dunsworth and Daniel Sank and Chris Quintana and Matt McEwen and Rami Barends and Paul V. Klimov and Sabrina Hong and Cody Jones and Andre Petukhov and Dvir Kafri and Sean Demura and Brian Burkett and Craig Gidney and Austin G. Fowler and Harald Putterman and Igor Aleiner and Frank Arute and Kunal Arya and Ryan Babbush and Joseph C. Bardin and Andreas Bengtsson and Alexandre Bourassa and Michael Broughton and Bob B. Buckley and David A. Buell and Nicholas Bushnell and Benjamin Chiaro and Roberto Collins and William Courtney and Alan R. Derk and Daniel Eppens and Catherine Erickson and Edward Farhi and Brooks Foxen and Marissa Giustina and Jonathan A. Gross and Matthew P. Harrigan and Sean D. Harrington and Jeremy Hilton and Alan Ho and Trent Huang and William J. Huggins and L. B. Ioffe and Sergei V. Isakov and Evan Jeffrey and Zhang Jiang and Kostyantyn Kechedzhi and Seon Kim and Fedor Kostritsa and David Landhuis and Pavel Laptev and Erik Lucero and Orion Martin and Jarrod R. McClean and Trevor McCourt and Xiao Mi and Kevin C. Miao and Masoud Mohseni and Wojciech Mruczkiewicz and Josh Mutus and Ofer Naaman and Matthew Neeley and Charles Neill and Michael Newman and Murphy Yuezhen Niu and Thomas E. O'Brien and Alex Opremcak and Eric Ostby and Bálint Pató and Nicholas Redd and Pedram Roushan and Nicholas C. Rubin and Vladimir Shvarts and Doug Strain and Marco Szalay and Matthew D. Trevithick and Benjamin Villalonga and Theodore White and Z. Jamie Yao and Ping Yeh and Adam Zalcman and Hartmut Neven and Sergio Boixo and Vadim Smelyanskiy and Yu Chen and Anthony Megrant and Julian Kelly},
  journal= {arXiv preprint arXiv:2102.06132},
  year   = {2022}
}
R2 v1 2026-06-23T23:04:38.577Z