Abstract Artificial neural networks (ANNs) are a promising approach to the decoding problem of quantum error correction (QEC), but have observed consistent difficulty when generalising performance to larger QEC codes. Recent scalability-focused approaches have split the decoding workload by using local ANNs to perform initial syndrome processing and leaving final processing to a global residual decoder. We investigated ANN surface code decoding under a scheme exploiting the spatiotemporal structure of syndrome data. In particular, we present a vectorised method for surface code data simulation and benchmark decoding performance when such data defines a multi-label classification problem and generative modelling problem for rotated surface codes with circuit noise after each gate and idle timestep. Performance was found to generalise to rotated surface codes of sizes up to d = 97, with depolarisation parameter thresholds of up to 0.7% achieved, competitive with minimum weight perfect matching (MWPM). Improved timings, compared with MWPM alone, were found starting at code distances of d = 33 and d = 89 under noise models above and below threshold respectively. These results suggest promising prospects for ANN-based frameworks for surface code decoding with performance sufficient to support the demands expected from fault-tolerant resource estimates.
Abstract Artificial neural networks (ANNs) are a promising approach to the decoding problem of quantum error correction (QEC), but have observed consistent difficulty when generalising performance to larger QEC codes. Recent scalability-focused approaches have split the decoding workload by using local ANNs to perform initial syndrome processing and leaving final processing to a global residual decoder. We investigated ANN surface code decoding under a scheme exploiting the spatiotemporal structure of syndrome data. In particular, we present a vectorised method for surface code data simulation and benchmark decoding performance when such data defines a multi-label classification problem and generative modelling problem for rotated surface codes with circuit noise after each gate and idle timestep. Performance was found to generalise to rotated surface codes of sizes up to d = 97, with depolarisation parameter thresholds of up to 0.7% achieved, competitive with minimum weight perfect matching (MWPM). Improved timings, compared with MWPM alone, were found starting at code distances of d = 33 and d = 89 under noise models above and below threshold respectively. These results suggest promising prospects for ANN-based frameworks for surface code decoding with performance sufficient to support the demands expected from fault-tolerant resource estimates.
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.
Surface code error correction offers a highly promising pathway to achieve scalable fault-tolerant quantum computing. When operated as stabilizer codes, surface code computations consist of a syndrome decoding step where measured stabilizer operators are used to determine appropriate corrections for errors in physical qubits. Decoding algorithms have undergone substantial development, with recent work incorporating machine learning (ML) techniques. Despite promising initial results, the ML-based syndrome decoders are still limited to small scale demonstrations with low latency and are incapable of handling surface codes with boundary conditions and various shapes needed for lattice surgery and braiding. Here, we report the development of an artificial neural network (ANN) based scalable and fast syndrome decoder capable of decoding surface codes of arbitrary shape and size with data qubits suffering from the depolarizing error model. Based on rigorous training over 50 million random quantum error instances, our ANN decoder is shown to work with code distances exceeding 1000 (more than 4 million physical qubits), which is the largest ML-based decoder demonstration to-date. The established ANN decoder demonstrates an execution time in principle independent of code distance, implying that its implementation on dedicated hardware could potentially offer surface code decoding times of O( μ sec), commensurate with the experimentally realisable qubit coherence times. With the anticipated scale-up of quantum processors within the next decade, their augmentation with a fast and scalable syndrome decoder such as developed in our work is expected to play a decisive role towards experimental implementation of fault-tolerant quantum information processing.
Fault-tolerant quantum computation critically depends on the ability to detect and correct physical qubit errors faster than they accumulate. The surface code (SC) has emerged as the most experimentally promising quantum error correction (QEC) framework due to its high threshold and local stabilizer structure, yet its practical performance is bottlenecked by decoder efficiency. Traditional decoding approaches such as minimum-weight perfect matching (MWPM) achieve near-optimal accuracy under independent noise but struggle with correlated errors, circuit-level noise, and real-time latency constraints. This paper investigates how neural network (NN)-based decoders reduce logical error rates in SC quantum systems by learning complex syndrome-to-correction mappings from data. We propose a hybrid convolutional-recurrent neural architecture that processes stabilizer measurement syndromes across both spatial and temporal dimensions, enabling the decoder to capture correlated error patterns inherent in realistic hardware. Systematic simulations under depolarizing, biased, and circuit-level noise models demonstrate that the proposed neural decoder achieves a logical error rate reduction of up to 41.3% compared to MWPM at a physical error rate of p = 0.008, while maintaining sub-millisecond decoding latency compatible with superconducting qubit cycle times. These results establish that data-driven neural decoders represent a scalable and hardware-compatible pathway toward achieving the logical error rates required for practical fault-tolerant quantum computing.
Real-time decoding is a major bottleneck in scaling quantum error correction (QEC) from noisy intermediate-scale quantum (NISQ) devices to fault-tolerant quantum computing. We present an adaptive confidence-gated decoding framework for the rotated surface code that treats decoding as a two-stage inference problem. A lightweight feed-forward neural network performs fast-path decoding for the majority of syndrome measurements, while only low-confidence predictions are escalated to a minimum-weight perfect matching (MWPM) refinement stage. We benchmark the framework on rotated surface codes with distances d∈{3,5,7,9,11} under circuit-level depolarising noise using the Stim stabiliser simulator. The evaluation characterises logical accuracy, confidence-controlled accuracy-latency trade-offs, decoding throughput, per-shot latency, and decoding-graph resource scaling. Routing only 3.3%-6.2% of syndromes to the refinement stage improves logical accuracy from 99.21% for the neural-only baseline to 99.81% at a confidence threshold of 0.95 while incurring only a bounded increase in average decoding cost. Neural-decoder throughput saturates near 4.6×105 samples s−1 at batch size 512 on commodity CPU hardware, indicating that the neural fast path is not the dominant throughput bottleneck beyond code distance d=7. We release the complete benchmarking pipeline, trained models, raw benchmark data, and source code, and explicitly distinguish the experimentally validated contributions from the broader hardware-aware QEC co-design roadmap, including hardware-constrained code discovery, GPU-accelerated inference, and multi-noise optimisation, which remain directions for future work.
Quantum error correction is essential to achieve fault-tolerant quantum computation in the presence of noisy qubits. Among the most promising approaches to quantum error correction is the surface code, thanks to a scalable two-dimensional architecture, only nearest-neighbor interactions, and a high error threshold. Decoding the surface code, i.e. finding the most likely error chain given a syndrome measurement outcome is a computationally complex task. Traditional decoders rely on classical algorithms, which, especially for larger systems, can be slow and may not always converge to the optimal solution. This thesis presents a novel approach to decoding the surface code using graph neural networks. By mapping the syndrome measurements to a graph and performing graph classification, we find that the graph neural networks can predict the most likely error configuration with high accuracy. Our results show that the GNN-based decoder outperforms the classic minimum weight perfect matching (MWPM) decoder in terms of accuracy. With a phenomenological noise model with depolarizing noise and perfect syndrome measurements, our networks beat MWPM up to code-size 15 across all relevant error rates. Furthermore, the GNN is capable of surpassing MWPM under circuit-level noise up to code size 7. We also show that training the network on repetition code data from a recent experiment [Google Quantum AI, Nature 614, 676 (2023)] produces per-step error rates comparable to those achieved with a matching decoder specifically adapted to the error rates of the physical qubits. This indicates that graph neural network decoders are capable of learning the underlying error distribution on the qubits. Our findings advance the field of quantum error correction and provide a promising new direction for the development of efficient decoding algorithms.
Quantum error correction is a crucial technology for realizing quantum computers. These computers achieve fault-tolerant quantum computing by detecting and correcting errors using decoding algorithms. Quantum error correction using neural network-based machine learning methods is a promising approach that is adapted to physical systems without the need to build noise models. In this paper, we use a distributed decoding strategy, which effectively alleviates the problem of exponential growth of the training set required for neural networks as the code distance of quantum error-correcting codes increases. Our decoding algorithm is based on renormalization group decoding and recurrent neural network decoder. The recurrent neural network is trained through the ResNet architecture to improve its decoding accuracy. Then we test the decoding performance of our distributed strategy decoder, recurrent neural network decoder, and the classic minimum weight perfect matching (MWPM) decoder for rotated surface codes with different code distances under the circuit noise model, the thresholds of these three decoders are about 0.0052, 0.0051, and 0.0049, respectively. Our results demonstrate that the distributed strategy decoder outperforms the other two decoders, achieving approximately a 5% improvement in decoding efficiency compared to the MWPM decoder and approximately a 2% improvement compared to the recurrent neural network decoder.