



01775nas a2200133   4500008004100000245007500041210006900116520134900185100001901534700001601553700001601569700001901585856003701604       2017                        eng d00aExponential improvements for quantum-accessible reinforcement learning0 aExponential improvements for quantumaccessible reinforcement lea3 a<p>Quantum computers can offer dramatic improvements over classical devices for data analysis tasks such as prediction and classification. However, less is known about the advantages that quantum computers may bring in the setting of reinforcement learning, where learning is achieved via interaction with a task environment. Here, we consider a special case of reinforcement learning, where the task environment allows quantum access. In addition, we impose certain &quot;naturalness&quot; conditions on the task environment, which rule out the kinds of oracle problems that are studied in quantum query complexity (and for which quantum speedups are well-known). Within this framework of quantum-accessible reinforcement learning environments, we demonstrate that quantum agents can achieve exponential improvements in learning efficiency, surpassing previous results that showed only quadratic improvements. A key step in the proof is to construct task environments that encode well-known oracle problems, such as Simon&#39;s problem and Recursive Fourier Sampling, while satisfying the above &quot;naturalness&quot; conditions for reinforcement learning. Our results suggest that quantum agents may perform well in certain game-playing scenarios, where the game has recursive structure, and the agent can learn by playing against itself</p>1 aDunjko, Vedran1 aLiu, Yi-Kai1 aWu, Xingyao1 aTaylor, J., M.  uhttps://arxiv.org/abs/1710.11160