Performance analysis of a hybrid agent for quantum-accessible reinforcement learning
Arne Hamann, Sabine W\"olk

TL;DR
This paper analytically examines a hybrid quantum-classical reinforcement learning agent, demonstrating it can learn faster than classical agents by leveraging quantum speedups in exploration, even under noisy conditions.
Contribution
It introduces a hybrid agent model combining quantum exploration speedups with classical policy updates and provides analytical bounds on its learning efficiency.
Findings
Hybrid agent learns in fewer epochs than classical agents.
Quantum exploration offers quadratic speedup in learning.
Speedup persists under certain noise conditions.
Abstract
In the last decade quantum machine learning has provided fascinating and fundamental improvements to supervised, unsupervised and reinforcement learning. In reinforcement learning, a so-called agent is challenged to solve a task given by some environment. The agent learns to solve the task by exploring the environment and exploiting the rewards it gets from the environment. For some classical task environments, such as deterministic strictly epochal environments, an analogue quantum environment can be constructed which allows to find rewards quadratically faster by applying quantum algorithms. In this paper, we analytically analyze the behavior of a hybrid agent which combines this quadratic speedup in exploration with the policy update of a classical agent. This leads to a faster learning of the hybrid agent compared to the classical agent. We demonstrate that if the classical agent…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
