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

EPJ Quantum Technology

Exploring the FPGA and ASIC design space of belief propagation and ordered statistics decoders for quantum error correction codes

Daniel Báscones, Francisco García-Herrero, Javier Valls

Published Nov 20, 2025• 2 citations
Publisher

Abstract

Belief propagation (BP) combined with ordered statistics decoding (OSD) provides a good balance between accuracy and complexity for many quantum error correction (QEC) codes, making it nearly universal. However, the complexity of OSD can limit real-time decoding, particularly for superconducting qubits, and the limits of classical hardware decoders have not been fully explored. Therefore, it is important to assess the architecture of OSD for different code families, such as surface codes and bicycle bivariate codes, under realistic assumptions like the detector error model. This paper introduces a BP + OSD parallel architecture implemented on FPGA and ASIC for surface codes (distances 3–21) and bicycle bivariate codes (distances 6–24). Results show that for surface codes up to distance 9, the OSD post-processor fits into a single VCU129 FPGA, achieving a frequency of 200 MHz with a worst-case latency of 134 μ s. For bicycle bivariate codes, the limit is distance 12, with a frequency of 244 MHz and a worst-case latency of 84 μ s. In ASIC, with 45 nm technology, latency improves by 31%, but area resources grow significantly, making parallel implementation beyond distance 12 impractical on a single chip. The designs were verified using a hardware emulator, ensuring that the decoder’s behavior matches software simulations and revealing interesting results like potential error floors at low logical error rates.

DOI
10.1140/epjqt/s40507-025-00446-y

Related papers

Diversity Methods for Improving Convergence and Accuracy of Quantum Error Correction Decoders Through Hardware Emulation

Francisco García-Herrero, Javier Valls, Llanos Vergara-Picazo +1 more

As quantum computing moves toward fault-tolerant architectures, quantum error correction (QEC) decoder performance is increasingly critical for scalability. Understanding the impact of transitioning from floating-point software to finite-precision hardware is essential, as hardware decoder performance affects code distance, qubit requirements, and connectivity between quantum and classical control units. This paper introduces a hardware emulator to evaluate QEC decoders using real hardware instead of software models. The emulator can explore 10 13 different error patterns in 20 days with a single FPGA device running at 150 MHz, guaranteeing the decoder's performance at logical rates of 10 − 12 , the requirement for most quantum algorithms. In contrast, an optimized C++ software on an Intel Core i9 with 128 GB RAM would take over a year to achieve similar results. The emulator also enables the storage of uncorrectable error patterns that generate logical errors, allowing for offline analysis and the design of new decoders. Using results from the emulator, we propose a method that combines several belief propagation (BP) decoders with different quantization levels, which we define as a diversity-based decoder. Individually, these decoders may show subpar error correction, but together they outperform the floating-point version of BP for quantum low-density parity-check (QLDPC) codes like hypergraph or lifted product. Preliminary results with circuit-level noise and bivariate bicycle codes suggest that hardware insights can also improve software. Our diversity-based proposal achieves a similar logical error rate as the well-known approach, BP with ordered statistics (BP+OSD) decoding, with average speed improvements ranging from 30% to 80%, and 10% to 120% in worst-case scenarios, while reducing post-processing algorithm activation from 47% to 96.93%, maintaining the same accuracy.

arXiv:2504.01164•Quantum•Apr 16, 2026•5 citations

Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD

Ming Wang, Ang Li, Frank Mueller

This work presents a hardware-efficient and fully parallelizable decoder for quantum LDPC codes that leverages belief propagation (BP) with a speculative post-processing strategy inspired by classical Chase decoding algorithm. By monitoring bit-level oscillation patterns during BP, our method identifies unreliable bits and generates multiple candidate vectors to selectively flip syndromes. Each modified syndrome is then decoded independently using short-depth BP, a process we refer to as BP-SF (syndrome flip). This design eliminates the need for costly Gaussian elimination used in the current BP-OSD approaches. Our implementation achieves logical error rates comparable to or better than BP-OSD while offering significantly lower latency due to its high degree of parallelism for a variety of bivariate bicycle codes. Evaluation on the$\llbracket 144,12,12 \rrbracket$bivariate bicycle code shows that the proposed decoder reduces average latency to approximately 70% of BP-OSD. When post-processing is parallelized the average latency is reduced by 55% compared to the single process implementation, with the maximum latency reaching as low as 18%. These advantages make it particularly well-suited for real-time and resource-constrained quantum error correction systems.

