Reinforcement Learning Decoders for Fault-Tolerant Quantum Computation
October 16, 2018 Β· Entered Twilight Β· π Machine Learning: Science and Technology
"Last commit was 7.0 years ago (β₯5 year threshold)"
Evidence collected by the PWNC Scanner
Repo contents: .gitignore, LICENSE, README.md, RL_Decoding_for_FTQC.pdf, cluster_scripts, example_notebooks, manuscript, trained_models
Authors
Ryan Sweke, Markus S. Kesselring, Evert P. L. van Nieuwenburg, Jens Eisert
arXiv ID
1810.07207
Category
quant-ph: Quantum Computing
Cross-listed
cs.AI,
cs.LG
Citations
129
Venue
Machine Learning: Science and Technology
Repository
https://github.com/R-Sweke/DeepQ-Decoding
β 50
Last Checked
1 month ago
Abstract
Topological error correcting codes, and particularly the surface code, currently provide the most feasible roadmap towards large-scale fault-tolerant quantum computation. As such, obtaining fast and flexible decoding algorithms for these codes, within the experimentally relevant context of faulty syndrome measurements, is of critical importance. In this work, we show that the problem of decoding such codes, in the full fault-tolerant setting, can be naturally reformulated as a process of repeated interactions between a decoding agent and a code environment, to which the machinery of reinforcement learning can be applied to obtain decoding agents. As a demonstration, by using deepQ learning, we obtain fast decoding agents for the surface code, for a variety of noise-models.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Quantum Computing
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
The power of quantum neural networks
R.I.P.
π»
Ghosted
Power of data in quantum machine learning
R.I.P.
π»
Ghosted
Quantum machine learning: a classical perspective
R.I.P.
π»
Ghosted
Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers
R.I.P.
π»
Ghosted