Low Latency GNN Accelerator for Quantum Error Correction
- URL: http://arxiv.org/abs/2603.22149v1
- Date: Mon, 23 Mar 2026 16:14:52 GMT
- Title: Low Latency GNN Accelerator for Quantum Error Correction
- Abstract summary: We propose an FPGA accelerator for a Neural Network based decoder as a way to achieve a lower logical error rate.<n>We achieved this goal by applying different hardware-aware optimizations to a high-accuracy GNN-based decoder.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: Quantum computers have the potential to solve certain complex problems in a much more efficient way than classical computers. Nevertheless, current quantum computer implementations are limited by high physical error rates. This issue is addressed by Quantum Error Correction (QEC) codes, which use multiple physical qubits to form a logical qubit to achieve a lower logical error rate, with the surface code being one of the most commonly used. The most time-critical step in this process is interpreting the measurements of the physical qubits to determine which errors have most likely occurred - a task called decoding. Consequently, the main challenge for QEC is to achieve error correction with high accuracy within the tight $1μs$ decoding time budget imposed by superconducting qubits. State-of-the-art QEC approaches trade accuracy for latency. In this work, we propose an FPGA accelerator for a Neural Network based decoder as a way to achieve a lower logical error rate than current methods within the tight time constraint, for code distance up to d=7. We achieved this goal by applying different hardware-aware optimizations to a high-accuracy GNN-based decoder. In addition, we propose several accelerator optimizations leading to the FPGA-based decoder achieving a latency smaller than $1μs$, with a lower error rate compared to the state-of-the-art.
Related papers
- Scalable Neural Decoders for Practical Fault-Tolerant Quantum Computation [0.43553942673960666]
We introduce a convolutional neural network decoder that exploits the geometric structure of QEC codes.<n>We show that the logical error rates required for large-scale fault-tolerant algorithms are attainable with modest code sizes.<n>Results suggest that the space-time costs associated with fault-tolerant quantum computation may be significantly lower than previously anticipated.
arXiv Detail & Related papers (2026-04-09T15:21:41Z) - Local Clustering Decoder: a fast and adaptive hardware decoder for the surface code [0.0]
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.
It enables one million error-free quantum operations with 4x fewer physical qubits when compared to standard non-adaptive decoding.
arXiv Detail & Related papers (2024-11-15T16:43:59Z) - Accelerating Error Correction Code Transformers [56.75773430667148]
We introduce a novel acceleration method for transformer-based decoders.
We achieve a 90% compression ratio and reduce arithmetic operation energy consumption by at least 224 times on modern hardware.
arXiv Detail & Related papers (2024-10-08T11:07:55Z) - Demonstrating real-time and low-latency quantum error correction with superconducting qubits [52.08698178354922]
We demonstrate low-latency feedback with a scalable FPGA decoder integrated into a superconducting quantum processor.
We observe logical error suppression as the number of decoding rounds is increased.
The decoder throughput and latency developed in this work, combined with continued device improvements, unlock the next generation of experiments.
arXiv Detail & Related papers (2024-10-07T17:07:18Z) - A Scalable, Fast and Programmable Neural Decoder for Fault-Tolerant
Quantum Computation Using Surface Codes [12.687083899824314]
Quantum error-correcting codes (QECCs) can eliminate the negative effects of quantum noise, the major obstacle to the execution of quantum algorithms.
We propose a scalable, fast, and programmable neural decoding system to meet the requirements of FTQEC for rotated surface codes (RSC)
Our system achieves an extremely low decoding latency of 197 ns, and the accuracy results of our system are close to minimum weight perfect matching (MWPM)
arXiv Detail & Related papers (2023-05-25T06:23:32Z) - The END: An Equivariant Neural Decoder for Quantum Error Correction [73.4384623973809]
We introduce a data efficient neural decoder that exploits the symmetries of the problem.
We propose a novel equivariant architecture that achieves state of the art accuracy compared to previous neural decoders.
arXiv Detail & Related papers (2023-04-14T19:46:39Z) - Deep Quantum Error Correction [73.54643419792453]
Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing.
In this work, we efficiently train novel emphend-to-end deep quantum error decoders.
The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
arXiv Detail & Related papers (2023-01-27T08:16:26Z) - NEO-QEC: Neural Network Enhanced Online Superconducting Decoder for
Surface Codes [2.2749157557381245]
We propose an NN-based accurate, fast, and low-power decoder capable of decoding SCs and lattice surgery (LS) operations with measurement errors on ancillary qubits.
We evaluate the decoder performance by a quantum error simulator for the single logical qubit protection and the minimum operation of LS with code up to 13.
arXiv Detail & Related papers (2022-08-11T11:37:09Z) - Improved decoding of circuit noise and fragile boundaries of tailored
surface codes [61.411482146110984]
We introduce decoders that are both fast and accurate, and can be used with a wide class of quantum error correction codes.
Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC.
We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.
arXiv Detail & Related papers (2022-03-09T18:48:54Z) - Exponential suppression of bit or phase flip errors with repetitive
error correction [56.362599585843085]
State-of-the-art quantum platforms typically have physical error rates near $10-3$.
Quantum error correction (QEC) promises to bridge this divide by distributing quantum logical information across many physical qubits.
We implement 1D repetition codes embedded in a 2D grid of superconducting qubits which demonstrate exponential suppression of bit or phase-flip errors.
arXiv Detail & Related papers (2021-02-11T17:11:20Z) - Scalable Neural Decoder for Topological Surface Codes [0.0]
We present a neural network based decoder for a family of stabilizer codes subject to noise and syndrome measurement errors.
The key innovation is to autodecode error syndromes on small scales by shifting a preprocessing window over the underlying code.
We show that such a preprocessing step allows to effectively reduce the error rate by up to two orders of magnitude in practical applications.
arXiv Detail & Related papers (2021-01-18T19:02:09Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.