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.
Decoding across the quantum low-density parity-check code landscape
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3representative citing papers
MBBP-LD creates multiple cycle-free subtree decompositions of the Tanner graph to run parallel BP decodings on quantum LDPC codes, cutting error rates by up to 30% versus BP-OSD and 20% versus BPGD on tested bivariate bicycle codes with fewer total iterations.
A new [[16384,4142,≤40]] quantum LDPC code family is obtained by CPM-lifting a girth-8 base CSS code, achieving frame error rate ~10^{-8} at depolarizing noise p=0.085.
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.
-
Multiple-Bases Belief Propagation List Decoding for Quantum LDPC Codes
MBBP-LD creates multiple cycle-free subtree decompositions of the Tanner graph to run parallel BP decodings on quantum LDPC codes, cutting error rates by up to 30% versus BP-OSD and 20% versus BPGD on tested bivariate bicycle codes with fewer total iterations.
-
High-Girth Regular Quantum LDPC Codes from Affine-Coset Structures
A new [[16384,4142,≤40]] quantum LDPC code family is obtained by CPM-lifting a girth-8 base CSS code, achieving frame error rate ~10^{-8} at depolarizing noise p=0.085.