A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:H4LYOJ6Crecord.jsonopen to challenge →
read the original abstract
Quantum low-density parity-check codes reduce quantum error correction overhead but require dense, long-range connectivity that challenges hardware implementation, particularly for superconducting processors. We address this problem by demonstrating that long-range connections can be reduced at the cost of increased syndrome extraction circuit depth. Our approach is based on the observation that X and Z ancilla qubits form short loops with data qubits - a property that holds for any quantum code. This enables implementing stabilizer measurement circuits by routing data qubit information through ancilla qubits when direct connections are unavailable. For bivariate bicycle codes, we remove up to 50% of long-range connections while approximately doubling the circuit depth, with the circuit-level distance remaining largely preserved. This method can also be applied to surface codes, achieving the same hexagonal connectivity requirement as McEwen et al. (Quantum 7, 1172 (2023)). Our routing approach for designing syndrome extraction circuits is applicable to diverse quantum codes, offering a practical pathway toward their implementation on hardware with connectivity constraints.
This paper has not been read by Pith yet.
Forward citations
Cited by 4 Pith papers
-
Placing and routing quantum LDPC codes in multilayer superconducting hardware
HAL heuristic produces explicit layouts for bivariate bicycle, tile, radial, and Tanner qLDPC codes on multilayer superconducting hardware, demonstrating that open-boundary designs reduce hardware demands with only mo...
-
Barbell Codes: qLDPC Codes for Superconducting Quantum Hardware
Barbell codes are a family of qLDPC codes with a matching superconducting chip layout enabling constant hardware complexity, simulated to preserve logical information over trillions of QEC cycles at 10^{-4} physical n...
-
Distributed Quantum Error Correction with Bivariate Bicycle Codes in a Modular Architecture
The [[144,12,12]] bivariate bicycle code is distributed across 4 to 12 processors in a star network, with simulations showing logical error rates under varying nonlocal noise scaling.
-
Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures
A programmable 2D toric oscillator network enables efficient routing for bivariate bicycle LDPC codes, reducing long-range couplers to O(sqrt(n)) and achieving 3.06% logical error rate per cycle in simulations for the...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.