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:2502.09542 · Physical Review Letters

Constant-Overhead Fault-Tolerant Bell-Pair Distillation Using High-Rate Codes

J. Pablo Bonilla Ataides, Hengyun Zhou, Qian Xu, Gefen Baranes, Bikun Li, Mikhail D. Lukin, Liang Jiang

Published Aug 18, 2025• 34 citations
arXivHTMLPDF

Abstract

We present a fault-tolerant Bell-pair distillation scheme achieving constant overhead through high-rate quantum low-density parity-check (qLDPC) codes. Our approach maintains a constant distillation rate equal to the code rate while requiring no additional overhead beyond the physical qubits of the code. Full circuit-level analysis demonstrates fault-tolerance for input Bell-pair infidelities below a threshold ∼10%, readily achievable with near-term capabilities. Unlike previous proposals, our scheme keeps the output Bell pairs encoded in qLDPC codes at each node, eliminating unencoding overhead and enabling direct use in distributed quantum applications through recent advances in qLDPC computation. These results establish qLDPC-based distillation as a practical route toward resource-efficient quantum networks and distributed quantum computing.

DOI
10.1103/s39k-r2kq

Related papers

Accelerating Fault-Tolerant Quantum Computation with Good Quantum Low-Density Parity-Check Codes

Guo Zhang, Yuanye Zhu, Ying Li

We propose a fault-tolerant quantum computation scheme that is broadly applicable to quantum low-density parity-check (qLDPC) codes. The scheme achieves constant qubit overhead and a time overhead of O ( d a + o ( 1 ) ) for any [ [ n , k , d ] ] qLDPC code with constant encoding rate and distance d = Ω ( n 1 / a ) . For good qLDPC codes, the time overhead is minimized and reaches O ( d 1 + o ( 1 ) ) . In contrast, code surgery based on gauging measurement and brute-force branching requires a time overhead of O ( d w 1 + o ( 1 ) ) , where d ≤ w ≤ n . Thus, our scheme is asymptotically faster for all codes with a < 2 . This speedup is achieved by developing techniques that enable parallelized code surgery under constant qubit overhead and leverage classical locally testable codes for efficient resource state preparation. These results establish a new paradigm for accelerating fault-tolerant quantum computation on qLDPC codes, while maintaining low overhead and broad applicability.

arXiv:2510.19442•PRX Quantum•Jun 3, 2026•6 citations

Constant-Overhead Magic State Injection into qLDPC Codes with Error Independence Guarantees

Zhang Guo, Zhu, Yuanye, Xiao Yuan +1 more

Magic states are essential yet resource-intensive components for realizing universal fault-tolerant quantum computation. Preparing magic states within emerging quantum low-density parity-check (qLDPC) codes poses additional challenges, due to the complex encoding structures. Here, we introduce a generic and scalable method for magic state injection into arbitrarily selected logical qubits encoded using qLDPC codes. Our approach, based on parallelized code surgery, supports the injection from either physical qubits or low-distance logical qubits. For qLDPC code families with asymptotically constant encoding rates, the method achieves injection into $Θ(k)$ logical qubits -- where $k$ denotes the logical qubit number of the code -- with only constant qubit overhead and a time complexity of $\tilde{O}(d^2)$, where $d$ is the code distance. A central contribution of this work is a rigorous proof that errors affecting the injected magic states remain independent throughout the procedure. This independence ensures the resilience of logical qubits against interactions with noisy ancillae and preserves the presumption of subsequent magic state distillation protocols. We further support our theoretical results with numerical validation through circuit-level simulations. These findings advance the feasibility of scalable, fault-tolerant universal quantum computing using qLDPC codes, offering a pathway to significantly reduced qubit resource requirements in magic state injection.

arXiv:2505.06981•May 11, 2025•11 citations

Fault-tolerant quantum computation with constant overhead for general noise

Matthias Christandl, Omar Fawzi, Ashutosh Goswami

