Pith. sign in

REVIEW

Reinforcement Learning Decoders for Fault-Tolerant Quantum Computation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1810.07207 v1 pith:74FKX5RL submitted 2018-10-16 quant-ph cs.AIcs.LG

classification quant-phcs.AIcs.LG
keywords decodingcodecodesfault-tolerantlearningagentscomputationfast
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Sign in to comment.

Pith tools