REVIEW 3 cited by
A Scalable, Fast and Programmable Neural Decoder for Fault-Tolerant Quantum Computation Using Surface Codes
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Quantum error-correcting codes (QECCs) can eliminate the negative effects of quantum noise, the major obstacle to the execution of quantum algorithms. However, realizing practical quantum error correction (QEC) requires resolving many challenges to implement a high-performance real-time decoding system. Many decoding algorithms have been proposed and optimized in the past few decades, of which neural network (NNs) based solutions have drawn an increasing amount of attention due to their high efficiency. Unfortunately, previous works on neural decoders are still at an early stage and have only relatively simple architectures, which makes them unsuitable for practical QEC. In this work, we propose a scalable, fast, and programmable neural decoding system to meet the requirements of FTQEC for rotated surface codes (RSC). Firstly, we propose a hardware-efficient NN decoding algorithm with relatively low complexity and high accuracy. Secondly, we develop a customized hardware decoder with architectural optimizations to reduce latency. Thirdly, our proposed programmable architecture boosts the scalability and flexibility of the decoder by maximizing parallelism. Fourthly, we build an FPGA-based decoding system with integrated control hardware for evaluation. Our $L=5$ ($L$ is the code distance) decoder achieves an extremely low decoding latency of 197 ns, and the $L=7$ configuration also requires only 1.136 $\mu$s, both taking $2L$ rounds of syndrome measurements. The accuracy results of our system are close to minimum weight perfect matching (MWPM). Furthermore, our programmable architecture reduces hardware resource consumption by up to $3.0\times$ with only a small latency loss. We validated our approach in real-world scenarios by conducting a proof-of-concept benchmark with practical noise models, including one derived from experimental data gathered from physical hardware.
Forward citations
Cited by 3 Pith papers
-
Enhancing Fault-Tolerant Surface Code Decoding with Iterative Lattice Reweighting
An iterative reweighting decoder for surface codes uses X-Z error correlations from circuit-level noise, improving logical error rates and raising the threshold from about 1% to 1.16%.
-
Learning Neural Decoding with Parallelism and Self-Coordination for Quantum Error Correction
A transformer-based decoder trained on local window labels learns to output per-window logical corrections that can be XORed across sliding windows, enabling parallel decoding with accuracy slightly above belief match...
-
Fully convolutional 3D neural network decoders for surface codes with syndrome circuit noise
A 3D convolutional neural network decoder for surface codes with circuit noise generalizes to distance-97 codes with thresholds up to 0.7% depolarizing noise and improved latency over MWPM above distance 33.
Discussion (0). Sign in to comment.