Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Conference on Quantum Computing and Engineering (QCE)

Quantifying the Gap Between FPGA and ASIC Implementations of a Surface Code Decoder

Junichiro Kadomoto, Werner Florian, Prasoon Ambalathankandy, Jan-Erik R. Wichmann, Kentaro Sano

Published Aug 30, 2025• 0 citations
Publisher

Abstract

Achieving fault tolerance in quantum computing demands sophisticated control systems, and their development is advancing rapidly. To keep pace with fast-moving qubit technology, these systems are typically prototyped on field-programmable gate arrays (FPGAs)-reconfigurable devices that can adapt to a wide range of qubit counts and connectivity patterns, as well as to various error-correction codes. Nevertheless, application-specific integrated circuits (ASICs)-despite being fixed after fabrication and incurring substantial non-recurring engineering costs-ultimately offer higher performance. This paper presents a case study of the error decoder, a core control system component, and quantitatively compares its FPGA and ASIC implementations. The results offer guidance for future control system design.

DOI
10.1109/qce65121.2025.10488

Related papers

Hierarchical Decoding for Quantum Error Correction

Xulong Tang, Narges Alavisamani, Joan Camps +18 more

Fault-tolerant quantum computing requires classical decoders that can keep up with syndrome data streams and supply correction information and logical measurement outcomes to the quantum control system. Meeting these requirements at scale requires high throughput while controlling the end-to-end latency from readout to usable correction. In this paper, we organize decoding algorithms, execution strategies, and code constructions using common classifications and examine their performance and trade-offs under the reported evaluation conditions. We distinguish decoder-level hierarchy, where multiple decoding stages or resources cooperate to decode a single code, from code-level hierarchy, where the code construction itself introduces multiple decoding levels. We first review single-code hierarchical decoders and their cascaded predecoding and windowed, streaming, and distributed implementations. We then study hierarchical and concatenated codes, focusing on how decoding is coordinated across code levels through hard decisions, soft reliability information, or syndrome information. We also examine how qubit modalities shape decoding workloads and timing requirements, and review how different decoding platforms meet these requirements, including central processing units (CPUs), graphics processing units (GPUs), field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), and cryogenic platforms. By assessing design trade-offs, this paper clarifies connections across the literature and provides a shared foundation for QEC design exploration. It also identifies gaps in performance reporting and system integration to guide future research toward practical quantum error correction.

arXiv:2611.16271•Nov 12, 2026•0 citations

Real-time Surface-Code Error Correction Using an FPGA-based Neural-Network Decoder

Xiaohan Yang, Xuandong Sun, Zhiyi Wu +9 more

Quantum error correction (QEC) is essential for achieving low error rates required for fault-tolerant quantum computation. In stabilizer-based codes such as the surface code, errors are inferred from repeated syndrome measurements and corrected by a classical decoder. To prevent error accumulation, decoding must be performed with both high throughput and low latency to keep pace with the QEC cycle and enable real-time feedback for universal logical operations. Here we report a hardware-integrated control architecture featuring an FPGA-based neural-network (NN) decoder and experimentally demonstrate real-time surface-code (distance-3) QEC on a superconducting quantum processor. The system achieves a deterministic closed-loop latency of 550 ns, including 124 ns for NN decoding, enabling feedback corrections within a 1.25 us QEC cycle. We show that real-time decoding and feedback correction achieve logical performance comparable to offline decoding while maintaining robustness against varying error conditions. We further demonstrate mid-circuit feedback correction in non-Clifford logical circuits, where Pauli-frame updating alone becomes insufficient. Our results establish a low-latency hardware architecture for embedded QEC control and provide a pathway towards scalable fault-tolerant quantum computing systems.

quant-pharXiv:2605.04892•May 7, 2026•8 citations

Neural-Network Decoders for Quantum Error Correction Using Surface Codes: A Space Exploration of the Hardware Cost-Performance Tradeoffs

Ramon W. J. Overwater, Masoud Babaie, Fabio Sebastiano

Quantum Error Correction (QEC) is required in quantum computers to mitigate the effect of errors on physical qubits. When adopting a QEC scheme based on surface codes, error decoding is the most computationally expensive task in the classical electronic back-end. Decoders employing neural networks (NN) are well-suited for this task but their hardware implementation has not been presented yet. This work presents a space exploration of fully-connected feed-forward NN decoders for small distance surface codes. The goal is to optimize the neural network for high decoding performance, while keeping a minimalistic hardware implementation. This is needed to meet the tight delay constraints of real-time surface code decoding. We demonstrate that hardware based NN-decoders can achieve high decoding performance comparable to other state-of-the-art decoding algorithms whilst being well below the tight delay requirements (440 ns) of current solid-state qubit technologies for both ASIC designs (<30 ns) and FPGA implementations (<90 ns). These results indicate that NN-decoders are viable candidates for further exploration of an integrated hardware implementation in future large-scale quantum computers.

