Belief Propagation Convergence Prediction for Bivariate Bicycle Quantum Error Correction Codes
Anton Pakhunov

TL;DR
This paper introduces a simple modulo-based method to predict whether belief propagation will converge when decoding certain quantum error correction codes, significantly improving decoding efficiency.
Contribution
The authors demonstrate that a single modulo operation on syndrome defect counts can accurately predict BP convergence, a novel approach for quantum LDPC code decoding.
Findings
Modulo w predicts BP convergence with high accuracy (AUC=0.995) at low error rates.
BP failures are mostly due to measurement errors outside the model space, confirmed by error cluster analysis.
Prediction method is invariant across different BP scheduling strategies and decoder variants.
Abstract
Decoding Bivariate Bicycle (BB) quantum error correction codes typically requires Belief Propagation (BP) followed by Ordered Statistics Decoding (OSD) post-processing when BP fails to converge. Whether BP will converge on a given syndrome is currently determined only after running BP to completion. We show that convergence can be predicted in advance by a single modulo operation: if the syndrome defect count is divisible by the code's column weight w, BP converges with high probability (100% at p <= 0.001, degrading to 87% at p = 0.01); otherwise, BP fails with probability >= 90%. The mechanism is structural: each physical data error activates exactly w stabilizers, so a defect count not divisible by w implies the presence of measurement errors outside BP's model space. Validated on five BB codes with column weights w = 2, 3, and 4, mod-w achieves AUC = 0.995 as a convergence…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