arXiv:2507.00254•IEEE International Symposium on High-Performance Computer Architecture (HPCA)•Jan 31, 2026•12 citations

Evolutionary BP+OSD Decoding for Low-Latency Quantum Error Correction

Hee-Youl Kwak, Seong-Joon Park, Hyunwoo Jung +2 more

Quantum error correction (QEC) for fault-tolerant quantum computing requires a balanced decoding solution that offers high performance, low complexity, and low latency. However, the de facto standard - belief propagation (BP) combined with ordered statistics decoding (OSD) - suffers from excessive iterations in the BP stage and high complexity in the OSD stage. To address these challenges, we propose an evolutionary BP (EBP) decoder optimized via a differential evolution (DE) algorithm. By leveraging the gradient-free nature of DE, we enable end-to-end optimization of the EBP+OSD structure to maximize overall performance. In addition, a multi-objective selection rule is introduced to suppress frequent OSD activation, significantly reducing complexity overhead. Simulation results on surface codes and quantum low-density parity-check (QLDPC) codes demonstrate that EBP+OSD simultaneously achieves both superior decoding performance and substantially lower complexity compared to conventional BP+OSD, particularly in stringent low-latency regimes.

quant-pharXiv:2512.18273•IEEE Journal on Selected Areas in Communications•Dec 23, 2025•2 citations

Real-time BP decoding of a high-rate QEC code

Andreas Kell, Daniel Herr, Daniel Bascones García +4 more

We present a real-time FPGA decoder for a high-rate $[[512,174,8]]$ 3D product qLDPC code. We construct a circuit-level detector-error model for a compact syndrome-extraction schedule and propose a small parallel ensemble of row-wise serial min-sum decoders with cumulative memory. The decoder matches $\text{BP+OSD-CS}_\text{10}$ accuracy with one core and Relay-BP accuracy with three cores. The FPGA implementation meets the latency budget of neutral-atom and trapped-ion systems. An ASIC implementation would improve the latency, enabling real time decoding even for superconducting systems. At a physical error rate of $p=10^{-3}$, three FPGA devices decode 174 logical qubits with a logical error rate of $5\times10^{-7}$ and effective distance 6. For $p=10^{-4}$, and assuming the number of BP iterations is capped to 30, the decoder's average latency is $5.1\,$\textmu s and its worst-case latency is $97.9\,$\textmu s.

quant-pharXiv:2610.41413•Nov 2, 2026•1 citation

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 Belief Propagation and Ordered Statistics Decoding for Quantum Error Correction Codes

Gong, Christina Susan

In the quest for fault-tolerant quantum computation, the delicate nature of qubits demands the need for robust quantum error correction. Quantum error correcting codes, the quantum counterpart to classical error correcting codes in information theory, have been developed to address the unique challenges quantum bits face against the noise of their environment in storing information. These codes include but are not limited to the Kitaev surface code, toric code, rotated surface code, generalized bicycle code, and bivariate bicycle code. Fast and reliable decoders for these quantum error correcting codes are needed to correct errors and achieve fault tolerance on these qubits. The belief propagation algorithm, which is a efficient and reliable heuristic for decoding classical low-density parity check codes, has been generalized to different types of quantum error correction codes. Paired with the ordered statistics decoding algorithm as a post-processing step from the soft outputs of the belief propagation decoder, belief propagation and ordered statistics decoding has been one of the most promising avenues of efficient quantum error correction. This thesis combines the state-of-the-art belief propagation and ordered statistics decoding algorithms with the exploration of the neural belief propagation algorithm to leverage classical deep learning machines to learn message passing patterns in decoding the newest quantum codes, the rotated surface code and bivariate bicycle code. The neural network exploits the local lattice structure of these codes to adjust the trainable weights and biases to more learn message update patterns more efficiently than the vanilla belief propagation algorithm. In this thesis, we prove a new threshold for the physical error rate on the rotated surface code using a neural belief propagation algorithm and ordered statistics decoding that consistently outperforms the threshold established by the vanilla belief propagation algorithm with ordered statistics decoding. We additionally show the results for similar efforts on the bivariate bicycle codes, and discuss the difficulties in achieving a threshold using the current neural belief propagation algorithms.

•Jan 1, 2025•0 citations
Belief propagation (BP) combined with ordered statistics decoding (OSD) provides a good balance between accuracy and complexity for many quantum error correction (QEC) codes, making it nearly universal. However, the complexity of OSD can limit real-time decoding, particularly for superconducting qubits, and the limits of classical hardware decoders have not been fully explored. Therefore, it is important to assess the architecture of OSD for different code families, such as surface codes and bicycle bivariate codes, under realistic assumptions like the detector error model. This paper introduces a BP + OSD parallel architecture implemented on FPGA and ASIC for surface codes (distances 3–21) and bicycle bivariate codes (distances 6–24). Results show that for surface codes up to distance 9, the OSD post-processor fits into a single VCU129 FPGA, achieving a frequency of 200 MHz with a worst-case latency of 134 μ s. For bicycle bivariate codes, the limit is distance 12, with a frequency of 244 MHz and a worst-case latency of 84 μ s. In ASIC, with 45 nm technology, latency improves by 31%, but area resources grow significantly, making parallel implementation beyond distance 12 impractical on a single chip. The designs were verified using a hardware emulator, ensuring that the decoder’s behavior matches software simulations and revealing interesting results like potential error floors at low logical error rates.
As quantum computing moves toward fault-tolerant architectures, quantum error correction (QEC) decoder performance is increasingly critical for scalability. Understanding the impact of transitioning from floating-point software to finite-precision hardware is essential, as hardware decoder performance affects code distance, qubit requirements, and connectivity between quantum and classical control units. This paper introduces a hardware emulator to evaluate QEC decoders using real hardware instead of software models. The emulator can explore 10 13 different error patterns in 20 days with a single FPGA device running at 150 MHz, guaranteeing the decoder's performance at logical rates of 10 − 12 , the requirement for most quantum algorithms. In contrast, an optimized C++ software on an Intel Core i9 with 128 GB RAM would take over a year to achieve similar results. The emulator also enables the storage of uncorrectable error patterns that generate logical errors, allowing for offline analysis and the design of new decoders. Using results from the emulator, we propose a method that combines several belief propagation (BP) decoders with different quantization levels, which we define as a diversity-based decoder. Individually, these decoders may show subpar error correction, but together they outperform the floating-point version of BP for quantum low-density parity-check (QLDPC) codes like hypergraph or lifted product. Preliminary results with circuit-level noise and bivariate bicycle codes suggest that hardware insights can also improve software. Our diversity-based proposal achieves a similar logical error rate as the well-known approach, BP with ordered statistics (BP+OSD) decoding, with average speed improvements ranging from 30% to 80%, and 10% to 120% in worst-case scenarios, while reducing post-processing algorithm activation from 47% to 96.93%, maintaining the same accuracy.
This work presents a hardware-efficient and fully parallelizable decoder for quantum LDPC codes that leverages belief propagation (BP) with a speculative post-processing strategy inspired by classical Chase decoding algorithm. By monitoring bit-level oscillation patterns during BP, our method identifies unreliable bits and generates multiple candidate vectors to selectively flip syndromes. Each modified syndrome is then decoded independently using short-depth BP, a process we refer to as BP-SF (syndrome flip). This design eliminates the need for costly Gaussian elimination used in the current BP-OSD approaches. Our implementation achieves logical error rates comparable to or better than BP-OSD while offering significantly lower latency due to its high degree of parallelism for a variety of bivariate bicycle codes. Evaluation on the⟦144,12,12⟧\llbracket 144,12,12 \rrbracket[[144,12,12]]bivariate bicycle code shows that the proposed decoder reduces average latency to approximately 70% of BP-OSD. When post-processing is parallelized the average latency is reduced by 55% compared to the single process implementation, with the maximum latency reaching as low as 18%. These advantages make it particularly well-suited for real-time and resource-constrained quantum error correction systems.
Quantum error correction (QEC) for fault-tolerant quantum computing requires a balanced decoding solution that offers high performance, low complexity, and low latency. However, the de facto standard - belief propagation (BP) combined with ordered statistics decoding (OSD) - suffers from excessive iterations in the BP stage and high complexity in the OSD stage. To address these challenges, we propose an evolutionary BP (EBP) decoder optimized via a differential evolution (DE) algorithm. By leveraging the gradient-free nature of DE, we enable end-to-end optimization of the EBP+OSD structure to maximize overall performance. In addition, a multi-objective selection rule is introduced to suppress frequent OSD activation, significantly reducing complexity overhead. Simulation results on surface codes and quantum low-density parity-check (QLDPC) codes demonstrate that EBP+OSD simultaneously achieves both superior decoding performance and substantially lower complexity compared to conventional BP+OSD, particularly in stringent low-latency regimes.
We present a real-time FPGA decoder for a high-rate [[512,174,8]][[512,174,8]][[512,174,8]] 3D product qLDPC code. We construct a circuit-level detector-error model for a compact syndrome-extraction schedule and propose a small parallel ensemble of row-wise serial min-sum decoders with cumulative memory. The decoder matches BP+OSD-CS10\text{BP+OSD-CS}_\text{10}BP+OSD-CS10​ accuracy with one core and Relay-BP accuracy with three cores. The FPGA implementation meets the latency budget of neutral-atom and trapped-ion systems. An ASIC implementation would improve the latency, enabling real time decoding even for superconducting systems. At a physical error rate of p=10−3p=10^{-3}p=10−3, three FPGA devices decode 174 logical qubits with a logical error rate of 5×10−75\times10^{-7}5×10−7 and effective distance 6. For p=10−4p=10^{-4}p=10−4, and assuming the number of BP iterations is capped to 30, the decoder's average latency is 5.1 5.1\,5.1\textmu s and its worst-case latency is 97.9 97.9\,97.9\textmu s.
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.
In the quest for fault-tolerant quantum computation, the delicate nature of qubits demands the need for robust quantum error correction. Quantum error correcting codes, the quantum counterpart to classical error correcting codes in information theory, have been developed to address the unique challenges quantum bits face against the noise of their environment in storing information. These codes include but are not limited to the Kitaev surface code, toric code, rotated surface code, generalized bicycle code, and bivariate bicycle code. Fast and reliable decoders for these quantum error correcting codes are needed to correct errors and achieve fault tolerance on these qubits. The belief propagation algorithm, which is a efficient and reliable heuristic for decoding classical low-density parity check codes, has been generalized to different types of quantum error correction codes. Paired with the ordered statistics decoding algorithm as a post-processing step from the soft outputs of the belief propagation decoder, belief propagation and ordered statistics decoding has been one of the most promising avenues of efficient quantum error correction. This thesis combines the state-of-the-art belief propagation and ordered statistics decoding algorithms with the exploration of the neural belief propagation algorithm to leverage classical deep learning machines to learn message passing patterns in decoding the newest quantum codes, the rotated surface code and bivariate bicycle code. The neural network exploits the local lattice structure of these codes to adjust the trainable weights and biases to more learn message update patterns more efficiently than the vanilla belief propagation algorithm. In this thesis, we prove a new threshold for the physical error rate on the rotated surface code using a neural belief propagation algorithm and ordered statistics decoding that consistently outperforms the threshold established by the vanilla belief propagation algorithm with ordered statistics decoding. We additionally show the results for similar efforts on the bivariate bicycle codes, and discuss the difficulties in achieving a threshold using the current neural belief propagation algorithms.