Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2505.09684 · Nature Physics

Demonstration of low-overhead quantum error correction codes

Ke Wang, Zhide Lu, Chuanyu Zhang, Gongyu Liu, Jiachen Chen, Yanzhe Wang, Yaozu Wu, Shibo Xu, Xuhao Zhu, Feitong Jin, Yu Gao, Ziqi Tan, Zhengyi Cui, Ning Wang, Yiren Zou, Aosai Zhang, Tingting Li, Fanhao Shen, Jiarun Zhong, Zehang Bao, Zitian Zhu, Yihang Han, Yiyang He, Jiayuan Shen, Han Wang, Jianan Yang, Zixuan Song, Jinfeng Deng, Hang Dong, Zheng-Zhi Sun, Weikang Li, Qi Ye, Si Wen Jiang, Yixuan Ma, Pei-Xin Shen, Pengfei Zhang, Hekang Li, Qiujiang Guo, Zhen Wang, Chao Song, H. Wang, Dong‐Ling Deng

Published Jan 22, 2026• 74 citations
arXivHTMLPDF
DOI
10.1038/s41567-025-03157-4

Related papers

Quantum Error-Correction Codes

Mahn‐Soo Choi

Springer eBooks•Jan 1, 2022•0 citations

A lower bound on the overhead of quantum error correction in low dimensions

Nouédyn Baspin, Omar Fawzi, Ala Shayeghi

We show that a quantum architecture with an error correction procedure limited to geometrically local operations incurs an overhead that grows with the system size, even if arbitrary error-free classical computation is allowed. In particular, we prove that in order to operate a quantum error correcting code in 2D at a logical error rate of $δ$, a space overhead of $Ω(\sqrt{\log(1/δ)})$ is needed for any constant depolarizing noise $p > 0$.

arXiv:2302.04317•Feb 8, 2023•19 citations

Quantum Error Correction: Applications and implementations

Daniel A. Lidar, Todd A. Brun

•Jan 1, 2013•0 citations

Low-overhead fault-tolerant quantum computation by gauging logical operators

Dominic J. Williamson, Theodore J. Yoder

Quantum computation must be performed in a fault-tolerant manner to be useful in practice. Recent progress has established quantum error-correcting codes with sparse connectivity requirements and constant qubit overhead suitable for quantum memory. However, existing schemes that include fault-tolerant logical measurement on such quantum memories do not always achieve low qubit overhead. Here we present a low-overhead method to implement fault-tolerant logical measurement on a quantum error-correcting code by treating the logical operator as a physical symmetry and gauging it so that it is enforced by a product of local symmetries. The gauging measurement procedure introduces a high degree of flexibility that can be exploited to achieve a qubit overhead that is linear in the weight of the operator being measured up to a polylogarithmic factor. This flexibility also allows the procedure to be adapted to arbitrary quantum codes. Our results provide a more efficient approach to performing fault-tolerant quantum computation, making it more tractable for near-term implementation. Combining quantum error correction with gauge theory concepts from many-body physics enables the design of codes with improved resource requirements for fault-tolerant quantum computation.

arXiv:2410.02213•Nature Physics•Apr 1, 2026•86 citations

Quantum error correction at ultra-low overhead

Zhide Lu, Weikang Li, Dong-Ling Deng

Suppressing errors is the central challenge for useful large-scale quantum computing. While quantum error correction promises a viable solution to this challenge, existing codes typically suffer from trade-offs among encoding efficiency, error threshold, and hardware feasibility. Here, we introduce Cornucopia codes, a family of practical, hardware-efficient quantum low-density parity-check codes that achieve an ultra-high encoding rate exceeding $1/2$ while maintaining a pseudo-threshold exceeding $0.4\%$ under the standard circuit-level noise model. Inspired by recent affine-permutation-based code constructions and the long-range connectivity available in reconfigurable neutral-atom arrays, we adopt a structured code geometry in which the code layout, atom rearrangement, and syndrome-extraction schedule are co-designed. This structure enables nonlocal syndrome measurements through simple, parallel atom rearrangements. A complete syndrome extraction cycle measures all $X$- and $Z$-type checks in parallel with $12$ entangling layers, independent of the code size. The resulting threshold is comparable to those of the surface code and bivariate bicycle codes. In particular, a single code block $[[2844,1426,18]]$ encodes $1{,}426$ distance-$18$ logical qubits, achieving an extrapolated logical error rate of $2.6\times10^{-16}$ ($1.9\times10^{-31}$) per logical qubit per cycle, assuming the physical error rate of $0.1\%$ ($0.01\%$). By comparison, a bivariate bicycle code implementation would require more than $68{,}000$ physical qubits to encode the same number of logical qubits at a comparable logical error rate. These results bring demonstrations of ultra-low-overhead quantum error correction within the reach of near-term quantum processors.