arXiv:2202.05741•IEEE Transactions on Quantum Engineering•Jan 1, 2022•87 citations

Beyond Qubit Count: A Comparative Review of Quantum Chip Architectures, Error Correction, and the Path to Fault-Tolerant Computing

Mr. Sairaj Dalvi, Mr. Suyog Salvi, Mr. Tanmay Patil +1 more

Quantum processors are often compared by the number of physical qubits they contain. That number, however, does not by itself indicate whether a processor can execute a useful computation reliably. Qubit coherence, gate and measurement fidelity, connectivity, control infrastructure, fabrication yield, and the overhead of quantum error correction all influence practical capability. This paper presents a structured comparative review of six major quantum-computing modalities: superconducting circuits, trapped ions, photonic systems, silicon-spin qubits, neutral atoms, and topological approaches. It examines their physical implementations, operational strengths, engineering constraints, and prospects for scaling. Particular attention is given to surface-code error correction and the 105-qubit Willow processor result reported by Google Quantum AI, which demonstrated below-threshold surface-code memory and a logical-error suppression factor of 2.14 ± 0.02 when code distance increased by two. The paper also considers cryogenic control, wiring, modular interconnects, fabrication variability, real-time decoding, and the Indian National Quantum Mission. The review finds that progress towards fault tolerance is best assessed through logical performance and system-level engineering rather than physical-qubit count alone. No modality currently removes the need to address scaling overhead, reliable operations, and application-level advantage

International Journal for Research in Applied Science and Engineering Technology•Nov 11, 2026•0 citations

Local clustering decoder as a fast and adaptive hardware decoder for the surface code

Abbas B. Ziad, Ankit Zalawadiya, Canberk Topal +4 more

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 μs 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. A key component of quantum error correction is the decoding algorithm, which needs to be accurate but also with a computational overhead that doesn’t lead to backlogs and allows fast logical clock rates. Here, the authors show an FPGA-driven decoder featuring a coarse-grained parallel architecture and on-the-fly error model updates, allowing both high accuracy and real-time operation.

arXiv:2411.10343•Nature Communications•Dec 17, 2025•35 citations

A Highly Efficient QEC Decoder Implemented on FPGA and ASIC

Kenton M. Barnes, Tomasz Bialas, Okan Buğdaycı +9 more

