Preprint
Sep 2026
Sparse-Blossom Decoding in $o(1)$ Time
A rigorous parallelization framework is presented and it is proved that the resulting parallel sparse-blossom algorithm produces the same correction as the original, non-parallel sparse blossom.
Ryohei Mikami, Hayata Yamasaki
· 0 citations