Abstract Efficient, low-latency decoding of topological quantum error correction (QEC) codes is a central challenge on the road to fault-tolerant quantum computing. This systematic review synthesizes findings from 108 peer-reviewed studies (2017–2026), selected per the PRISMA 2020 framework, evaluating artificial intelligence (AI) and machine learning (ML) architectures for decoding surface, toric, color, and related topological stabilizer codes used in near-term and fault-tolerant quantum computing systems. We find that AI decoders frequently outperform classical baselines under correlated and hardware-realistic noise: graph neural networks achieve error thresholds up to \(\:{p}_{th}\approx\:13.8\%\), transformer-based models such as AlphaQubit reduce logical error rates by 24–31% over minimum weight perfect matching (MWPM) on distance-3 and distance-5 surface codes benchmarked on Google’s Sycamore superconducting processor. Meanwhile, classical co-processor implementations using field-programmable gate arrays (FPGAs) and application-specific integrated circuits (ASICs) reach inference latencies as low as 2.3 ns. However, robustness to calibration drift and the ability to generalize across different quantum hardware platforms remain open challenges. This review provides a structured decoder taxonomy, comparative performance tables, and an evidence-based roadmap for deploying AI-enhanced QEC in utility-scale quantum systems.
Abstract Efficient, low-latency decoding of topological quantum error correction (QEC) codes is a central challenge on the road to fault-tolerant quantum computing. This systematic review synthesizes findings from 108 peer-reviewed studies (2017–2026), selected per the PRISMA 2020 framework, evaluating artificial intelligence (AI) and machine learning (ML) architectures for decoding surface, toric, color, and related topological stabilizer codes used in near-term and fault-tolerant quantum computing systems. We find that AI decoders frequently outperform classical baselines under correlated and hardware-realistic noise: graph neural networks achieve error thresholds up to (:{p}_{th}\approx:13.8%), transformer-based models such as AlphaQubit reduce logical error rates by 24–31% over minimum weight perfect matching (MWPM) on distance-3 and distance-5 surface codes benchmarked on Google’s Sycamore superconducting processor. Meanwhile, classical co-processor implementations using field-programmable gate arrays (FPGAs) and application-specific integrated circuits (ASICs) reach inference latencies as low as 2.3 ns. However, robustness to calibration drift and the ability to generalize across different quantum hardware platforms remain open challenges. This review provides a structured decoder taxonomy, comparative performance tables, and an evidence-based roadmap for deploying AI-enhanced QEC in utility-scale quantum systems.
This review article provides a comprehensive overview of recent developments in the field of quantum error correction (QEC), which stands as one of the biggest challenges for quantum computing. The extreme sensitivity of quantum systems to environmental noise makes it difficult to build reliable and scalable quantum computers. Inspired by pioneering codes like those from Shor and Steane, this work discusses the most promising QEC approaches today, particularly topological codes such as surface codes and low-density parity-check (LDPC) codes. The paper delves into critical experimental successes from industry leaders like Google, IBM, and Quantinuum, including their ”below-threshold” error correction demonstrations and roadmaps for fault-tolerant systems. It also presents a comparative analysis between classical algorithms like Minimum-Weight Perfect Matching (MWPM) and newer, machine learning-based decoder approaches. The discussion section addresses open problems that need to be solved in the future, such as correlated noise, cryogenic control, and the creation of fault-tolerant logical gate sets. This review aims to summarize the current state of the QEC field, serving as a guiding resource for both academics and industry professionals in shaping future research and development strategies.
This review article provides a comprehensive overview of recent developments in the field of quantum error correction (QEC), which stands as one of the biggest challenges for quantum computing. The extreme sensitivity of quantum systems to environmental noise makes it difficult to build reliable and scalable quantum computers. Inspired by pioneering codes like those from Shor and Steane, this work discusses the most promising QEC approaches today, particularly topological codes such as surface codes and low-density parity-check (LDPC) codes. The paper delves into critical experimental successes from industry leaders like Google, IBM, and Quantinuum, including their ”below-threshold” error correction demonstrations and roadmaps for fault-tolerant systems. It also presents a comparative analysis between classical algorithms like Minimum-Weight Perfect Matching (MWPM) and newer, machine learning-based decoder approaches. The discussion section addresses open problems that need to be solved in the future, such as correlated noise, cryogenic control, and the creation of fault-tolerant logical gate sets. This review aims to summarize the current state of the QEC field, serving as a guiding resource for both academics and industry professionals in shaping future research and development strategies.
Quantum error correction (QEC) represents a critical enabler for fault-tolerant quantum computing, protecting fragile quantum states from decoherence and operational errors. This paper provides a comprehensive analysis of leading quantum error correction schemes, focusing on surface codes and topological codes within the context of Noisy Intermediate-Scale Quantum (NISQ) era processors. We examine the theoretical foundations of stabilizer codes, compare surface code implementations with code distances ranging from d=3 to d=17, and analyze topological codes including toric codes and color codes. Our investigation encompasses syndrome extraction circuits, logical qubit encoding strategies, and threshold analysis for contemporary quantum hardware platforms. Performance metrics reveal that surface codes achieve error thresholds of approximately 1% with realistic noise models, while topological codes offer architectural advantages for specific qubit connectivity constraints. We discuss implementation challenges on current NISQ processors including IBM Quantum, Google Sycamore, and IonQ systems, addressing qubit overhead, gate fidelity requirements, and decoding algorithms. This analysis provides insights for selecting appropriate error correction schemes based on application requirements and hardware capabilities.
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 computers can solve selected problems more efficiently than classical computers, but current devices are limited by high physical error rates. Quantum Error Correction (QEC) mitigates this by encoding many physical qubits into a logical qubit, with the surface code among the most widely studied approaches. Since syndrome measurements are produced continuously, the decoder must process them fast enough to avoid becoming a system bottleneck, making real-time decoding essential for fault-tolerant quantum computing. While most state-of-the-art real-time decoders rely on Minimum-Weight Perfect Matching (MWPM), we instead use a high-accuracy Graph Neural Network (GNN) that trades higher computational cost for lower logical error rates. To make this GNN practical for real-time decoding, we apply algorithm-hardware co-design. We reduce complexity through hardware-guided pruning and retraining, producing two hardware-friendly models that reduce parameter count by 3.1× and 6.5×. These target, respectively, an average decoding latency of one syndrome cycle and a worst-case latency within one syndrome cycle. We further reduce hardware cost using input-graph filtering and post-training quantization. Based on these optimized models, we propose an FPGA-based architecture for low-latency inference and real-time decoding. Evaluated on surface codes up to distance 7 under circuit-level noise at physical error rate p=10−3, our decoder outperforms MWPM in decoding accuracy for both average-latency and max-latency settings. It reduces logical error rate by 40% at 1μs average latency, and by 13% under a strict 1μs deadline.
Quantum error correction (QEC) is crucial for achieving fault-tolerant quantum computing by addressing errors in noisy qubits. The surface code, a leading QEC framework, traditionally employs the Minimum Weight Perfect Matching (MWPM) decoder. We present a step-by-step methodology that formulates surface code decoding as a supervised machine learning classification problem within a two-level framework, where low-level modules address physical qubit errors and highlevel modules correct logical errors. We implement Feedforward Neural Networks (FFNN) and Graph Neural Networks (GNN), which are individually employed to perform low-level physical qubit error correction and high-level logical error correction for rotated surface codes of distancesd=3,d=5, andd=7. Under depolarizing noise, both FFNN and GNN achieve lower logical error rates than MWPM, with GNN yielding up to 28% improvement atd=7. GNN achieves pseudothresholds of 0.1084, 0.1311, and 0.1441 ford=3,d=5, andd=7, surpassing MWPM's 0.0914, 0.1024, and 0.1126. Crossover points further indicate GNN's robustness at higher noise levels (e.g., 0.1632 vs. 0.1291 for MWPM). By learning error distributions in a two-level setting, both FFNN and GNN outperform MWPM, demonstrating their potential as scalable, high-performance decoders for near-term quantum devices.