An episode-length-doubling rule adapted from Boyer's quantum search lets the hybrid QRL agent find a first reward in grid mazes without knowing the target distance, and it outperforms classical agents in several wall configurations.
Optimizing Quantum Variational Circuits with Deep Reinforcement Learning
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Quantum Machine Learning (QML) is considered to be one of the most promising applications of near term quantum devices. However, the optimization of quantum machine learning models presents numerous challenges arising from the imperfections of hardware and the fundamental obstacles in navigating an exponentially scaling Hilbert space. In this work, we evaluate the potential of contemporary methods in deep reinforcement learning to augment gradient based optimization routines in quantum variational circuits. We find that reinforcement learning augmented optimizers consistently outperform gradient descent in noisy environments. All code and pretrained weights are available to replicate the results or deploy the models at: https://github.com/lockwo/rl_qvc_opt.
citation-role summary
citation-polarity summary
fields
quant-ph 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
A hybrid learning agent for episodic learning tasks with unknown target distance
An episode-length-doubling rule adapted from Boyer's quantum search lets the hybrid QRL agent find a first reward in grid mazes without knowing the target distance, and it outperforms classical agents in several wall configurations.