To make quantum computers useful and run applications featuring trillions of reliable logical operations, error correction will be required. One of the key components to enable error correction is a decoder that can identify errors which accumulate during the execution of a quantum circuit. The requirements for a decoder are that it accurately detects errors, executes quickly enough as to not create a backlog, and has low power usage so it can scale to millions of qubits and be more easily co-located with the wider qubit control apparatus. In this paper we present a decoder which for a distance 23 rotated planar surface code with 0.1% circuit-level depolarising noise executes in 240ns per round, has a threshold of 0.78%, occupies 0.06mm2 on a CMOS based silicon chip, and consumes less than 8mW of power.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•2 citations
Achieving fault tolerance in quantum computing demands sophisticated control systems, and their development is advancing rapidly. To keep pace with fast-moving qubit technology, these systems are typically prototyped on field-programmable gate arrays (FPGAs)-reconfigurable devices that can adapt to a wide range of qubit counts and connectivity patterns, as well as to various error-correction codes. Nevertheless, application-specific integrated circuits (ASICs)-despite being fixed after fabrication and incurring substantial non-recurring engineering costs-ultimately offer higher performance. This paper presents a case study of the error decoder, a core control system component, and quantitatively compares its FPGA and ASIC implementations. The results offer guidance for future control system design.
Fault-tolerant quantum computing requires classical decoders that can keep up with syndrome data streams and supply correction information and logical measurement outcomes to the quantum control system. Meeting these requirements at scale requires high throughput while controlling the end-to-end latency from readout to usable correction. In this paper, we organize decoding algorithms, execution strategies, and code constructions using common classifications and examine their performance and trade-offs under the reported evaluation conditions. We distinguish decoder-level hierarchy, where multiple decoding stages or resources cooperate to decode a single code, from code-level hierarchy, where the code construction itself introduces multiple decoding levels. We first review single-code hierarchical decoders and their cascaded predecoding and windowed, streaming, and distributed implementations. We then study hierarchical and concatenated codes, focusing on how decoding is coordinated across code levels through hard decisions, soft reliability information, or syndrome information. We also examine how qubit modalities shape decoding workloads and timing requirements, and review how different decoding platforms meet these requirements, including central processing units (CPUs), graphics processing units (GPUs), field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), and cryogenic platforms. By assessing design trade-offs, this paper clarifies connections across the literature and provides a shared foundation for QEC design exploration. It also identifies gaps in performance reporting and system integration to guide future research toward practical quantum error correction.
Quantum error correction (QEC) is essential for achieving low error rates required for fault-tolerant quantum computation. In stabilizer-based codes such as the surface code, errors are inferred from repeated syndrome measurements and corrected by a classical decoder. To prevent error accumulation, decoding must be performed with both high throughput and low latency to keep pace with the QEC cycle and enable real-time feedback for universal logical operations. Here we report a hardware-integrated control architecture featuring an FPGA-based neural-network (NN) decoder and experimentally demonstrate real-time surface-code (distance-3) QEC on a superconducting quantum processor. The system achieves a deterministic closed-loop latency of 550 ns, including 124 ns for NN decoding, enabling feedback corrections within a 1.25 us QEC cycle. We show that real-time decoding and feedback correction achieve logical performance comparable to offline decoding while maintaining robustness against varying error conditions. We further demonstrate mid-circuit feedback correction in non-Clifford logical circuits, where Pauli-frame updating alone becomes insufficient. Our results establish a low-latency hardware architecture for embedded QEC control and provide a pathway towards scalable fault-tolerant quantum computing systems.
Quantum Error Correction (QEC) is required in quantum computers to mitigate the effect of errors on physical qubits. When adopting a QEC scheme based on surface codes, error decoding is the most computationally expensive task in the classical electronic back-end. Decoders employing neural networks (NN) are well-suited for this task but their hardware implementation has not been presented yet. This work presents a space exploration of fully-connected feed-forward NN decoders for small distance surface codes. The goal is to optimize the neural network for high decoding performance, while keeping a minimalistic hardware implementation. This is needed to meet the tight delay constraints of real-time surface code decoding. We demonstrate that hardware based NN-decoders can achieve high decoding performance comparable to other state-of-the-art decoding algorithms whilst being well below the tight delay requirements (440 ns) of current solid-state qubit technologies for both ASIC designs (<30 ns) and FPGA implementations (<90 ns). These results indicate that NN-decoders are viable candidates for further exploration of an integrated hardware implementation in future large-scale quantum computers.
Quantum processors are often compared by the number of physical qubits they contain. That number, however, does not by itself indicate whether a processor can execute a useful computation reliably. Qubit coherence, gate and measurement fidelity, connectivity, control infrastructure, fabrication yield, and the overhead of quantum error correction all influence practical capability. This paper presents a structured comparative review of six major quantum-computing modalities: superconducting circuits, trapped ions, photonic systems, silicon-spin qubits, neutral atoms, and topological approaches. It examines their physical implementations, operational strengths, engineering constraints, and prospects for scaling. Particular attention is given to surface-code error correction and the 105-qubit Willow processor result reported by Google Quantum AI, which demonstrated below-threshold surface-code memory and a logical-error suppression factor of 2.14 ± 0.02 when code distance increased by two. The paper also considers cryogenic control, wiring, modular interconnects, fabrication variability, real-time decoding, and the Indian National Quantum Mission. The review finds that progress towards fault tolerance is best assessed through logical performance and system-level engineering rather than physical-qubit count alone. No modality currently removes the need to address scaling overhead, reliable operations, and application-level advantage
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 μs 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. A key component of quantum error correction is the decoding algorithm, which needs to be accurate but also with a computational overhead that doesn’t lead to backlogs and allows fast logical clock rates. Here, the authors show an FPGA-driven decoder featuring a coarse-grained parallel architecture and on-the-fly error model updates, allowing both high accuracy and real-time operation.
To make quantum computers useful and run applications featuring trillions of reliable logical operations, error correction will be required. One of the key components to enable error correction is a decoder that can identify errors which accumulate during the execution of a quantum circuit. The requirements for a decoder are that it accurately detects errors, executes quickly enough as to not create a backlog, and has low power usage so it can scale to millions of qubits and be more easily co-located with the wider qubit control apparatus. In this paper we present a decoder which for a distance 23 rotated planar surface code with 0.1% circuit-level depolarising noise executes in 240ns per round, has a threshold of 0.78%, occupies 0.06mm2 on a CMOS based silicon chip, and consumes less than 8mW of power.