Pith. sign in

REVIEW 1 cited by

Optimization of Tensor Network 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 2305.11470 v1 pith:LK23UC7X submitted 2023-05-19 quant-ph

classification quant-ph
keywords codeslearningnetworkreinforcementtensoragentcodeconsistently
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Tensor network codes enable structured construction and manipulation of stabilizer codes out of small seed codes. Here, we apply reinforcement learning to tensor network code geometries and demonstrate how optimal stabilizer codes can be found. Using the projective simulation framework, our reinforcement learning agent consistently finds the best possible codes given an environment and set of allowed actions, including for codes with more than one logical qubit. The agent also consistently outperforms a random search, for example finding an optimal code with a $10\%$ frequency after 1000 trials, vs a theoretical $0.16\%$ from random search, an improvement by a factor of 65.

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 hypergraph product codes with random walks, simulated annealing and reinforcement learning

    quant-ph 2025-01 conditional novelty 6.0 of 10

    Searching over edge-swap variations of hypergraph product codes with an erasure-decoding cost function yields codes that beat Progressive Edge-Growth codes on erasure and bit-flip channels.

Pith tools