English
Related papers

Related papers: Concatenating Algebraic Codes over High-Rate Quant…

200 papers

Quantum error detection (QED) offers a promising pathway to fault tolerance in near-term quantum devices by balancing error suppression with minimal resource overhead. However, its practical utility hinges on optimizing design…

Quantum Physics · Physics 2025-04-14 Tom Ginsberg , Vyom Patel

This work compares the overhead of quantum error correction with concatenated and topological quantum error-correcting codes. To perform a numerical analysis, we use the Quantum Resource Estimator Toolbox (QuRE) that we recently developed.…

We propose and analyze a hierarchical quantum error correction (QEC) scheme that concatenates hypergraph product (HGP) codes with rotated surface codes, which is compatible with quantum computers with only nearest-neighbor interactions. The…

Quantum Physics · Physics 2025-06-26 Junichi Haruna , Keisuke Fujii

We propose a method for universal fault-tolerant quantum computation using concatenated quantum error correcting codes. Namely, other than computational basis state preparation as required by the DiVincenzo criteria [1], our scheme requires…

Quantum Physics · Physics 2014-04-02 Tomas Jochym-O'Connor , Raymond Laflamme

In a model of fault-tolerant quantum computation with quick and noiseless polyloglog-time auxiliary classical computation, we construct a fault tolerance protocol with constant-space and $\widetilde{O}(\log N)$-time overhead, where…

Quantum Physics · Physics 2025-08-15 Quynh T. Nguyen , Christopher A. Pattison

We present a method of concatenated quantum error correction in which improved classical processing is used with existing quantum codes and fault-tolerant circuits to more reliably correct errors. Rather than correcting each level of a…

Quantum Physics · Physics 2012-10-26 Zachary W. E. Evans , Ashley M. Stephens

Fast, reliable logical operations are essential for realizing useful quantum computers. By redundantly encoding logical qubits into many physical qubits and using syndrome measurements to detect and correct errors, one can achieve low…

Quantum error correction is widely believed to be essential for large-scale quantum computation, but the required qubit overhead remains a central challenge. Quantum low-density parity-check codes can substantially reduce this overhead…

Quantum Physics · Physics 2026-05-13 Chen Zhao , Casey Duckering , Andi Gu , Nishad Maskara , Hengyun Zhou

It is a major challenge to perform addressable and parallel logical operations on constant-rate quantum LDPC (qLDPC) codes. Indeed, the overhead of targeting specific logical qubits represents a crucial bottleneck in many quantum…

Quantum Physics · Physics 2025-10-09 Louis Golowich , Kathleen Chang , Guanyu Zhu

It has been known that quantum error correction via concatenated codes can be done with exponentially small failure rate if the error rate for physical qubits is below a certain accuracy threshold. Other, unconcatenated codes with their own…

Quantum Physics · Physics 2008-12-18 Eric Dennis

Quantum LDPC codes may provide a path to build low-overhead fault-tolerant quantum computers. However, as general LDPC codes lack geometric constraints, na\"ive layouts couple many distant qubits with crossing connections which could be…

Quantum Physics · Physics 2022-08-17 Maxime A. Tremblay , Nicolas Delfosse , Michael E. Beverland

Large-scale quantum computation requires to be performed in the fault-tolerant manner. One crucial challenge of fault-tolerant quantum computing (FTQC) is reducing the overhead of implementing logical gates. Recently work proposed…

In this work, the efficient quantum error-correction protocol against the general independent noise is constructed with the three-qubit codes. The rules of concatenation are summarized according to the error-correcting capability of the…

Quantum Physics · Physics 2024-06-05 Long Huang

Using transversal gates is a straightforward and efficient technique for fault-tolerant quantum computing. Since transversal gates alone cannot be computationally universal, they must be combined with other approaches such as magic state…

Quantum Physics · Physics 2017-10-04 Eesa Nikahd , Mehdi Sedighi , Morteza Saheb Zamani

It is conjectured that quantum computers are able to solve certain problems more quickly than any deterministic or probabilistic computer. A quantum computer exploits the rules of quantum mechanics to speed up computations. However, it is a…

Information Theory · Computer Science 2009-08-15 Salah A. Aly

Quantum error correction (QEC) is required for large-scale computation, but incurs a significant resource overhead. Recent advances have shown that by jointly decoding logical qubits in algorithms composed of transversal gates, the number…

Topological codes have many desirable properties that allow fault-tolerant quantum computation with relatively low overhead. A core challenge for these codes, however, is to achieve a low-overhead universal gate set with limited…

Quantum Physics · Physics 2026-04-03 Julio C. Magdalena de la Fuente , Noa Feldman , Jens Eisert , Andreas Bauer

Fault-tolerant quantum error correction is essential for implementing quantum algorithms of significant practical importance. In this work, we propose a highly effective use of the surface-GKP code, i.e., the surface code consisting of…

Quantum Physics · Physics 2022-02-01 Kyungjoo Noh , Christopher Chamberland , Fernando G. S. L. Brandão

The overhead of quantum error correction (QEC) poses a major bottleneck for realizing fault-tolerant computation. To reduce this overhead, we exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into…

Quantum Physics · Physics 2025-09-30 Shouzhen Gu , Alex Retzker , Aleksander Kubica

We present and analyze protocols for fault-tolerant quantum computing using color codes. We present circuit-level schemes for extracting the error syndrome of these codes fault-tolerantly. We further present an integer-program-based…

Quantum Physics · Physics 2011-08-31 Andrew J. Landahl , Jonas T. Anderson , Patrick R. Rice