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:2409.04300

Equivariant Machine Learning Decoder for 3D Toric Codes

Oliver Weißl, Evgenii Egorov

Published Sep 6, 2024• 0 citations
arXivHTMLPDF

Abstract

Mitigating errors in computing and communication systems has seen a great deal of research since the beginning of the widespread use of these technologies. However, as we develop new methods to do computation or communication, we also need to reiterate the method used to deal with errors. Within the field of quantum computing, error correction is getting a lot of attention since errors can propagate fast and invalidate results, which makes the theoretical exponential speed increase in computation time, compared to traditional systems, obsolete. To correct errors in quantum systems, error-correcting codes are used. A subgroup of codes, topological codes, is currently the focus of many research papers. Topological codes represent parity check matrices corresponding to graphs embedded on a $d$-dimensional surface. For our research, the focus lies on the toric code with a 3D square lattice. The goal of any decoder is robustness to noise, which can increase with code size. However, a reasonable decoder performance scales polynomially with lattice size. As error correction is a time-sensitive operation, we propose a neural network using an inductive bias: equivariance. This allows the network to learn from a rather small subset of the exponentially growing training space of possible inputs. In addition, we investigate how transformer networks can help in correction. These methods will be compared with various configurations and previously published methods of decoding errors in the 3D toric code.

DOI
10.48550/arxiv.2409.04300

Related papers

An Equivariant Machine Learning Decoder for 3D Toric Codes

Oliver Weißl, Evgenii Egorov

Research on mitigating errors in computing and communication systems has grown with their widespread use. In quantum computing, error correction is crucial as errors can quickly propagate, undermining results and the theoretical speedup over classical systems. Quantum error-correcting codes, particularly topological codes, are a key focus. These codes map parity check matrices to graphs on d-dimensional surfaces, with our research centered on the 3D toric code. Effective decoders must be robust to noise, with performance improving as code size increases, but their complexity should scale polynomially with lattice size for practicality. We propose a neural network with inductive bias, leveraging equivariance to generalize efficiently from a smaller input subset. Additionally, we explore transformer networks for error correction and compare these methods to existing techniques for decoding errors in the 3D toric code, highlighting their strengths and limitations.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Mar 31, 2025•0 citations

The END: An Equivariant Neural Decoder for Quantum Error Correction

Evgenii Egorov, Roberto Bondesan, Max Welling

Quantum error correction is a critical component for scaling up quantum computing. Given a quantum code, an optimal decoder maps the measured code violations to the most likely error that occurred, but its cost scales exponentially with the system size. Neural network decoders are an appealing solution since they can learn from data an efficient approximation to such a mapping and can automatically adapt to the noise distribution. In this work, we introduce a data efficient neural decoder that exploits the symmetries of the problem. We characterize the symmetries of the optimal decoder for the toric code and propose a novel equivariant architecture that achieves state of the art accuracy compared to previous neural decoders.

arXiv:2304.07362•Apr 14, 2023•2 citations

Neural Belief-Matching Decoding for Topological Quantum Error Correction Codes

Luca Menti, Francisco Lázaro

Quantum error correction (QEC) is critical for scalable fault-tolerant quantum computing. Topological codes, such as the toric code, offer hardware-efficient architectures but their Tanner graphs contain many girth-4 cycles that degrade the performance of belief-propagation (BP) decoding. For this reason, BP decoding is typically followed by a more complex second stage decoder such as minimum-weight perfect matching. These combined decoders achieve a remarkable performance, albeit at the cost of increased complexity. In this paper we propose two key improvements for the decoding of toric code. The first one is replacing the BP decoder by a neural BP decoder, giving rise to the neural belief-matching decoder which substantially decreases the average decoding complexity. The main drawback of this approach is the high cost associated with the training of the neural BP decoder. To address this issue, we impose a convolutional architecture on the neural BP decoder, enabling weight sharing across the spatially homogeneous structure of the code's factor graph. This design allows a model trained on a modest-size topological code to be directly transferred to much larger instances, preserving decoding quality while dramatically lowering the training burden. Our numerical experiments on toric-code lattices of various sizes demonstrate that this technique does not result in a noticeable loss in performance.

quant-pharXiv:2603.21730•Mar 24, 2026•0 citations

Determination of quantum toric error correction code threshold using convolutional neural network decoders

Haowen Wang, Yun-Jia Xue, Yulin Ma +2 more

