2 papers
quant-ph2026
Sparse-Blossom Decoding in Time
Ryo Mikami, Hayata Yamasaki
Matching-based decoding is widely used in quantum error correction, and accelerating it is key to enabling fast and scalable fault-tolerant quantum computation. Minimum-weight perf…
quant-ph2026
Overflow-Safe Polylog-Time Parallel Minimum-Weight Perfect Matching Decoder: Toward Experimental Demonstration
Ryo Mikami, Hayata Yamasaki
Fault-tolerant quantum computation (FTQC) requires fast and accurate decoding of quantum errors, which is often formulated as a minimum-weight perfect matching (MWPM) problem. A de…