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

Distributed Training for Deep Reinforcement Learning Decoders on the Toric Code

Adam Olsson, Gabriel Lindeby

Published Jan 1, 2020• 1 citation
OpenAlex

Related papers

Reinforcement learning for optimal error correction of toric codes

Laia Domingo Colomer, Michalis Skotiniotis, R. Muñoz-Tapia

arXiv:1911.02308•Physics Letters A•Feb 27, 2020•34 citations

LDPC Decoding Algorithm Based on D3QN Deep Reinforcement Learning

Weiqi Wang, Hongzheng Zeng, Qizhen Sun +3 more

Communications in computer and information science•Jan 1, 2025•0 citations

Deep Q-learning decoder for depolarizing noise on the toric code

David Fitzek, Mattias Eliasson, Anton Frisk Kockum +1 more

This paper presents an artificial intelligence-based decoder for quantum error correction of the toric code. A neural network is trained, using reinforcement learning, to suggest error-correcting operations on the physical qubits to best avoid logical errors. By learning to take advantage of the correlations between bit-flip and phase-flip errors, it can outperform the standard matching decoder for depolarizing noise.

arXiv:1912.12919•Physical Review Research•May 26, 2020•38 citations

Machine learning quantum error correction codes: learning the toric code

Rodríguez Fernández, Carlos Gustavo

•Dec 14, 2018•0 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

Reinforcement Learning for Enhanced Advanced QEC Architecture Decoding

Yidong Zhou, Lingyi Kong, Yifeng Peng +1 more

Asia and South Pacific Design Automation Conference (ASP-DAC)•Jan 19, 2026•0 citations
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.