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.
A low-complexity BP-OSD algorithm for quantum LDPC codes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
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.