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

• URL: http://arxiv.org/abs/2606.25330v1
• Date: Wed, 24 Jun 2026 02:50:51 GMT
• Title: Routing Codes: High-Rate Quantum LDPC Codes with Short, Parallel Non-Local Connectivity
• Abstract summary: Quantum low-density parity-check (qLDPC) codes are promising candidates for realizing large-scale fault-tolerant quantum computing.<n>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.
• Score: 10.45558661301465
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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 comparable 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 fundamentally eliminates wiring crossings in superconducting multi-layer architectures and drastically simplifies the scheduling of atom movement in neutral-atom arrays. Under circuit-level simulation, the weight-7 routing codes reduce the physical qubit overhead by approximately a factor of 8, compared to surface codes achieving a same 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.

Related papers

• Surface code logical operations on a superconducting quantum processor [66.1042398805403]
  We experimentally realize key elements of patch-based surface-code logical processing on a 107-qubit superconducting quantum processor.<n>Our results advance superconducting surface-code experiments from protected logical memory to active, patch-based fault-tolerant logical operations.
  arXiv  Detail & Related papers  (2026-07-01T21:07:02Z)
• Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures [1.5531887595047786]
  Quantum low-density parity-check codes offer superior encoding rates and large code distance compared to surface codes.<n>Long-range stabilizer measurements pose significant challenges for implementation on realistic hardware with limited connectivity.<n>We introduce a novel hardware-software co-design that leverages a programmable communication network architecture to address these limitations.
  arXiv  Detail & Related papers  (2026-04-20T18:14:28Z)
• A Scalable Distributed Quantum Optimization Framework via Factor Graph Paradigm [46.08923284345648]
  We introduce a structure-aware framework for distributed quantum optimization.<n>We find that for a search space of size $N$, our framework achieves $O(sqrtN)$ query complexity up to processors and separator dependent factors.<n>We show that structure-aware decomposition delivers a practical path to scalable distributed quantum optimization on quantum networks.
  arXiv  Detail & Related papers  (2026-03-08T15:15:52Z)
• Exploiting Movable Logical Qubits for Lattice Surgery Compilation [43.290156259065554]
  We introduce a paradigm shift by exploiting movable logical qubits via teleportation during the logical lattice surgery CNOT gate.<n> Numerical simulations show that the proposed approach can substantially reduce the routed circuit depth.<n>An open-source implementation of our method is available on GitHub.
  arXiv  Detail & Related papers  (2025-12-03T19:00:04Z)
• Batched high-rate logical operations for quantum LDPC codes [2.722479714583866]
  High-rate quantum LDPC codes reduce memory overhead by densely packing many logical qubits into a single block of physical qubits.<n>We extend this concept to high-rate computation by constructing emphbatched fault-tolerant operations that apply the same logical gate across many code blocks in parallel.
  arXiv  Detail & Related papers  (2025-10-07T17:26:10Z)
• Placing and routing quantum LDPC codes in multilayer superconducting hardware [0.6713975160553138]
  We develop Hardware-Aware Layout, HAL: a robust, efficient runtime algorithm.<n> HAL generates around 150 explicit layouts of quantum low-density parity-check (qLDPC) codes.<n>We lay out highly nonlocal qLDPC code families that achieve competitive tradeoffs between hardware complexity and logical efficiency.
  arXiv  Detail & Related papers  (2025-07-30T18:19:44Z)
• Directional Codes: a new family of quantum LDPC codes on hexagonal- and square-grid connectivity hardware [0.0]
  Utility-scale quantum computing requires quantum error correction (QEC) to protect quantum information against noise.<n>Currently, superconducting hardware is a promising candidate for achieving fault tolerance due to its fast gate times and feasible scalability.<n>We construct a new family of qLDPC codes, which outperforms the rotated planar code (RPC)<n>We numerically evaluate the performance of directional codes, encoding four, six and twelve logical qubits.
  arXiv  Detail & Related papers  (2025-07-25T16:57:21Z)
• Extractors: QLDPC Architectures for Efficient Pauli-Based Computation [39.98920557126034]
  We propose a new primitive that can augment any QLDPC memory into a computational block well-suited for Pauli-based computation.<n>In particular, any logical Pauli operator supported on the memory can be fault-tolerantly measured in one logical cycle.<n>Our architecture can implement universal quantum circuits via parallel logical measurements.
  arXiv  Detail & Related papers  (2025-03-13T14:07:40Z)
• Low-Overhead Transversal Fault Tolerance for Universal Quantum Computation [36.3664581543528]
  We show that logical operations can be performed fault-tolerantly with only a constant number of extraction rounds.<n>Our work sheds new light on the theory of quantum fault tolerance and has the potential to reduce the space-time cost of practical fault-tolerant quantum computation by over an order of magnitude.
  arXiv  Detail & Related papers  (2024-06-25T15:43:25Z)
• High-rate quantum LDPC codes for long-range-connected neutral atom registers [0.0]
  High-rate quantum error correcting (QEC) codes with moderate overheads in qubit number and control complexity are desirable for fault-tolerant quantum computing.<n>We analyze a family of Low-Density Parity-Check (LDPC) codes with limited long-range interactions and outline a near-term implementation in neutral atom registers.
  arXiv  Detail & Related papers  (2024-04-19T17:14:03Z)
• Comparative study of quantum error correction strategies for the heavy-hexagonal lattice [41.94295877935867]
  Topological quantum error correction is a milestone in the scaling roadmap of quantum computers.<n>The square-lattice surface code has become the workhorse to address this challenge.<n>In some platforms, however, the connectivities are kept even lower in order to minimise gate errors.
  arXiv  Detail & Related papers  (2024-02-03T15:28:27Z)
• Building a fault-tolerant quantum computer using concatenated cat codes [44.03171880260564]
  We present a proposed fault-tolerant quantum computer based on cat codes with outer quantum error-correcting codes. We numerically simulate quantum error correction when the outer code is either a repetition code or a thin rectangular surface code. We find that with around 1,000 superconducting circuit components, one could construct a fault-tolerant quantum computer.
  arXiv  Detail & Related papers  (2020-12-07T23:22:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.