Searcharxiv⌕ Search

arXiv subjects

Qing-Yang Hou

Publications and source records attributed to Qing-Yang Hou.

2 recordsLinked to original sources

Rate-1/2 Quantum LDPC Codes for Multi-tier Superconducting Hardware

Quantum error correction is essential for scalable quantum computing, while its resource overhead is governed in large part by the encoding rate, namely the number of logical qubits encoded per physical data qubit. Recent quantum low-density parity-check (qLDPC) constructions have entered the ultra-high-rate regime with encoding rates above 1/2, but their syndrome-extraction circuits generally rely on reconfigurable connectivity or long-range qubit transport, making them difficult to implement on fixed-connectivity superconducting hardware. Here we introduce Armillary codes, a family of ultra-high-rate qLDPC codes whose algebraic structure is generated by native iSWAP routing under hardware constraints. The construction jointly enforces stabilizer commutation and correct parallel syndrome extraction, while admitting radial and circumferential couplings in crossing-free routing layers. We construct explicit codes with rates above 1/2, stabilizer weight 12, Tanner-graph girth 6, and distances from 12 to 16, with layouts on 5 or 6 hardware tiers. Compared with the Gross and Mitten codes at the same distances, the Armillary codes achieve encoding rates about 6 and 2.5 times those of the Gross and Mitten codes, respectively, while maintaining lower hardware-complexity scores. In circuit-level simulations, the \([\![8688,4348,16]\!]\) code approaches the teraquop regime, achieving a logical error rate of \(1.62\times10^{-12}\) per logical qubit per round at a physical error rate of 0.1\%. These results show that the rate-\(1/2\) regime of qLDPC codes can be extended from reconfigurable platforms to superconducting hardware, providing a route toward low-overhead fault-tolerant quantum processors.

quant-ph↗

Routing Codes: High-Rate Quantum LDPC Codes with Short, Parallel Non-Local Connectivity

Quantum low-density parity-check (qLDPC) codes are promising candidates for realizing large-scale fault-tolerant quantum computing. Although many codes with favorable theoretical parameters have been developed, their practical adoption must take hardware implementability into account. For mainstream quantum platforms such as superconductors and neutral atoms, the connectivity, the length of non-local couplings, and the complexity of wiring or atom rearrangement are key factors that dictate the difficulty of hardware realization. Here, we propose a new family of qLDPC codes, termed routing codes. Within this family, we find explicit instances whose encoding rates are competitive to those of bivariate bicycle (BB) codes, while systematically reducing qubit connectivity, shortening the length of non-local couplings, and, crucially, making all non-local couplings mutually parallel. This parallelism translates into quantifiable benefits, substantially reducing wiring crossings in superconducting multi-layer architectures and simplifying the scheduling of atom movement in neutral-atom arrays. The weight-7 routing codes maintain a high threshold of 0.7\% and reduce the physical qubit overhead by approximately a factor of 8, compared to surface codes achieving a same logical error rate. Further increasing the weight to 11 yields a [[200, 24, 14]] and [[200, 16, 17]] codes with an encoding rate over 23 times that of the surface code, at the cost of a higher logical error rate. These results establish routing codes as a hardware-centric qLDPC family that bridges the gap between theoretical optimality and near-term physical feasibility.

quant-ph↗