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
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.
Forward citations
Cited by 1 Pith paper
-
Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning
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.
Discussion (0). Continue with ORCID to comment.