跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.18476 · v1

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

超越 Blossom:用局部预解码与架构感知优化加速表面码的 MWPM 解码

首次提交 2026-11-14 01:49
版本更新 2026-11-14 01:49
雷达观测 2026-11-16 13:44
arXiv ↗PDF ↗

摘要

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.

作者备注:11 pages, 8 figures

AI 论文解读

基于摘要 · 非全文审阅

Beyond Blossom 是一个基于 CPU 的 MWPM 表面码解码器,它通过局部预解码、架构感知优化和流水线并行,在保持 MWPM 最优性的同时降低匹配工作量与执行开销。

正在读取账号与研究记录…

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-14 01:49 · 最新观测版本

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

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.

查看此版本解读 →查看此版本原文 ↗