Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Competitive Circuit-Level Performance
cs.IT, cs.DM, math.IT, quant-ph
Submitted: 2025-08-12
Updated: 2026-11-12
Code: https://github.com/oscarhiggott/PyMatching
Terminology
Sources
- Constructions and performance of hyperbolic and semi-hyperbolic Floquet codes
- Quantum LDPC Codes of Almost Linear Distance via Homological Products
- Good quantum LDPC codes with linear time decoder from lossless expanders
- The Physics of (good) LDPC Codes I. Gauging and dualities
- The Physics of (good) LDPC Codes II. Product constructions
- Single-shot and two-shot decoding with generalized bicycle codes
- Small Quantum Codes from Algebraic Extensions of Generalized Bicycle Codes
- qSIEVE: Efficient qLDPC Memory via Systolic Movement in Atom Arrays
- Fault-Tolerant Logical Clifford Gates from Code Automorphisms
- On the Generalization of Kitaev Codes as Generalized Bicycle Codes
- An almost-linear time decoding algorithm for quantum LDPC codes under circuit-level noise
Related papers
- The Gaussian Multiuser Channel Capacity Region
- The mathematical landscape of partial information decomposition: A comprehensive review of properties and measures
- Electromagnetic Signal and Information Theory: A Continuous-Aperture Array Perspective
- Analytically Characterized Optimal Power Control for Signal-Level-Integrated Sensing, Computing and Communication in Federated Learning
- Information Spectrum Methods for Multiple-Access Channels--Part I: epsilon-Capacity Regions in the Mixed Gaussian Case
- Seed Recycling: Explicit Codes for Mixed Synchronization Errors Matching the Leading Term of the Gilbert--Varshamov Bound