A scalable and fast artificial neural network syndrome decoder for surface codes

Abstract

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($\mu$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.

11 pages, 6 figures

References in corpus (9)

• Surface codes: Towards practical large-scale quantum computation
• Fault-tolerant quantum computation with high threshold in two dimensions
• Exponential suppression of bit or phase flip errors with repetitive error correction
• Quantum computing with nearest neighbor interactions and error rates over 1%
• Neural-Network Decoders for Quantum Error Correction using Surface Codes:A Space Exploration of the Hardware Cost-Performance Trade-Offs
• Approaching the theoretical limit in quantum gate decomposition
• PyMatching: A Python package for decoding quantum codes with minimum-weight perfect matching
• An exchange-based surface-code quantum computer architecture in silicon
• Decoding surface codes with deep reinforcement learning and probabilistic policy reuse

Cited by in corpus (17)

• Learning to Decode the Surface Code with a Recurrent, Transformer-Based Neural Network
• Real-Time Decoding for Fault-Tolerant Quantum Computing: Progress, Challenges and Outlook
• Artificial Intelligence for Quantum Computing
• Techniques for combining fast local decoders with global decoders under circuit-level noise
• Neural network decoder for near-term surface-code experiments
• Artificial Neural Network Syndrome Decoding on IBM Quantum Processors
• Mitigating errors in logical qubits
• Spanning Tree Matching Decoder for Quantum Surface Codes
• Low-overhead quantum error correction codes with a cyclic topology
• Progressive-Proximity Bit-Flipping for Decoding Surface Codes
• Introduction to Quantum Error Correction with Stabilizer Codes
• Enhancing Quantum Memory Lifetime with Measurement-Free Local Error Correction and Reinforcement Learning
• Transversal CNOT gate with multi-cycle error correction
• Self-attention U-Net decoder for toric codes
• Managing Classical Processing Requirements for Quantum Error Correction
• On the interpretability of neural network decoders
• Neural Decoders for Universal Quantum Algorithms