# Bandit Algorithm Driven by a Classical Random Walk and a Quantum Walk

arXiv: https://arxiv.org/abs/2304.10118 · HTML: https://mlsanity.com/paper/2304.10118/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- Builds on 1 of its 48 references that are in the map.
- First posted on arXiv 20 Apr 2023.

## Builds on (most cited first, 1 of 1)

- [Lively quantum walks on cycles](https://mlsanity.com/paper/1512.02802/) (2015)

## Built on by (most cited first, 2 of 2)

- [Quantum spatial best-arm identification via quantum walks](https://mlsanity.com/paper/2509.05890/) (2025)
- [Autocorrelation effects in a stochastic-process model for solving two-armed bandit problems](https://mlsanity.com/paper/2603.05559/) (2026)

## Abstract (arXiv)

Quantum walks (QWs) have a property that classical random walks (RWs) do not possess -- the coexistence of linear spreading and localization -- and this property is utilized to implement various kinds of applications. This paper proposes RW- and QW-based algorithms for multi-armed-bandit (MAB) problems. We show that, under some settings, the QW-based model realizes higher performance than the corresponding RW-based one by associating the two operations that make MAB problems difficult -- exploration and exploitation -- with these two behaviors of QWs.