Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures
Kun Liu, Takahiro Tsunoda, Sophia H. Xue, Evan McKinney, Zeyuan Zhou, Shifan Xu, Robert J. Schoelkopf, Yongshan Ding

TL;DR
This paper presents a hardware-software co-design for efficient quantum LDPC code routing on programmable 2D toric architectures, reducing long-range couplers and improving fault-tolerance.
Contribution
It introduces a novel 2D toric network architecture and routing algorithm that significantly reduces long-range couplers and enhances quantum error correction performance.
Findings
Reduced long-range couplers from O(n) to O(√n)
Achieved logical error rate of 3.06% per cycle for an [[18,4,4]] BB code
Demonstrated scalability and low-overhead fault-tolerance in simulation
Abstract
Quantum low-density parity-check codes are promising candidates towards scalable fault-tolerant quantum computation. Among these, bivariate bicycle (BB) codes offer superior encoding rates and large code distance compared to surface codes. However, their requirement on long-range stabilizer measurements poses significant challenges for implementation on realistic hardware with limited connectivity, such as superconducting circuit platforms. In this work, we introduce a novel hardware-software co-design that leverages a programmable communication network architecture to address these limitations. Our approach utilizes a 2D toric network of oscillators as a flexible communication fabric linking qubits at each site. Such architecture significantly reduces the number of long-range couplers required from to . Dual-rail qubits, along with native gates including…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