Quantum error correction technology is an important solution to solve the noise interference generated during the operation of quantum computers. In order to find the best syndrome of the stabilizer code in quantum error correction, we need to find a fast and close to the optimal threshold decoder. In this work, we build a convolutional neural network (CNN) decoder to correct errors in the toric code based on the system research of machine learning. We analyze and optimize various conditions that affect CNN, and use the RestNet network architecture to reduce the running time. It is shortened by 30%–40%, and we finally design an optimized algorithm for CNN decoder. In this way, the threshold accuracy of the neural network decoder is made to reach 10.8%, which is closer to the optimal threshold of about 11%.The previous threshold of 8.9%–10.3% has been slightly improved, and there is no need to verify the basic noise.

Chinese Physics B•Jul 7, 2021•26 citations

Scalable Neural Network Decoders for Higher Dimensional Quantum Codes

Nikolas P. Breuckmann, Xiaotong Ni

Machine learning has the potential to become an important tool in quantum error correction as it allows the decoder to adapt to the error distribution of a quantum chip. An additional motivation for using neural networks is the fact that they can be evaluated by dedicated hardware which is very fast and consumes little power. Machine learning has been previously applied to decode the surface code. However, these approaches are not scalable as the training has to be redone for every system size which becomes increasingly difficult. In this work the existence of local decoders for higher dimensional codes leads us to use a low-depth convolutional neural network to locally assign a likelihood of error on each qubit. For noiseless syndrome measurements, numerical simulations show that the decoder has a threshold of around 7.1% when applied to the 4D toric code. When the syndrome measurements are noisy, the decoder performs better for larger code sizes when the error probability is low. We also give theoretical and numerical analysis to show how a convolutional neural network is different from the 1-nearest neighbor algorithm, which is a baseline machine learning method.

arXiv:1710.09489•Quantum•May 24, 2018•52 citations

Quantum error correction for the toric code using deep reinforcement learning

Philip Andreasson, Joel Johansson, Simon Liljestrand +1 more

We implement a quantum error correction algorithm for bit-flip errors on the topological toric code using deep reinforcement learning. An action-value Q-function encodes the discounted value of moving a defect to a neighboring site on the square grid (the action) depending on the full set of defects on the torus (the syndrome or state). The Q-function is represented by a deep convolutional neural network. Using the translational invariance on the torus allows for viewing each defect from a central perspective which significantly simplifies the state space representation independently of the number of defect pairs. The training is done using experience replay, where data from the algorithm being played out is stored and used for mini-batch upgrade of the Q-network. We find performance which is close to, and for small error rates asymptotically equivalent to, that achieved by the Minimum Weight Perfect Matching algorithm for code distances up to d=7 . Our results show that it is possible for a self-trained agent without supervision or support algorithms to find a decoding scheme that performs on par with hand-made algorithms, opening up for future machine engineered decoders for more general error models and error correcting codes.

