Journal article
2024
APA
Click to copy
Acharya, R., Aghababaie-Beni, L., Aleiner, I., Andersen, T. I., Ansmann, M., Arute, F., … Zobrist, N. (2024). Quantum error correction below the surface code threshold.
Chicago/Turabian
Click to copy
Acharya, R., Laleh Aghababaie-Beni, Igor Aleiner, Trond I. Andersen, M. Ansmann, F. Arute, K. Arya, et al. “Quantum Error Correction below the Surface Code Threshold” (2024).
MLA
Click to copy
Acharya, R., et al. Quantum Error Correction below the Surface Code Threshold. 2024.
BibTeX Click to copy
@article{r2024a,
title = {Quantum error correction below the surface code threshold},
year = {2024},
author = {Acharya, R. and Aghababaie-Beni, Laleh and Aleiner, Igor and Andersen, Trond I. and Ansmann, M. and Arute, F. and Arya, K. and Asfaw, A. and Astrakhantsev, N. and Atalaya, J. and Babbush, Ryan and Bacon, Dave and Ballard, Brian and Bardin, Joseph C. and Bausch, Johannes and Bengtsson, A. and Bilmes, A. and Blackwell, Sam and Boixo, S. and Bortoli, G. and Bourassa, A. and Bovaird, J. and Brill, L. and Broughton, M. and Browne, David A. and Buchea, Brett and Buckley, B. and Buell, D. and Burger, T. and Burkett, B. and Bushnell, N. and Cabrera, Anthony and Campero, J. and Chang, Hung-Shen and Chen, Yu and Chen, Zijun and Chiaro, B. and Chik, Desmond and Chou, Charina and Claes, Jahan and Cleland, A. and Cogan, J. and Collins, R. and Conner, P. and Courtney, W. and Crook, A. and Curtin, Ben and Das, Sayan and Davies, Alex and Lorenzo, Laura De and Debroy, D. and Demura, S. and Devoret, M. and Paolo, A. D. and Donohoe, Paul and Drozdov, I. and Dunsworth, A. and Earle, Clint and Edlich, Thomas and Eickbusch, A. and Elbag, Aviv Moshe and Elzouka, M. and Erickson, C. and Faoro, L. and Farhi, E. and Ferreira, Vinicius S. and Burgos, L. F. and Forati, E. and Fowler, A. and Foxen, B. and Ganjam, S. and Garcia, Gonzalo and Gasca, Robert and Genois, 'Elie and Giang, W. and Gidney, C. and Gilboa, D. and Gosula, R. and Dau, A. and Graumann, Dietrich and Greene, Alex and Gross, Jonathan A. and Habegger, S. and Hall, John and Hamilton, Michael C. and Hansen, Monica and Harrigan, M. and Harrington, S. D. and Heras, Francisco J. H. and Heslin, Stephen and Heu, P. and Higgott, Oscar and Hill, Gordon and Hilton, J. and Holland, George and Hong, Sabrina and Huang, Hsin-Yuan and Huff, A. and Huggins, W. and Ioffe, L. and Isakov, S. and Iveland, J. and Jeffrey, E. and Jiang, Zhang and Jones, Cody and Jordan, Stephen P. and Joshi, Chaitali and Juhás, P. and Kafri, D. and Kang, Hui and Karamlou, Amir H. and Kechedzhi, K. and Kelly, J. and Khaire, T. and Khattar, T. and Khezri, M. and Kim, Seon and Klimov, P. and Klots, A. and Kobrin, B. and Kohli, Pushmeet and Korotkov, Alexander N. and Kostritsa, F. and Kothari, Robin and Kozlovskii, Borislav M. and Kreikebaum, J. and Kurilovich, V. D. and Lacroix, N. and Landhuis, D. and Lange-Dei, Tiano and Langley, Brandon W. and Laptev, P. and Lau, K. and Guevel, L. L. and Ledford, Justin and Lee, Kenny and Lensky, Y. and Leon, Shannon and Lester, B. and Li, Wing Yan and Li, Yin and Lill, A. and Liu, Wayne and Livingston, W. and Locharla, A. and Lucero, E. and Lundahl, Daniel and Lunt, Aaron and Madhuk, Sid and Malone, F. and Maloney, Ashley and Mandr'a, Salvatore and Martin, Leigh S. and Martin, Steven and Martin, O. and Maxfield, Cameron and McClean, J. and McEwen, M. and Meeks, Seneca and Megrant, A. and Mi, X. and Miao, K. and Mieszala, A. and Molavi, Reza and Molina, Sebastian and Montazeri, S. and Morvan, A. and Movassagh, R. and Mruczkiewicz, W. and Naaman, O. and Neeley, Matthew B. and Neill, C. and Nersisyan, A. and Neven, H. and Newman, Michael and Ng, J. and Nguyen, A. and Nguyen, M. and Ni, Chia-Hung and O’Brien, T. and Oliver, William D. and Opremcak, A. and Ottosson, K. and Petukhov, A. and Pizzuto, A. and Platt, John C. and Potter, R. and Pritchard, Orion and Pryadko, Leonid P. and Quintana, C. and Ramachandran, Ganesh and Reagor, M. and Rhodes, D. M. and Roberts, Gabrielle and Rosenberg, Eliot and Rosenfeld, Emma and Roushan, P. and Rubin, N. and Saei, N. and Sank, D. and Sankaragomathi, K. and Satzinger, K. and Schurkus, H. and Schuster, C. and Senior, Andrew W. and Shearn, M. and Shorter, A. and Shutty, N. and Shvarts, V. and Singh, Shraddha and Sivak, V. and Skruzny, J. and Small, Spencer and Smelyanskiy, V. and Smith, W. C. and Somma, Rolando D. and Springer, Sofia and Sterling, G. and Strain, D. and Suchard, Jordan and Szasz, Aaron and Sztein, A. and Thor, D. and Torres, A. and Torunbalci, M. M. and Vaishnav, Abeer and Vargas, Justin and Vdovichev, S. and Vidal, G. and Villalonga, B. and Heidweiller, C. V. and Waltman, Steven and Wang, Shannon X. and Ware, Brayden and Weber, Kate and White, Theodore and Wong, Kristi and Woo, B. and Xing, C. and Yao, Z. and Yeh, P. and Ying, Bicheng and Yoo, Juhwan and Yosri, Noureldin and Young, G. and Zalcman, Adam and Zhang, Yaxing and Zhu, Ningfeng and Zobrist, N.}
}
Quantum error correction provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit, where the logical error rate is suppressed exponentially as more qubits are added. However, this exponential suppression only occurs if the physical error rate is below a critical threshold. In this work, we present two surface code memories operating below this threshold: a distance-7 code and a distance-5 code integrated with a real-time decoder. The logical error rate of our larger quantum memory is suppressed by a factor of $\Lambda$ = 2.14 $\pm$ 0.02 when increasing the code distance by two, culminating in a 101-qubit distance-7 code with 0.143% $\pm$ 0.003% error per cycle of error correction. This logical memory is also beyond break-even, exceeding its best physical qubit's lifetime by a factor of 2.4 $\pm$ 0.3. We maintain below-threshold performance when decoding in real time, achieving an average decoder latency of 63 $\mu$s at distance-5 up to a million cycles, with a cycle time of 1.1 $\mu$s. To probe the limits of our error-correction performance, we run repetition codes up to distance-29 and find that logical performance is limited by rare correlated error events occurring approximately once every hour, or 3 $\times$ 10$^9$ cycles. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.