TY - JOUR
T1 - Quantum error correction below the surface code threshold
AU - Google Quantum AI and Collaborators
AU - Zobrist, Nicholas
AU - Zhu, Ningfeng
AU - Zhang, Yaxing
AU - Zalcman, Adam
AU - Young, Grayson
AU - Yosri, Noureldin
AU - Yoo, Juhwan
AU - Ying, Bicheng
AU - Yeh, Ping
AU - Yao, Z. Jamie
AU - Xing, Cheng
AU - Woo, Bryan W.K.
AU - Wong, Kristi
AU - White, Theodore
AU - Weidel, Travis
AU - Weber, Kate
AU - Ware, Brayden
AU - Wang, Shannon X.
AU - Waltman, Steven
AU - Heidweiller, Catherine Vollgraff
AU - Villalonga, Benjamin
AU - Vidal, Guifre
AU - Vdovichev, Sergey
AU - Vargas, Justin
AU - Vaishnav, Abeer
AU - Torunbalci, M. Mert
AU - Torres, Alfredo
AU - Thor, Douglas
AU - Sztein, Alex
AU - Szasz, Aaron
AU - Suchard, Jordan
AU - Strain, Doug
AU - Sterling, George
AU - Springer, Sofia
AU - Somma, Rolando D.
AU - Smith, W. Clarke
AU - Smelyanskiy, Vadim
AU - Small, Spencer
AU - Skruzny, Jindra
AU - Sivak, Volodymyr
AU - Singh, Shraddha
AU - Shvarts, Vladimir
AU - Shutty, Noah
AU - Shorter, Aaron
AU - Shearn, Michael J.
AU - Senior, Andrew W.
AU - Schuster, Christopher
AU - Schurkus, Henry F.
AU - Satzinger, Kevin J.
AU - Abanin, Dmitry A.
N1 - Publisher Copyright:
© The Author(s) 2024.
PY - 2025/2/27
Y1 - 2025/2/27
N2 - Quantum error correction1, 2, 3–4 provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit, in which 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. Here we present two below-threshold surface code memories on our newest generation of superconducting processors, Willow: 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 Λ = 2.14 ± 0.02 when increasing the code distance by 2, culminating in a 101-qubit distance-7 code with 0.143% ± 0.003 per cent error per cycle of error correction. This logical memory is also beyond breakeven, exceeding the lifetime of its best physical qubit by a factor of 2.4 ± 0.3. Our system maintains below-threshold performance when decoding in real time, achieving an average decoder latency of 63 microseconds at distance 5 up to a million cycles, with a cycle time of 1.1 microseconds. We also 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 × 109 cycles. Our results indicate device performance that, if scaled, could realize the operational requirements of large-scale fault-tolerant quantum algorithms.
AB - Quantum error correction1, 2, 3–4 provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit, in which 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. Here we present two below-threshold surface code memories on our newest generation of superconducting processors, Willow: 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 Λ = 2.14 ± 0.02 when increasing the code distance by 2, culminating in a 101-qubit distance-7 code with 0.143% ± 0.003 per cent error per cycle of error correction. This logical memory is also beyond breakeven, exceeding the lifetime of its best physical qubit by a factor of 2.4 ± 0.3. Our system maintains below-threshold performance when decoding in real time, achieving an average decoder latency of 63 microseconds at distance 5 up to a million cycles, with a cycle time of 1.1 microseconds. We also 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 × 109 cycles. Our results indicate device performance that, if scaled, could realize the operational requirements of large-scale fault-tolerant quantum algorithms.
UR - http://www.scopus.com/inward/record.url?scp=86000008275&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=86000008275&partnerID=8YFLogxK
U2 - 10.1038/s41586-024-08449-y
DO - 10.1038/s41586-024-08449-y
M3 - Article
C2 - 39653125
AN - SCOPUS:86000008275
SN - 0028-0836
VL - 638
SP - 920
EP - 926
JO - Nature
JF - Nature
IS - 8052
M1 - 2172
ER -