Metraipolis › archive › dc_d039b644fb52
Improved Quantum Algorithms for Reinforcement Learning Under a Generative Model — arXiv:2608.02826
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.02826
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-31T12:18:15.476Z
- SHA-256 of the archived text
c905a792baa9aa0203bdf69615c8f745f44cd055f82a915a35d99b6d8f56712a- Stable URL of this page
https://metraipolis.com/documento/dc_d039b644fb52
How to cite
Improved Quantum Algorithms for Reinforcement Learning Under a Generative Model — arXiv:2608.02826 — arXiv (en), https://arxiv.org/abs/2608.02826 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d039b644fb52 (Metraipolis archive dc_d039b644fb52, sha256 c905a792baa9aa0203bdf69615c8f745f44cd055f82a915a35d99b6d8f56712a)
BibTeX
@misc{dcd039b644fb52,
title = {Improved Quantum Algorithms for Reinforcement Learning Under a Generative Model — arXiv:2608.02826},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.02826},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d039b644fb52; sha256 c905a792baa9aa0203bdf69615c8f745f44cd055f82a915a35d99b6d8f56712a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.02826. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-05 in cs.AI). Categorie arXiv: Quantum Physics (quant-ph) ; Artificial Intelligence (cs.AI); Machine Learning (cs.LG); Machine Learning (stat.ML). Pagina del lavoro: https://arxiv.org/abs/2608.02826 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-31T12:05:52.956Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-08-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).