Reinforcement learning decoders for fault-tolerant quantum computation

Topological error correcting codes, and particularly the surface code, currently provide the most feasible road-map towards large-scale fault-tolerant quantum computation. As such, obtaining fast and flexible decoding algorithms for these codes, within the experimentally realistic and challenging context of faulty syndrome measurements, without requiring any final read-out of the physical qubits, is of critical importance. In this work, we show that the problem of decoding such codes 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. While in principle this framework can be instantiated with environments modelling circuit level noise, we take a first step towards this goal by using deepQ learning to obtain decoding agents for a variety of simplified phenomenological noise models, which yield faulty syndrome measurements without including the propagation of errors which arise in full circuit level noise models.

Automated summary

Topological error correcting codes, particularly the surface code, are currently the most feasible roadmap for large-scale fault-tolerant quantum computation. This research shows that decoding such codes can be reformulated as interactions between a decoding agent and a code environment, using reinforcement learning to obtain decoding agents. By using deep Q learning, decoding agents for various simplified phenomenological noise models were obtained.