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

arXiv:1802.06441 · Quantum Science and Technology

Deep neural decoders for near term fault-tolerant experiments

Christopher Chamberland, Pooya Ronagh

Published Jul 9, 2018• 107 citations
arXivHTMLPDF

Abstract

Abstract Finding efficient decoders for quantum error correcting codes adapted to realistic experimental noise in fault-tolerant devices represents a significant challenge. In this paper we introduce several decoding algorithms complemented by deep neural decoders (DND) and apply them to analyze several fault-tolerant error correction (EC) protocols such as the surface code as well as Steane and Knill EC. Our methods require no knowledge of the underlying noise model afflicting the quantum device making them appealing for real-world experiments. Our analysis is based on a full circuit-level noise model. It considers both distance-three and five codes, and is performed near the codes pseudo-threshold regime. Training DND in low noise rate regimes appears to be a challenging machine learning endeavour. We provide a detailed description of our neural network architectures and training methodology. We then discuss both the advantages and limitations of DND. Lastly, we provide a rigorous analysis of the decoding runtime of trained DND and compare our methods with anticipated gate times in future quantum devices. Given the broad applications of our decoding schemes, we believe that the methods presented in this paper could have practical applications for near term fault-tolerant experiments.

DOI
10.1088/2058-9565/aad1f7

Related papers

Developing a Practical Neural-Network Surface Code Decoder under Circuit-Level Noise

Aarush Pancholi

Abstract. Suppressing qubit errors is one of the main challenges in building fault-tolerant quantum computers, requiring quantum error correction to protect fragile quantum information during computation cycles. The surface code is a leading approach because of its high error tolerance and compatibility with realistic hardware, but it requires a decoder that can accurately and quickly use the syndrome measurements to discern whether a logical error has occurred. This study investigates whether a feedforward neural-network can serve as a practical decoder for the surface code under circuit-level noise. Using the Stim software package, this study generates surface code circuits at multiple code distances and physical error rates and compiles them into detector samplers, then trains a PyTorch neural-network to predict whether a logical observable flip occurred from the syndrome data. The neural-network decoder is compared against Minimum-Weight Perfect Matching (MWPM), focusing on metrics including logical error rate and inference speed. The results show that the neural-network decoder performs competitively with MWPM for code distances 3 and 5 and provides inference time advantages at higher physical error rates as its inference time remains relatively constant over increasing physical error rates. However, MWPM outperforms the neural-network at distance 7, suggesting that scalability remains a major limitation for neural-network decoders. These results show that neural-networks are a promising approach for tackling quantum error correction, although future work is still needed to improve these models for real systems at larger code distances.

•Aug 2, 2026•0 citations

Neural Decoders for Universal Quantum Algorithms

J. Pablo Bonilla Ataides, Andi Gu, Susanne F. Yelin +1 more

Fault-tolerant quantum computing demands decoders that are fast, accurate, and adaptable to circuit structure and realistic noise. While machine learning decoders have demonstrated impressive performance for quantum memory, their use in algorithmic decoding—where logical gates create complex error correlations—remains limited. We introduce a modular attention-based neural decoder that learns gate-induced correlations and generalizes from training on random circuits to unseen multiqubit algorithmic workloads. Our decoders achieve fast inference and logical error rates comparable to most-likely-error decoders across varied circuit depths and qubit counts. Addressing realistic noise, we incorporate loss-resolving readout, yielding substantial gains when qubit loss is present. We further show that by tailoring the decoder to the structure of the algorithm and decoding only the relevant observables, we can simplify the decoder design without sacrificing accuracy. We validate our framework on multiple error correction codes—including surface codes and two-dimensional color codes—and demonstrate state-of-the-art performance under circuit-level noise. Finally, we show that the attention mechanism learns to track physically meaningful error correlations, consistent with the expected propagation pathways through entangling gates. Enabling experimental validation of deep-circuit fault-tolerant algorithms and architectures [Bluvstein , ], these results establish neural decoders as practical, versatile, and high-performance tools for quantum computing.