Fault-tolerant quantum computation traditionally incurs substantial resource overhead, with both qubit and time overheads scaling polylogarithmically with the size of the computation. While prior work by Gottesman showed that constant qubit overhead is achievable under stochastic noise using quantum low-density parity-check (QLDPC) codes, it has remained an open question whether similar guarantees hold under more general, non-stochastic noise models. In this work, we address this question by considering a general circuit-level noise model defined via the diamond norm, which captures both stochastic and non-stochastic noise, including coherent and amplitude damping noise. We prove that constant qubit overhead fault-tolerant quantum computation is achievable in this general setting, using QLDPC codes with constant rate and linear minimum distance. To establish our result, we develop a fault-tolerant error correction scheme and a method for implementing logic gates under general circuit noise. These results extend the theoretical foundations of fault-tolerant quantum computation and offer new directions for fault-tolerant architectures under realistic noise models.

quant-pharXiv:2512.02760•PRX Quantum•Dec 3, 2025•4 citations

Efficient Logic with Ultra-High-Rate Quantum Codes

Nishad Maskara, Rohan Mehta, Zhiyang He +4 more

Quantum low-density parity-check (qLDPC) codes offer a promising route to reducing the qubit overhead of fault tolerance, with recent ultra-high-rate constructions achieving encoding rates above one half. In this work, we develop fast and parallel logical computation methods for ultra-high-rate codes. We first utilize the group symmetries of the codes to partition the logical qubits into orbits, and then apply parallel surgery methods to implement group-invariant collections of logical Pauli-product measurements. These measurements are highly programmable, as we may arbitrarily couple logical orbits as long as each measurement is repeated across the whole orbit(s). To reduce the space and time overheads, we develop a technique called chain-map convolution, which uses the group structure to boost both the spatial and temporal distances of our protocol in a highly efficient manner. As case studies, we construct distance-preserving parallel measurement gadgets for the [[256, 68, 12]], [[576, 148, 18]] pair-partition codes, and a [[1152, 580, 12]] rate-$1/2$ code, with only around $2.5\times$ space overhead and 3-4 rounds of syndrome extraction each. The same methods also enable parallel injection of cultivated magic states into high-rate codes. Finally, we extend programmability through subgroup restrictions, revealing a tradeoff between logical control and the spacetime resources required for fault tolerance and highlighting the crucial role structured parallelism plays in reducing overhead. These results provide new methods for designing qLDPC logical operations with low spacetime overhead, opening a route toward more efficient fault-tolerant quantum architectures.

quant-pharXiv:2610.06749•Oct 6, 2026•2 citations

Measurement-Based Entanglement Distillation and Constant-Rate Quantum Repeaters over Arbitrary Distances

Yu Bo Shi, Ashlesha Patil, Saikat Guha

Measurement-based quantum repeaters employ entanglement distillation and swapping across links using locally prepared resource states of minimal size and local Bell measurements. In this Letter, we introduce a systematic protocol for measurement-based entanglement distillation and its application to repeaters that can leverage any stabilizer code. Given a code, we explicitly define the corresponding resource state and derive an error-recovery operation based on all Bell measurement outcomes. Our approach offers deeper insights into the impact of resource state noise on repeater performance while also providing strategies for efficient preparation and fault-tolerant preservation of resource states. As an application, we propose a measurement-based repeater protocol based on quantum low-density parity-check (QLDPC) codes, enabling constant-yield Bell state distribution over arbitrary distances. Numerical simulations identify a fault-tolerant threshold on the total physical error per repeater segment-including errors on resource states, remotely generated Bell states, and Bell measurements-and confirm that increasing the QLDPC code size further suppresses the logical error while maintaining a fixed encoding rate. This Letter establishes a scalable backbone for future global-scale fault-tolerant quantum networks.

arXiv:2502.11174•Physical Review Letters•Aug 18, 2025•5 citations

Fault-tolerant quantum computation with polylogarithmic time and constant space overheads

Shiro Tamiya, Masato Koashi, Hayata Yamasaki

