Space-group codes—CSS codes whose stabilizers use crystallographic point-group symmetries—can be topologically ordered and geometrically local, and some match or beat bivariate-bicycle benchmarks.
Symmetry-breaking de- coding for quantum LDPC codes
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
Degeneracy in quantum LDPC codes equals classical code shortening at the decoder, enabling impulse decoding that beats BP+OSD plus a residual-error follow-up step.
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.
Bivariate bicycle codes achieve an asymptotic threshold of approximately 0.488 on the quantum erasure channel with BP-OSD decoding, offering modest threshold edge and 12x lower overhead than toric codes under fair baselines.
citing papers explorer
-
Topological Codes from Space Groups: A Route beyond Translation Invariance
Space-group codes—CSS codes whose stabilizers use crystallographic point-group symmetries—can be topologically ordered and geometrically local, and some match or beat bivariate-bicycle benchmarks.
-
Impulse Decoding of Quantum LDPC Codes: Equivalence of Degeneracy and Code-Shortening
Degeneracy in quantum LDPC codes equals classical code shortening at the decoder, enabling impulse decoding that beats BP+OSD plus a residual-error follow-up step.
-
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.
-
Fair Decoder Baselines and Rigorous Finite-Size Scaling for Bivariate Bicycle Codes on the Quantum Erasure Channel
Bivariate bicycle codes achieve an asymptotic threshold of approximately 0.488 on the quantum erasure channel with BP-OSD decoding, offering modest threshold edge and 12x lower overhead than toric codes under fair baselines.