



@article {3022,
	title = {Quantum Algorithms for Reinforcement Learning with a Generative Model},
	journal = {Proceedings of the 38th International Conference on Machine Learning, PMLR},
	volume = {139},
	year = {2021},
	month = {12/15/2021},
	chapter = {10916-10926},
	abstract = {<p>Reinforcement learning studies how an agent should interact with an environment to maximize its cumulative reward. A standard way to study this question abstractly is to ask how many samples an agent needs from the environment to learn an optimal policy for a γ-discounted Markov decision process (MDP). For such an MDP, we design quantum algorithms that approximate an optimal policy (π\&lowast;), the optimal value function (v\&lowast;), and the optimal Q-function (q\&lowast;), assuming the algorithms can access samples from the environment in quantum superposition. This assumption is justified whenever there exists a simulator for the environment; for example, if the environment is a video game or some other program. Our quantum algorithms, inspired by value iteration, achieve quadratic speedups over the best-possible classical sample complexities in the approximation accuracy (ϵ) and two main parameters of the MDP: the effective time horizon (11\&minus;γ) and the size of the action space (A). Moreover, we show that our quantum algorithm for computing q\&lowast; is optimal by proving a matching quantum lower bound.</p>},
	keywords = {FOS: Computer and information sciences, FOS: Physical sciences, Machine Learning (cs.LG), Quantum Physics (quant-ph)},
	doi = {10.48550/ARXIV.2112.08451},
	url = {https://arxiv.org/abs/2112.08451},
	author = {Daochen Wang and Sundaram, Aarthi and Kothari, Robin and Kapoor, Ashish and Roetteler, Martin}
}
@article {2633,
	title = {Quantum exploration algorithms for multi-armed bandits},
	journal = {Proceedings of the 35th Conference on Artificial Intelligence (AAAI 2021)},
	volume = {35},
	year = {2021},
	month = {2021},
	pages = {10102-10110},
	abstract = {<p>\&nbsp;Identifying the best arm of a multi-armed bandit is a central problem in bandit optimization. We study a quantum computational version of this problem with coherent oracle access to states encoding the reward probabilities of each arm as quantum amplitudes. Specifically, we show that we can find the best arm with fixed confidence using O~(\&sum;ni=2Δ\&minus;2i\&minus;\&minus;\&minus;\&minus;\&minus;\&minus;\&minus;\&minus;\&radic;) quantum queries, where Δi represents the difference between the mean reward of the best arm and the ith-best arm. This algorithm, based on variable-time amplitude amplification and estimation, gives a quadratic speedup compared to the best possible classical result. We also prove a matching quantum lower bound (up to poly-logarithmic factors).</p>},
	url = {https://ojs.aaai.org/index.php/AAAI/article/view/17212},
	author = {Daochen Wang and Xuchen You and Tongyang Li and Andrew M. Childs}
}
