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.
Degenerate quantum LDPC codes with good finite length performance
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
baseline 1
citation-polarity summary
years
2026 4roles
baseline 1polarities
baseline 1representative 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.
Extending affine subcode ensemble decoding to quantum codes with overcomplete matrices improves BP convergence and reduces logical error rates on toric and generalized bicycle codes.
Edge-coloring eliminates automorphisms in low-weight stabilizer subgraphs of generalized bicycle codes, enabling improved anisotropic min-sum decoding.
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.
-
Affine Subcode Ensemble Decoding for Degeneracy-Aware Quantum Error Correction
Extending affine subcode ensemble decoding to quantum codes with overcomplete matrices improves BP convergence and reduces logical error rates on toric and generalized bicycle codes.
-
Edge-Based Anisotropic Decoding for Generalized Bicycle Codes
Edge-coloring eliminates automorphisms in low-weight stabilizer subgraphs of generalized bicycle codes, enabling improved anisotropic min-sum decoding.