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.
Quantum kronecker sum-product low- density parity-check codes with finite rate,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.