2025/10/22 by Zhang, Guo, Zhu, Yuanye, Li, Ying · 1 citation
#FOS: Physical sciences #Quantum Physics (quant-ph)
paper · doi:10.48550/arxiv.2510.19442
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(da+o(1)) for any [[n,k,d]] qLDPC code with constant encoding rate and distance d = Ω(n1/a). For good qLDPC codes, the time overhead is minimized and reaches O(d1+o(1)). In contrast, code surgery based on gauging measurement and brute-force branching requires a time overhead of O(dw1+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.