Quantum-accessible reinforcement learning beyond strictly epochal environments

• Published in: Quantum machine intelligence 2021, Vol.3 (2), p.22-22, Article 22
• Main Authors: Hamann, A., Dunjko, V., Wölk, S.
• Format: Article
• Language: English
• Subjects: Artificial Intelligence; Computational Intelligence; Engineering; Quantum Information Technology; Research Article; Spintronics
• ISSN: 2524-4906; 2524-4914
• DOI: 10.1007/s42484-021-00049-7

In recent years, quantum-enhanced machine learning has emerged as a particularly fruitful application of quantum algorithms, covering aspects of supervised, unsupervised and reinforcement learning. Reinforcement learning offers numerous options of how quantum theory can be applied, and is arguably the least explored, from a quantum perspective. Here, an agent explores an environment and tries to find a behavior optimizing some figure of merit. Some of the first approaches investigated settings where this exploration can be sped-up, by considering quantum analogs of classical environments, which can then be queried in superposition. If the environments have a strict periodic structure in time (i.e. are strictly episodic), such environments can be effectively converted to conventional oracles encountered in quantum information. However, in general environments, we obtain scenarios that generalize standard oracle tasks. In this work, we consider one such generalization, where the environment is not strictly episodic, which is mapped to an oracle identification setting with a changing oracle. We analyze this case and show that standard amplitude-amplification techniques can, with minor modifications, still be applied to achieve quadratic speed-ups. In addition, we prove that an algorithm based on Grover iterations is optimal for oracle identification even if the oracle changes over time in a way that the “rewarded space” is monotonically increasing. This result constitutes one of the first generalizations of quantum-accessible reinforcement learning.