Reproduce “Belief Propagation-Informed Tesseract Decoding of Quantum LDPC Codes” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Sana Javed, Francisco Garcia-Herrero, Bane Vasić, Mark F. Flanagan
The authors present a decoder using belief propagation (BP) to guide a search initialized with error events. If BP’s guess matches detector parities, it is returned; otherwise, signed residual search can revise it. For the [[144, 12, 12]] code at p=0.003, it averages 10.4 expanded nodes per shot versus 1,043 for Tesseract, with similar logical error rates; node counts do not establish lower runtime.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.