Reproduce “Beyond Blossom: Accelerating MWPM Decoding for Surface Codes With Local Predecoding and Architecture-Aware Optimizations” 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

Jiayu Fu, Zirong Shen, Lin Gan, Yiming Zhang, Wenjing Han, Xiaoming Sun, Riling Li, Guangwen Yang

Beyond Blossom accelerates surface-code decoding by pre-matching nearby detection events in degree order with a dual-feasible pass, then sending remaining work to an exact minimum-weight perfect matching solver. Across 21 tested settings, it achieves a 4.23× geometric-mean speedup over PyMatching on one CPU core; matching weights agree, but averages do not show worst-case or feedback latency.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.