arXiv:2509.11370•PRX Intelligence•Jul 28, 2026•26 citations

Evaluating Learned Decoders under Compound Noise Models in Surface Codes

Ali Syed, Tanaka Hiroshi, Khan Muhammad

The practical realization of fault-tolerant quantum computing critically hinges on the capacity of quantum error correction (QEC) schemes to robustly mitigate physical noise. Among the foremost candidates, the surface code is distinguished by its high threshold and local stabilizer checks. In recent years, neural network-based decoders, particularly those leveraging deep reinforcement learning (RL) and convolutional architectures, have demonstrated competitive performance against algorithmic staples such as Minimum Weight Perfect Matching (MWPM) and Union-Find. However, the vast majority of these learned decoders are trained and evaluated under idealized phenomenological or circuit-level depolarizing noise models. Real-world quantum processors exhibit complex, compound noise profiles encompassing crosstalk, leakage, non-Markovian temporal drift, and spatially correlated errors. In this work, we empirically evaluate the robustness of state-of-the-art neural decoders against highly structured compound noise models. We introduce a comprehensive stress-testing methodology tailored to quantify the degradation of the logical error rate when decoders are subjected to out-of-distribution noise characteristics. Our empirical results reveal that while neural decoders can overfit to their training noise profile, strategically designed training curricula and architecture regularizations enable significant resilience. We provide extensive numerical benchmarks validating that learned decoders can maintain near-optimal pseudothresholds across a broad spectrum of shifting noise conditions, highlighting their readiness for real-world superconducting qubit deployments.

•Jul 21, 2026•0 citations

Evaluating Learned Decoders under Compound Noise Models in Surface Codes

Hiroshi Tanaka, Syed Ali, Muhammad Salik Ali Khan

The practical realization of fault-tolerant quantum computing critically hinges on the capacity of quantum error correction (QEC) schemes to robustly mitigate physical noise. Among the foremost candidates, the surface code is distinguished by its high threshold and local stabilizer checks. In recent years, neural network-based decoders, particularly those leveraging deep reinforcement learning (RL) and convolutional architectures, have demonstrated competitive performance against algorithmic staples such as Minimum Weight Perfect Matching (MWPM) and Union-Find. However, the vast majority of these learned decoders are trained and evaluated under idealized phenomenological or circuit-level depolarizing noise models. Real-world quantum processors exhibit complex, compound noise profiles encompassing crosstalk, leakage, non-Markovian temporal drift, and spatially correlated errors. In this work, we empirically evaluate the robustness of state-of-the-art neural decoders against highly structured compound noise models. We introduce a comprehensive stress-testing methodology tailored to quantify the degradation of the logical error rate when decoders are subjected to out-of-distribution noise characteristics. Our empirical results reveal that while neural decoders can overfit to their training noise profile, strategically designed training curricula and architecture regularizations enable significant resilience. We provide extensive numerical benchmarks validating that learned decoders can maintain near-optimal pseudothresholds across a broad spectrum of shifting noise conditions, highlighting their readiness for real-world superconducting qubit deployments.

•Jul 21, 2026•0 citations

Machine Learning Approaches to Decoding Topological Quantum Codes

Changwon Lee, Tak Hur, Jeongwoo Jae +1 more

Decoding is an essential component of quantum error correction (QEC), translating stabilizer measurement outcomes into corrective actions that suppress logical errors and preserve logical quantum information. Building fault-tolerant architectures requires increasing the code distance, which in turn places growing demands on decoding accuracy, scalability, and practical deployability. While a wide range of decoding algorithms have been proposed and demonstrated, achieving reliable, scalable, and real-time decoding remains a significant challenge. Machine-learning (ML) approaches are particularly well suited to this setting, as quantum error decoding is fundamentally a problem of processing large volumes of classical data with complex spatiotemporal correlations. This chapter surveys ML-based methods for quantum error decoding, with a focus on topological codes and an emphasis on architectural principles, practical performance, and real-time considerations. We first frame decoding as a learning problem and outline key paradigms, including discriminative, generative, and reinforcement-learning formulations. We then introduce the neural network building blocks that underpin most contemporary neural decoders and discuss how these components can be integrated to balance expressivity, scalability, and latency. Building on this architectural perspective, we review recent progress and benchmarks in neural decoding for memory experiments, and discuss real-time decoding, open challenges, and future directions toward scalable fault-tolerant quantum computing.

