Open Source
Beyond Blossom: Accelerating MWPM Decoding for Surface Codes With Local Predecoding and Architecture-Aware Optimizations
arXiv math.IT0 views
arXiv:2611.18476v1 Announce Type: new 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 $\mu$s on average, equivalent to 0.65 $\mu$s per round.
Source:https://arxiv.org/abs/2611.18476PreviousNew Results on the Subfield MetricNextPF-Exec: Large-Scale UAV Relay Load Balancing with an Anchored Potential Direction Decider and a Per-Dimension Gain-Learning Executor
Related posts
What Should World Models Forget? Stratified Retention for Continual Adaptation
0arXiv eess.SP
uhd-rfsoc: Bringing Off-the-Shelf RFSoC Boards to Unmodified UHD Applications
0arXiv eess.SP
An Axiomatic Framework for Reinforcement Learning in Open Multi-Agent Systems
0arXiv cs.MA
From Facts to Insights: A Persona-Driven Dual Memory Framework and Dataset for Role-Playing Agents
0arXiv cs.MA
A Taxonomy of Real Faults in Hybrid Quantum-Classical Architectures
0arXiv cs.SE
SyclKittens: A Tile Programming Model for Programmers and Coding Agents on Intel GPUs
0arXiv cs.DC