Paperlane

no. 15 · Monday 16 November 2026

Beyond Blossom: Accelerating MWPM Decoding for Surface Codes With Local Predecoding and Architecture-Aware Optimizations

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

math.IT · 11 pp

Abstract

Minimum-weight perfect matching (MWPM) is widely used to decode surface codes, but its computational cost increases with code distance. We present Beyond Blossom, a state-of-the-art CPU-based MWPM decoder for surface codes. It combines algorithmic optimization through local predecoding, architecture-aware optimization, and pipeline-wide parallelism to reduce matching workload and execution overhead while preserving MWPM optimality. Across rotated surface codes with distances 9-33 and circuit-level physical error rates of 0.05%-0.3%, on a single CPU core, Beyond Blossom achieves a 4.23$\times$ geometric-mean speedup and up to 5.58$\times$ speedup over Sparse Blossom in PyMatching. At distance 33 and a physical error rate of 0.1%, with 8 CPU cores, decoding a block of 33 measurement rounds takes 21.40 $μ$s on average, equivalent to 0.65 $μ$s per round.

comments
11 pages, 8 figures
fields
Information Theory
pdf ↗ page arXiv:2611.18476 ↗