QSBAI applies quantum walks to best-arm identification on general graphs, deriving maximal success probability and optimal time steps for complete and bipartite cases.
Szegedy, Quantum speed-up of Markov chain based algorithms, inProceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2004)(2004) pp
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.