Univariate bicycle codes give an explicit basis for logical operators and distance upper bounds in a restricted class of quantum LDPC codes while matching the performance of less constrained generalized and bivariate bicycle codes in simulations.
Generalized bicycle codes with low connectivity: Min- imum distance bounds and hook errors
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Shuttling check qubits in a spin-qubit railway and using the XZZX surface code under dephasing bias achieves a distance-7 megaquop footprint at 10^{-3} physical error rate.
citing papers explorer
-
Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds
Univariate bicycle codes give an explicit basis for logical operators and distance upper bounds in a restricted class of quantum LDPC codes while matching the performance of less constrained generalized and bivariate bicycle codes in simulations.
-
Surface-Code Thresholds and Qubit Footprints in Shuttling-Based Spin-Qubit Railways
Shuttling check qubits in a spin-qubit railway and using the XZZX surface code under dephasing bias achieves a distance-7 megaquop footprint at 10^{-3} physical error rate.