Pith. sign in

REVIEW 1 cited by

Optimizing Quantum Error Correction Codes with Reinforcement Learning

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 1812.08451 v5 pith:5UUYRG7F submitted 2018-12-20 quant-ph cs.AIcs.LG

classification quant-phcs.AIcs.LG
keywords errorlearningquantumreinforcementcorrectionagentcodesdata
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Quantum error correction is widely thought to be the key to fault-tolerant quantum computation. However, determining the most suited encoding for unknown error channels or specific laboratory setups is highly challenging. Here, we present a reinforcement learning framework for optimizing and fault-tolerantly adapting quantum error correction codes. We consider a reinforcement learning agent tasked with modifying a family of surface code quantum memories until a desired logical error rate is reached. Using efficient simulations with about 70 data qubits with arbitrary connectivity, we demonstrate that such a reinforcement learning agent can determine near-optimal solutions, in terms of the number of data qubits, for various error models of interest. Moreover, we show that agents trained on one setting are able to successfully transfer their experience to different settings. This ability for transfer learning showcases the inherent strengths of reinforcement learning and the applicability of our approach for optimization from off-line simulations to on-line laboratory settings.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Optimizing Entanglement Distillation Policies via Markov Decision Process Formulation

    quant-ph 2026-06 conditional novelty 6.0 of 10

    Value-iteration MDPs yield optimal multi-memory entanglement-distillation policies that cut expected wait time versus greedy, nested, and pumping baselines in a regime-dependent manner.

Pith tools