Improved Quantum Algorithms for Reinforcement Learning Under a Generative Model

arXiv:2608.02826 · quant-ph, cs.AI, cs.LG, stat.ML · Submitted 2026-08-03 · Read on arXiv

Joao F. Doriguello

quant-ph, cs.AI, cs.LG, stat.ML

Submitted: 2026-08-03

Comments: 22 pages. Comments welcome

License: http://creativecommons.org/licenses/by/4.0/

The gist: Reinforcement learning is a subfield of machine learning that studies how an agent interacts with an environment in order to extract as large a reward as possible.

Terminology

Abstract

Reinforcement learning is a subfield of machine learning that studies how an agent interacts with an environment in order to extract as large a reward as possible. A standard approach to study such interaction is through Markov Decision Processes (MDPs) and the task of choosing an optimal policy --- a function that tells the agent which action to take. In this work, we study two types of MDPs --- finite-horizon and infinite-horizon discounted --- and propose new quantum algorithms for computing approximate optimal policies. Our quantum algorithms are based on a new combination of standard value iteration and quantum subroutines like quantum mean estimation and quantum maximum finding, overall enhanced with techniques from sample-optimal classical algorithms. Our resulting query complexities improve upon previous works, thus approaching already established quantum lower bounds.

Sources

Related papers