mlsanityData to 7 Oct 2026

Quantum Bandits

arXiv 2002.06395 ↗First posted 15 Feb 2020cs.LG cs.AI quant-phcited by 18

Not on the map. Why?

Abstract (arXiv)

We consider the quantum version of the bandit problem known as em best arm identification (BAI). We first propose a quantum modeling of the BAI problem, which assumes that both the learning agent and the environment are quantum; we then propose an algorithm based on quantum amplitude amplification to solve BAI. We formally analyze the behavior of the algorithm on all instances of the problem and we show, in particular, that it is able to get the optimal solution quadratically faster than what is known to hold in the classical case.

Key facts. Cited by 18 papers in the map (data through 7 Oct 2026). First posted on arXiv 15 Feb 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 1; 2023: 7; 2024: 0; 2025: 5; 2026: 4.

18 papers.

Sort: