Reinforcement Learning Decoders for Fault-Tolerant Quantum Computation
ORAL
Abstract
Topological error correcting codes, and particularly the surface code, provide a promising and feasible roadmap towards large-scale fault-tolerant quantum computation. Obtaining fast and flexible decoding algorithms for these codes, within the experimentally relevant context of faulty syndrome measurements, is therefore an important milestone. 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. Reinforcement learning can then be used to obtain such a decoding agent, and can succesfully learn to decode in the fault-tolerant setting.
*This research was supported by the Swiss National Science Foundation through grant P2EZP2-172185, the DFG (CRC 183, EI 519/14-1, and EI 519/7-1), the ERC (TAQ), the Templeton Foundation, and the BMBF (Q.com). This work has also received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 817482 (PASQUANS).
–
Presenters
-
Evert Van Nieuwenburg
- Caltech