quant-pharXiv:2608.02773•Aug 5, 2026•11 citations

Realization of quantum error correction

John Chiaverini, Dietrich G. Leibfried, Tobias Schaetz +9 more

Nature•Dec 1, 2004•519 citations
We show that a quantum architecture with an error correction procedure limited to geometrically local operations incurs an overhead that grows with the system size, even if arbitrary error-free classical computation is allowed. In particular, we prove that in order to operate a quantum error correcting code in 2D at a logical error rate of δδδ, a space overhead of Ω(log⁡(1/δ))Ω(\sqrt{\log(1/δ)})Ω(log(1/δ)​) is needed for any constant depolarizing noise p>0p > 0p>0.
Quantum computation must be performed in a fault-tolerant manner to be useful in practice. Recent progress has established quantum error-correcting codes with sparse connectivity requirements and constant qubit overhead suitable for quantum memory. However, existing schemes that include fault-tolerant logical measurement on such quantum memories do not always achieve low qubit overhead. Here we present a low-overhead method to implement fault-tolerant logical measurement on a quantum error-correcting code by treating the logical operator as a physical symmetry and gauging it so that it is enforced by a product of local symmetries. The gauging measurement procedure introduces a high degree of flexibility that can be exploited to achieve a qubit overhead that is linear in the weight of the operator being measured up to a polylogarithmic factor. This flexibility also allows the procedure to be adapted to arbitrary quantum codes. Our results provide a more efficient approach to performing fault-tolerant quantum computation, making it more tractable for near-term implementation. Combining quantum error correction with gauge theory concepts from many-body physics enables the design of codes with improved resource requirements for fault-tolerant quantum computation.
Suppressing errors is the central challenge for useful large-scale quantum computing. While quantum error correction promises a viable solution to this challenge, existing codes typically suffer from trade-offs among encoding efficiency, error threshold, and hardware feasibility. Here, we introduce Cornucopia codes, a family of practical, hardware-efficient quantum low-density parity-check codes that achieve an ultra-high encoding rate exceeding 1/21/21/2 while maintaining a pseudo-threshold exceeding 0.4%0.4\%0.4% under the standard circuit-level noise model. Inspired by recent affine-permutation-based code constructions and the long-range connectivity available in reconfigurable neutral-atom arrays, we adopt a structured code geometry in which the code layout, atom rearrangement, and syndrome-extraction schedule are co-designed. This structure enables nonlocal syndrome measurements through simple, parallel atom rearrangements. A complete syndrome extraction cycle measures all XXX- and ZZZ-type checks in parallel with 121212 entangling layers, independent of the code size. The resulting threshold is comparable to those of the surface code and bivariate bicycle codes. In particular, a single code block [[2844,1426,18]][[2844,1426,18]][[2844,1426,18]] encodes 1,4261{,}4261,426 distance-181818 logical qubits, achieving an extrapolated logical error rate of 2.6×10−162.6\times10^{-16}2.6×10−16 (1.9×10−311.9\times10^{-31}1.9×10−31) per logical qubit per cycle, assuming the physical error rate of 0.1%0.1\%0.1% (0.01%0.01\%0.01%). By comparison, a bivariate bicycle code implementation would require more than 68,00068{,}00068,000 physical qubits to encode the same number of logical qubits at a comparable logical error rate. These results bring demonstrations of ultra-low-overhead quantum error correction within the reach of near-term quantum processors.