quant-pharXiv:2608.15760•Aug 18, 2026•2 citations

Implementation of Machine Learning to Correct & Locate the Quantum Errors: Techniques for Systems of Fault-Tolerant Quantum Computing

V. Saravanan, P. Maragathavalli, V. Subha Ramya +3 more

Quantum computation has the promise to solve problems that are not efficiently solvable by classical means. Yet, due to the fragile nature of quantum states, it is unavoidable that quantum systems are subject to decoherence, gate imperfections, and measurement errors. These problems stand as a major roadblock to the construction of large-scale fault-tolerant quantum computers. Conventional quantum error correction (QEC) codes, such as the surface code or Shor code, need to use an extensive amount of redundancy and classical control, which can be both computationally expensive and challenging to scale. In this context, we propose to investigate the use of machine learning (ML) techniques by realizing on-line identification, localization and correction of these quantum errors for fault-tolerant quantum computation by means of fault-tolerant quantum computing processes. Our model introduces a hybrids ML-QEC architecture that combines classical neural networks and decision-tree classifiers with quantum syndrome decoding. These models are trained on error syndromes produced using the approximation of common noise models (for example, depolarizing noise, dephasing and amplitude damping), simulated under different QEC schemes. The machine learning methods are trained with quantum error patterns and have a capability to rapidly infer where errors are likely to occur, as well as recommend correction operations with high confidence. As a result, the system reduces dramatically the delay and computational costs when compared to conventional decoding methods. There is also a self-adaptive learning module in the work, which recommences training on fresh quantum error distributions, meaning the system can adapt to changes in the environment (and also the decay of the hardware) as time progresses. The study further carries out ML predictions inside a real-time loop and cross-checks them with quantum state tomography and entanglement fidelity such as indicators. Experimental characterization on dedicated devices as well as noise models show that our ML-enhanced decoders reach higher fidelity and lower logical error rates compared to baseline decoders, especially in non-uniform or time-dependent noise. This work is a significant stride towards realizing practical fault-tolerant quantum computation by combining quantum error correction with the versatility and scalability of machine learning. With intelligent models to dictate learning, our proposed framework is able to eliminate a lot of trial-and-error manual processes in the conventional heuristic-based approach, and points to a potential path to achieve scalable quantum information processing platforms.

