QSBAI applies quantum walks to best-arm identification on general graphs, deriving maximal success probability and optimal time steps for complete and bipartite cases.
Auer, Using confidence bounds for exploitation- exploration trade-offs, Journal of machine learning re- search3, 397 (2002)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Quantum spatial best-arm identification via quantum walks
QSBAI applies quantum walks to best-arm identification on general graphs, deriving maximal success probability and optimal time steps for complete and bipartite cases.