Abstract A major challenge in fault-tolerant quantum computation is to reduce both the space overhead, that is, the large number of physical qubits per logical qubit, and the time overhead, that is, the long physical gate sequences needed to implement a logical gate. Here we prove that a protocol using non-vanishing-rate quantum low-density parity-check (QLDPC) codes, combined with concatenated Steane codes, achieves constant space overhead and polylogarithmic time overhead, even when accounting for the required classical processing. This protocol offers an improvement over existing constant-space-overhead protocols. To prove our result, we develop a technique that we call partial circuit reduction, which enables error analysis for the entire fault-tolerant circuit by examining smaller parts composed of a few gadgets. With this approach, we resolve a logical gap in the existing arguments for the threshold theorem for the constant-space-overhead protocol with QLDPC codes and complete its proof. Our work establishes that the QLDPC-code-based approach can realize fault-tolerant quantum computation with a negligibly small slowdown and a bounded overhead of physical qubits.

arXiv:2411.03683•Nature Physics•Nov 26, 2025•35 citations
We present a fault-tolerant Bell-pair distillation scheme achieving constant overhead through high-rate quantum low-density parity-check (qLDPC) codes. Our approach maintains a constant distillation rate equal to the code rate while requiring no additional overhead beyond the physical qubits of the code. Full circuit-level analysis demonstrates fault-tolerance for input Bell-pair infidelities below a threshold ∼10%, readily achievable with near-term capabilities. Unlike previous proposals, our scheme keeps the output Bell pairs encoded in qLDPC codes at each node, eliminating unencoding overhead and enabling direct use in distributed quantum applications through recent advances in qLDPC computation. These results establish qLDPC-based distillation as a practical route toward resource-efficient quantum networks and distributed quantum computing.
We propose a fault-tolerant quantum computation scheme that is broadly applicable to quantum low-density parity-check (qLDPC) codes. The scheme achieves constant qubit overhead and a time overhead of O ( d a + o ( 1 ) ) for any [ [ n , k , d ] ] qLDPC code with constant encoding rate and distance d = Ω ( n 1 / a ) . For good qLDPC codes, the time overhead is minimized and reaches O ( d 1 + o ( 1 ) ) . In contrast, code surgery based on gauging measurement and brute-force branching requires a time overhead of O ( d w 1 + o ( 1 ) ) , where d ≤ w ≤ n . Thus, our scheme is asymptotically faster for all codes with a < 2 . This speedup is achieved by developing techniques that enable parallelized code surgery under constant qubit overhead and leverage classical locally testable codes for efficient resource state preparation. These results establish a new paradigm for accelerating fault-tolerant quantum computation on qLDPC codes, while maintaining low overhead and broad applicability.
Magic states are essential yet resource-intensive components for realizing universal fault-tolerant quantum computation. Preparing magic states within emerging quantum low-density parity-check (qLDPC) codes poses additional challenges, due to the complex encoding structures. Here, we introduce a generic and scalable method for magic state injection into arbitrarily selected logical qubits encoded using qLDPC codes. Our approach, based on parallelized code surgery, supports the injection from either physical qubits or low-distance logical qubits. For qLDPC code families with asymptotically constant encoding rates, the method achieves injection into Θ(k)Θ(k)Θ(k) logical qubits -- where kkk denotes the logical qubit number of the code -- with only constant qubit overhead and a time complexity of O~(d2)\tilde{O}(d^2)O~(d2), where ddd is the code distance. A central contribution of this work is a rigorous proof that errors affecting the injected magic states remain independent throughout the procedure. This independence ensures the resilience of logical qubits against interactions with noisy ancillae and preserves the presumption of subsequent magic state distillation protocols. We further support our theoretical results with numerical validation through circuit-level simulations. These findings advance the feasibility of scalable, fault-tolerant universal quantum computing using qLDPC codes, offering a pathway to significantly reduced qubit resource requirements in magic state injection.
Fault-tolerant quantum computation traditionally incurs substantial resource overhead, with both qubit and time overheads scaling polylogarithmically with the size of the computation. While prior work by Gottesman showed that constant qubit overhead is achievable under stochastic noise using quantum low-density parity-check (QLDPC) codes, it has remained an open question whether similar guarantees hold under more general, non-stochastic noise models. In this work, we address this question by considering a general circuit-level noise model defined via the diamond norm, which captures both stochastic and non-stochastic noise, including coherent and amplitude damping noise. We prove that constant qubit overhead fault-tolerant quantum computation is achievable in this general setting, using QLDPC codes with constant rate and linear minimum distance. To establish our result, we develop a fault-tolerant error correction scheme and a method for implementing logic gates under general circuit noise. These results extend the theoretical foundations of fault-tolerant quantum computation and offer new directions for fault-tolerant architectures under realistic noise models.
Quantum low-density parity-check (qLDPC) codes offer a promising route to reducing the qubit overhead of fault tolerance, with recent ultra-high-rate constructions achieving encoding rates above one half. In this work, we develop fast and parallel logical computation methods for ultra-high-rate codes. We first utilize the group symmetries of the codes to partition the logical qubits into orbits, and then apply parallel surgery methods to implement group-invariant collections of logical Pauli-product measurements. These measurements are highly programmable, as we may arbitrarily couple logical orbits as long as each measurement is repeated across the whole orbit(s). To reduce the space and time overheads, we develop a technique called chain-map convolution, which uses the group structure to boost both the spatial and temporal distances of our protocol in a highly efficient manner. As case studies, we construct distance-preserving parallel measurement gadgets for the [[256, 68, 12]], [[576, 148, 18]] pair-partition codes, and a [[1152, 580, 12]] rate-1/21/21/2 code, with only around 2.5×2.5\times2.5× space overhead and 3-4 rounds of syndrome extraction each. The same methods also enable parallel injection of cultivated magic states into high-rate codes. Finally, we extend programmability through subgroup restrictions, revealing a tradeoff between logical control and the spacetime resources required for fault tolerance and highlighting the crucial role structured parallelism plays in reducing overhead. These results provide new methods for designing qLDPC logical operations with low spacetime overhead, opening a route toward more efficient fault-tolerant quantum architectures.
Measurement-based quantum repeaters employ entanglement distillation and swapping across links using locally prepared resource states of minimal size and local Bell measurements. In this Letter, we introduce a systematic protocol for measurement-based entanglement distillation and its application to repeaters that can leverage any stabilizer code. Given a code, we explicitly define the corresponding resource state and derive an error-recovery operation based on all Bell measurement outcomes. Our approach offers deeper insights into the impact of resource state noise on repeater performance while also providing strategies for efficient preparation and fault-tolerant preservation of resource states. As an application, we propose a measurement-based repeater protocol based on quantum low-density parity-check (QLDPC) codes, enabling constant-yield Bell state distribution over arbitrary distances. Numerical simulations identify a fault-tolerant threshold on the total physical error per repeater segment-including errors on resource states, remotely generated Bell states, and Bell measurements-and confirm that increasing the QLDPC code size further suppresses the logical error while maintaining a fixed encoding rate. This Letter establishes a scalable backbone for future global-scale fault-tolerant quantum networks.
Abstract A major challenge in fault-tolerant quantum computation is to reduce both the space overhead, that is, the large number of physical qubits per logical qubit, and the time overhead, that is, the long physical gate sequences needed to implement a logical gate. Here we prove that a protocol using non-vanishing-rate quantum low-density parity-check (QLDPC) codes, combined with concatenated Steane codes, achieves constant space overhead and polylogarithmic time overhead, even when accounting for the required classical processing. This protocol offers an improvement over existing constant-space-overhead protocols. To prove our result, we develop a technique that we call partial circuit reduction, which enables error analysis for the entire fault-tolerant circuit by examining smaller parts composed of a few gadgets. With this approach, we resolve a logical gap in the existing arguments for the threshold theorem for the constant-space-overhead protocol with QLDPC codes and complete its proof. Our work establishes that the QLDPC-code-based approach can realize fault-tolerant quantum computation with a negligibly small slowdown and a bounded overhead of physical qubits.