International Conference on Electronics and Computing, Communication Networking Automation Technologies (ICEC2NT)•Sep 3, 2025•3 citations
Abstract Finding efficient decoders for quantum error correcting codes adapted to realistic experimental noise in fault-tolerant devices represents a significant challenge. In this paper we introduce several decoding algorithms complemented by deep neural decoders (DND) and apply them to analyze several fault-tolerant error correction (EC) protocols such as the surface code as well as Steane and Knill EC. Our methods require no knowledge of the underlying noise model afflicting the quantum device making them appealing for real-world experiments. Our analysis is based on a full circuit-level noise model. It considers both distance-three and five codes, and is performed near the codes pseudo-threshold regime. Training DND in low noise rate regimes appears to be a challenging machine learning endeavour. We provide a detailed description of our neural network architectures and training methodology. We then discuss both the advantages and limitations of DND. Lastly, we provide a rigorous analysis of the decoding runtime of trained DND and compare our methods with anticipated gate times in future quantum devices. Given the broad applications of our decoding schemes, we believe that the methods presented in this paper could have practical applications for near term fault-tolerant experiments.
Abstract. Suppressing qubit errors is one of the main challenges in building fault-tolerant quantum computers, requiring quantum error correction to protect fragile quantum information during computation cycles. The surface code is a leading approach because of its high error tolerance and compatibility with realistic hardware, but it requires a decoder that can accurately and quickly use the syndrome measurements to discern whether a logical error has occurred. This study investigates whether a feedforward neural-network can serve as a practical decoder for the surface code under circuit-level noise. Using the Stim software package, this study generates surface code circuits at multiple code distances and physical error rates and compiles them into detector samplers, then trains a PyTorch neural-network to predict whether a logical observable flip occurred from the syndrome data. The neural-network decoder is compared against Minimum-Weight Perfect Matching (MWPM), focusing on metrics including logical error rate and inference speed. The results show that the neural-network decoder performs competitively with MWPM for code distances 3 and 5 and provides inference time advantages at higher physical error rates as its inference time remains relatively constant over increasing physical error rates. However, MWPM outperforms the neural-network at distance 7, suggesting that scalability remains a major limitation for neural-network decoders. These results show that neural-networks are a promising approach for tackling quantum error correction, although future work is still needed to improve these models for real systems at larger code distances.
Fault-tolerant quantum computing demands decoders that are fast, accurate, and adaptable to circuit structure and realistic noise. While machine learning decoders have demonstrated impressive performance for quantum memory, their use in algorithmic decoding—where logical gates create complex error correlations—remains limited. We introduce a modular attention-based neural decoder that learns gate-induced correlations and generalizes from training on random circuits to unseen multiqubit algorithmic workloads. Our decoders achieve fast inference and logical error rates comparable to most-likely-error decoders across varied circuit depths and qubit counts. Addressing realistic noise, we incorporate loss-resolving readout, yielding substantial gains when qubit loss is present. We further show that by tailoring the decoder to the structure of the algorithm and decoding only the relevant observables, we can simplify the decoder design without sacrificing accuracy. We validate our framework on multiple error correction codes—including surface codes and two-dimensional color codes—and demonstrate state-of-the-art performance under circuit-level noise. Finally, we show that the attention mechanism learns to track physically meaningful error correlations, consistent with the expected propagation pathways through entangling gates. Enabling experimental validation of deep-circuit fault-tolerant algorithms and architectures [Bluvstein , ], these results establish neural decoders as practical, versatile, and high-performance tools for quantum computing.
The practical realization of fault-tolerant quantum computing critically hinges on the capacity of quantum error correction (QEC) schemes to robustly mitigate physical noise. Among the foremost candidates, the surface code is distinguished by its high threshold and local stabilizer checks. In recent years, neural network-based decoders, particularly those leveraging deep reinforcement learning (RL) and convolutional architectures, have demonstrated competitive performance against algorithmic staples such as Minimum Weight Perfect Matching (MWPM) and Union-Find. However, the vast majority of these learned decoders are trained and evaluated under idealized phenomenological or circuit-level depolarizing noise models. Real-world quantum processors exhibit complex, compound noise profiles encompassing crosstalk, leakage, non-Markovian temporal drift, and spatially correlated errors. In this work, we empirically evaluate the robustness of state-of-the-art neural decoders against highly structured compound noise models. We introduce a comprehensive stress-testing methodology tailored to quantify the degradation of the logical error rate when decoders are subjected to out-of-distribution noise characteristics. Our empirical results reveal that while neural decoders can overfit to their training noise profile, strategically designed training curricula and architecture regularizations enable significant resilience. We provide extensive numerical benchmarks validating that learned decoders can maintain near-optimal pseudothresholds across a broad spectrum of shifting noise conditions, highlighting their readiness for real-world superconducting qubit deployments.
The practical realization of fault-tolerant quantum computing critically hinges on the capacity of quantum error correction (QEC) schemes to robustly mitigate physical noise. Among the foremost candidates, the surface code is distinguished by its high threshold and local stabilizer checks. In recent years, neural network-based decoders, particularly those leveraging deep reinforcement learning (RL) and convolutional architectures, have demonstrated competitive performance against algorithmic staples such as Minimum Weight Perfect Matching (MWPM) and Union-Find. However, the vast majority of these learned decoders are trained and evaluated under idealized phenomenological or circuit-level depolarizing noise models. Real-world quantum processors exhibit complex, compound noise profiles encompassing crosstalk, leakage, non-Markovian temporal drift, and spatially correlated errors. In this work, we empirically evaluate the robustness of state-of-the-art neural decoders against highly structured compound noise models. We introduce a comprehensive stress-testing methodology tailored to quantify the degradation of the logical error rate when decoders are subjected to out-of-distribution noise characteristics. Our empirical results reveal that while neural decoders can overfit to their training noise profile, strategically designed training curricula and architecture regularizations enable significant resilience. We provide extensive numerical benchmarks validating that learned decoders can maintain near-optimal pseudothresholds across a broad spectrum of shifting noise conditions, highlighting their readiness for real-world superconducting qubit deployments.
Decoding is an essential component of quantum error correction (QEC), translating stabilizer measurement outcomes into corrective actions that suppress logical errors and preserve logical quantum information. Building fault-tolerant architectures requires increasing the code distance, which in turn places growing demands on decoding accuracy, scalability, and practical deployability. While a wide range of decoding algorithms have been proposed and demonstrated, achieving reliable, scalable, and real-time decoding remains a significant challenge. Machine-learning (ML) approaches are particularly well suited to this setting, as quantum error decoding is fundamentally a problem of processing large volumes of classical data with complex spatiotemporal correlations. This chapter surveys ML-based methods for quantum error decoding, with a focus on topological codes and an emphasis on architectural principles, practical performance, and real-time considerations. We first frame decoding as a learning problem and outline key paradigms, including discriminative, generative, and reinforcement-learning formulations. We then introduce the neural network building blocks that underpin most contemporary neural decoders and discuss how these components can be integrated to balance expressivity, scalability, and latency. Building on this architectural perspective, we review recent progress and benchmarks in neural decoding for memory experiments, and discuss real-time decoding, open challenges, and future directions toward scalable fault-tolerant quantum computing.
Quantum computation has the promise to solve problems that are not efficiently solvable by classical means. Yet, due to the fragile nature of quantum states, it is unavoidable that quantum systems are subject to decoherence, gate imperfections, and measurement errors. These problems stand as a major roadblock to the construction of large-scale fault-tolerant quantum computers. Conventional quantum error correction (QEC) codes, such as the surface code or Shor code, need to use an extensive amount of redundancy and classical control, which can be both computationally expensive and challenging to scale. In this context, we propose to investigate the use of machine learning (ML) techniques by realizing on-line identification, localization and correction of these quantum errors for fault-tolerant quantum computation by means of fault-tolerant quantum computing processes. Our model introduces a hybrids ML-QEC architecture that combines classical neural networks and decision-tree classifiers with quantum syndrome decoding. These models are trained on error syndromes produced using the approximation of common noise models (for example, depolarizing noise, dephasing and amplitude damping), simulated under different QEC schemes. The machine learning methods are trained with quantum error patterns and have a capability to rapidly infer where errors are likely to occur, as well as recommend correction operations with high confidence. As a result, the system reduces dramatically the delay and computational costs when compared to conventional decoding methods. There is also a self-adaptive learning module in the work, which recommences training on fresh quantum error distributions, meaning the system can adapt to changes in the environment (and also the decay of the hardware) as time progresses. The study further carries out ML predictions inside a real-time loop and cross-checks them with quantum state tomography and entanglement fidelity such as indicators. Experimental characterization on dedicated devices as well as noise models show that our ML-enhanced decoders reach higher fidelity and lower logical error rates compared to baseline decoders, especially in non-uniform or time-dependent noise. This work is a significant stride towards realizing practical fault-tolerant quantum computation by combining quantum error correction with the versatility and scalability of machine learning. With intelligent models to dictate learning, our proposed framework is able to eliminate a lot of trial-and-error manual processes in the conventional heuristic-based approach, and points to a potential path to achieve scalable quantum information processing platforms.