pith. sign in

arxiv: 2211.15209 · v3 · pith:H4TSJ7RDnew · submitted 2022-11-28 · 🪐 quant-ph

Deep learning optimal quantum annealing schedules for random Ising models

classification 🪐 quant-ph
keywords annealingschedulesoptimalquantumgraphsisingmodelsrandom
0
0 comments X
read the original abstract

A crucial step in the race towards quantum advantage is optimizing quantum annealing using ad-hoc annealing schedules. Motivated by recent progress in the field, we propose to employ long-short term memory (LSTM) neural networks to automate the search for optimal annealing schedules for random Ising models on regular graphs. By training our network using locally-adiabatic annealing paths, we are able to predict optimal annealing schedules for unseen instances and even larger graphs than those used for training.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.