Toward a 2D Local Implementation of Quantum LDPC Codes

Abstract

Geometric locality is an important theoretical and practical factor for quantum low-density parity-check (qLDPC) codes which affects code performance and ease of physical realization. For device architectures restricted to 2D local gates, naively implementing the high-rate codes suitable for low-overhead fault-tolerant quantum computing incurs prohibitive overhead. In this work, we present an error correction protocol built on a bilayer architecture that aims to reduce operational overheads when restricted to 2D local gates by measuring some generators less frequently than others. We investigate the family of bivariate bicycle qLDPC codes and show that they are well suited for a parallel syndrome measurement scheme using fast routing with local operations and classical communication (LOCC). Through circuit-level simulations, we find that in some parameter regimes bivariate bicycle codes implemented with this protocol have logical error rates comparable to the surface code while using fewer physical qubits.

18 pages, 12 figures. v2: Accepted to PRX Quantum. Added referee suggestions

References in corpus (39)

• Quantum information with Rydberg atoms
• Suppressing quantum errors by scaling a surface code logical qubit
• Logical quantum processor based on reconfigurable atom arrays
• Semiconductor Spin Qubits
• High threshold universal quantum computation on the surface code
• High-threshold and low-overhead fault-tolerant quantum memory
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Stim: a fast stabilizer circuit simulator
• Quantum computing with nearest neighbor interactions and error rates over 1%
• A Race Track Trapped-Ion Quantum Processor
• Realization of an Error-Correcting Surface Code with Superconducting Qubits
• Entanglement purification and quantum error correction
• Quantum Low-Density Parity-Check Codes
• Low-distance Surface Codes under Realistic Quantum Noise
• Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
• A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes
• Towards practical classical processing for the surface code
• Tradeoffs for reliable quantum information storage in 2D systems
• Decoding Across the Quantum LDPC Code Landscape
• Entangling two atoms of different isotopes via Rydberg blockade
• Alkaline-Earth-Metal Atoms as Few-Qubit Quantum Registers
• Balanced Product Quantum Codes
• Quantum "hyperbicycle" low-density parity check codes with finite rate
• Optimized Entanglement Purification
• Quantum Expander Codes
• A dual-species Rydberg array
• Constant-overhead quantum error correction with thin planar connectivity
• Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics
• Fiber Bundle Codes: Breaking the $N^{1/2}\mathrm{polylog}(N)$ Barrier for Quantum LDPC Codes
• Optimal approach to quantum communication using dynamic programming
• On the qubit routing problem
• Surface code compilation via edge-disjoint paths
• Asymmetric blockade and multi-qubit gates via dipole-dipole interactions
• Circuit Transformations for Quantum Architectures
• Quantifying nonlocality: how outperforming local quantum codes is expensive
• Connectivity constrains quantum codes
• QDistRnd: A GAP package for computing the distance of quantum error-correcting codes
• Quantum Routing with Teleportation
• Partial Syndrome Measurement for Hypergraph Product Codes

Cited by in corpus (15)

• High-rate quantum LDPC codes for long-range-connected neutral atom registers
• Constant-Overhead Fault-Tolerant Bell-Pair Distillation using High-Rate Codes
• Generalized toric codes on twisted tori for quantum error correction
• Quantum error correction for long chains of trapped ions
• Adaptive Syndrome Extraction
• Demonstration of two-dimensional connectivity for a scalable error-corrected ion-trap quantum processor architecture
• Coprime Bivariate Bicycle Codes and Their Layouts on Cold Atoms
• Quantum low-density parity-check codes for erasure-biased atomic quantum processors
• Distributed quantum error correction based on hyperbolic Floquet codes
• Achieving computational gains with quantum error-correction primitives: Generation of long-range entanglement enhanced by error detection
• Non-local resources for error correction in quantum LDPC codes
• Symmetry-enriched topological order and quasifractonic behavior in ${\mathbb{Z}}_N$ stabilizer codes
• Suppressing Degradation in Quantum Batteries by Electromagnetically-induced Transparency
• Quantum memory based on concatenating surface codes and quantum Hamming codes
• Long-ranged gates in quantum computation architectures with limited connectivity