Union-find decoder for surface code achieves finite threshold under circuit-level stochastic errors with quasi-polylog parallel runtime bound.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
fields
quant-ph 4verdicts
UNVERDICTED 4representative citing papers
An FPGA-accelerated GNN decoder for surface-code quantum error correction delivers sub-1us latency and lower error rates than state-of-the-art approaches for code distances up to 7.
Soft decoding with analog measurement data raises repetition-code thresholds by 25% and reduces error rates up to 30x on superconducting qubits, with one byte per shot sufficient for near-optimal performance.
A two-level decoder scheduling framework reduces classical processing requirements for quantum error correction by 10-40% on fault-tolerant benchmarks by managing bursty workloads as shared resources.
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.
-
Low Latency GNN Accelerator for Quantum Error Correction
An FPGA-accelerated GNN decoder for surface-code quantum error correction delivers sub-1us latency and lower error rates than state-of-the-art approaches for code distances up to 7.
-
Soft information decoding with superconducting qubits
Soft decoding with analog measurement data raises repetition-code thresholds by 25% and reduces error rates up to 30x on superconducting qubits, with one byte per shot sufficient for near-optimal performance.
-
Managing Classical Processing Requirements for Quantum Error Correction
A two-level decoder scheduling framework reduces classical processing requirements for quantum error correction by 10-40% on fault-tolerant benchmarks by managing bursty workloads as shared resources.