Union-find decoder for surface code achieves finite threshold under circuit-level stochastic errors with quasi-polylog parallel runtime bound.
Fusion Blossom: Fast MWPM Decoders for QEC
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
abstract
The Minimum-Weight Perfect Matching (MWPM) decoder is widely used in Quantum Error Correction (QEC) decoding. Despite its high accuracy, existing implementations of the MWPM decoder cannot catch up with quantum hardware, e.g., 1 million measurements per second for superconducting qubits. They suffer from a backlog of measurements that grows exponentially and as a result, cannot realize the power of quantum computation. We design and implement a fast MWPM decoder, called Parity Blossom, which reaches a time complexity almost proportional to the number of defect measurements. We further design and implement a parallel version of Parity Blossom called Fusion Blossom. Given a practical circuit-level noise of 0.1%, Fusion Blossom can decode a million measurement rounds per second up to a code distance of 33. Fusion Blossom also supports stream decoding mode that reaches a 0.7 ms decoding latency at code distance 21 regardless of the measurement rounds.
citation-role summary
background 1
citation-polarity summary
years
2026 5roles
background 1polarities
background 1representative citing papers
Plaquette compiles realistic quantum hardware noise models into multiple sampler representations, showing that Pauli-twirled approximations can misestimate logical error rates by an order of magnitude compared to leakage-aware and near-Clifford methods.
Presents a coset ensemble decoder with algorithm-hardware co-design that claims better accuracy-latency trade-off and lower FPGA resource use than MWPM and UF baselines under depolarizing noise.
A programmable 2D toric oscillator network enables efficient routing for bivariate bicycle LDPC codes, reducing long-range couplers to O(sqrt(n)) and achieving 3.06% logical error rate per cycle in simulations for the [[18,4,4]] code.
A pipelined framework with speculation for logical operations in fault-tolerant quantum computation reduces total pipeline steps by 20-40% on benchmarks by overlapping control, execution, and decoding stages.
citing papers explorer
-
Proof of a finite threshold for the union-find decoder
Union-find decoder for surface code achieves finite threshold under circuit-level stochastic errors with quasi-polylog parallel runtime bound.
-
Plaquette: A hardware-aware design platform for fault-tolerant quantum computers
Plaquette compiles realistic quantum hardware noise models into multiple sampler representations, showing that Pauli-twirled approximations can misestimate logical error rates by an order of magnitude compared to leakage-aware and near-Clifford methods.
-
Coset Ensemble Decoder for Quantum Error Correction with Algorithm-Hardware Co-Design
Presents a coset ensemble decoder with algorithm-hardware co-design that claims better accuracy-latency trade-off and lower FPGA resource use than MWPM and UF baselines under depolarizing noise.
-
Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures
A programmable 2D toric oscillator network enables efficient routing for bivariate bicycle LDPC codes, reducing long-range couplers to O(sqrt(n)) and achieving 3.06% logical error rate per cycle in simulations for the [[18,4,4]] code.
-
Stalls and Spequlation: Pipelined Execution for Fault Tolerant Quantum Computation
A pipelined framework with speculation for logical operations in fault-tolerant quantum computation reduces total pipeline steps by 20-40% on benchmarks by overlapping control, execution, and decoding stages.