Local Clustering Decoder as a fast and adaptive hardware decoder for the surface code
arXiv:2411.10343 · doi:10.1038/s41467-025-66773-x
Abstract
To avoid prohibitive overheads in performing fault-tolerant quantum computation, the decoding problem needs to be solved accurately and at speeds sufficient for fast feedback. Existing decoding systems fail to satisfy both of these requirements, meaning they either slow down the quantum computer or reduce the number of operations that can be performed before the quantum information is corrupted. We introduce the Local Clustering Decoder as a solution that simultaneously achieves the accuracy and speed requirements of a real-time decoding system. Our decoder is implemented on FPGAs and exploits hardware parallelism to keep pace with the fastest qubit types. Further, it comprises an adaptivity engine that allows the decoder to update itself in real-time in response to control signals, such as heralded leakage events. Under a realistic circuit-level noise model where leakage is a dominant error source, our decoder enables one million error-free quantum operations with 4x fewer physical qubits when compared to standard non-adaptive decoding. This is achieved whilst decoding in under 1 us per round with modest FPGA resources, demonstrating that high-accuracy real-time decoding is possible, and reducing the qubit counts required for large-scale fault-tolerant quantum computation.
References in corpus (32)
- Topological quantum memory
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Quantum Error Correction for Quantum Memories
- Suppressing quantum errors by scaling a surface code logical qubit
- How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
- Surface code quantum computing by lattice surgery
- High-fidelity parallel entangling gates on a neutral atom quantum computer
- Exponential suppression of bit or phase flip errors with repetitive error correction
- A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
- Stim: a fast stabilizer circuit simulator
- Magic state distillation with low overhead
- Even more efficient quantum computations of chemistry through tensor hypercontraction
- Logical-qubit operations in an error-detecting surface code
- Removing leakage-induced correlated errors in superconducting quantum error correction
- Coping with qubit leakage in topological codes
- Overcoming leakage in scalable quantum error correction
- A Fault-Tolerant Honeycomb Memory
- Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics
- Neural-Network Decoders for Quantum Error Correction using Surface Codes:A Space Exploration of the Hardware Cost-Performance Trade-Offs
- Parallel window decoding enables scalable fault tolerant quantum computation
- Leakage detection for a transmon-based surface code
- Handling Leakage with Subsystem Codes
- Leakage mitigation for quantum error correction using a mixed qubit scheme
- FPGA-based Distributed Union-Find Decoder for Surface Codes
- Reducing the error rate of a superconducting logical qubit using analog readout information
- Error-corrected Hadamard gate simulated at the circuit level
- Optimizing quantum error correction protocols with erasure qubits
- Fault-tolerant quantum architectures based on erasure qubits
- ERASER: Towards Adaptive Leakage Suppression for Fault-Tolerant Quantum Computing
- Actis: A Strictly Local Union-Find Decoder
- Union-find quantum decoding without union-find
- LUCI in the Surface Code with Dropouts