arXiv:1811.12338•Quantum•Sep 2, 2019•106 citations
Mitigating errors in computing and communication systems has seen a great deal of research since the beginning of the widespread use of these technologies. However, as we develop new methods to do computation or communication, we also need to reiterate the method used to deal with errors. Within the field of quantum computing, error correction is getting a lot of attention since errors can propagate fast and invalidate results, which makes the theoretical exponential speed increase in computation time, compared to traditional systems, obsolete. To correct errors in quantum systems, error-correcting codes are used. A subgroup of codes, topological codes, is currently the focus of many research papers. Topological codes represent parity check matrices corresponding to graphs embedded on a ddd-dimensional surface. For our research, the focus lies on the toric code with a 3D square lattice. The goal of any decoder is robustness to noise, which can increase with code size. However, a reasonable decoder performance scales polynomially with lattice size. As error correction is a time-sensitive operation, we propose a neural network using an inductive bias: equivariance. This allows the network to learn from a rather small subset of the exponentially growing training space of possible inputs. In addition, we investigate how transformer networks can help in correction. These methods will be compared with various configurations and previously published methods of decoding errors in the 3D toric code.
Research on mitigating errors in computing and communication systems has grown with their widespread use. In quantum computing, error correction is crucial as errors can quickly propagate, undermining results and the theoretical speedup over classical systems. Quantum error-correcting codes, particularly topological codes, are a key focus. These codes map parity check matrices to graphs on d-dimensional surfaces, with our research centered on the 3D toric code. Effective decoders must be robust to noise, with performance improving as code size increases, but their complexity should scale polynomially with lattice size for practicality. We propose a neural network with inductive bias, leveraging equivariance to generalize efficiently from a smaller input subset. Additionally, we explore transformer networks for error correction and compare these methods to existing techniques for decoding errors in the 3D toric code, highlighting their strengths and limitations.
Quantum error correction is a critical component for scaling up quantum computing. Given a quantum code, an optimal decoder maps the measured code violations to the most likely error that occurred, but its cost scales exponentially with the system size. Neural network decoders are an appealing solution since they can learn from data an efficient approximation to such a mapping and can automatically adapt to the noise distribution. In this work, we introduce a data efficient neural decoder that exploits the symmetries of the problem. We characterize the symmetries of the optimal decoder for the toric code and propose a novel equivariant architecture that achieves state of the art accuracy compared to previous neural decoders.
Quantum error correction (QEC) is critical for scalable fault-tolerant quantum computing. Topological codes, such as the toric code, offer hardware-efficient architectures but their Tanner graphs contain many girth-4 cycles that degrade the performance of belief-propagation (BP) decoding. For this reason, BP decoding is typically followed by a more complex second stage decoder such as minimum-weight perfect matching. These combined decoders achieve a remarkable performance, albeit at the cost of increased complexity. In this paper we propose two key improvements for the decoding of toric code. The first one is replacing the BP decoder by a neural BP decoder, giving rise to the neural belief-matching decoder which substantially decreases the average decoding complexity. The main drawback of this approach is the high cost associated with the training of the neural BP decoder. To address this issue, we impose a convolutional architecture on the neural BP decoder, enabling weight sharing across the spatially homogeneous structure of the code's factor graph. This design allows a model trained on a modest-size topological code to be directly transferred to much larger instances, preserving decoding quality while dramatically lowering the training burden. Our numerical experiments on toric-code lattices of various sizes demonstrate that this technique does not result in a noticeable loss in performance.
Quantum error correction technology is an important solution to solve the noise interference generated during the operation of quantum computers. In order to find the best syndrome of the stabilizer code in quantum error correction, we need to find a fast and close to the optimal threshold decoder. In this work, we build a convolutional neural network (CNN) decoder to correct errors in the toric code based on the system research of machine learning. We analyze and optimize various conditions that affect CNN, and use the RestNet network architecture to reduce the running time. It is shortened by 30%–40%, and we finally design an optimized algorithm for CNN decoder. In this way, the threshold accuracy of the neural network decoder is made to reach 10.8%, which is closer to the optimal threshold of about 11%.The previous threshold of 8.9%–10.3% has been slightly improved, and there is no need to verify the basic noise.
Machine learning has the potential to become an important tool in quantum error correction as it allows the decoder to adapt to the error distribution of a quantum chip. An additional motivation for using neural networks is the fact that they can be evaluated by dedicated hardware which is very fast and consumes little power. Machine learning has been previously applied to decode the surface code. However, these approaches are not scalable as the training has to be redone for every system size which becomes increasingly difficult. In this work the existence of local decoders for higher dimensional codes leads us to use a low-depth convolutional neural network to locally assign a likelihood of error on each qubit. For noiseless syndrome measurements, numerical simulations show that the decoder has a threshold of around 7.1% when applied to the 4D toric code. When the syndrome measurements are noisy, the decoder performs better for larger code sizes when the error probability is low. We also give theoretical and numerical analysis to show how a convolutional neural network is different from the 1-nearest neighbor algorithm, which is a baseline machine learning method.
We implement a quantum error correction algorithm for bit-flip errors on the topological toric code using deep reinforcement learning. An action-value Q-function encodes the discounted value of moving a defect to a neighboring site on the square grid (the action) depending on the full set of defects on the torus (the syndrome or state). The Q-function is represented by a deep convolutional neural network. Using the translational invariance on the torus allows for viewing each defect from a central perspective which significantly simplifies the state space representation independently of the number of defect pairs. The training is done using experience replay, where data from the algorithm being played out is stored and used for mini-batch upgrade of the Q-network. We find performance which is close to, and for small error rates asymptotically equivalent to, that achieved by the Minimum Weight Perfect Matching algorithm for code distances up to d=7 . Our results show that it is possible for a self-trained agent without supervision or support algorithms to find a decoding scheme that performs on par with hand-made algorithms, opening up for future machine engineered decoders for more general error models and error correcting codes.