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

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

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. W...

Full description

Bibliographic Details
Main Authors: Tomoki Yamagami, Etsuo Segawa, Takatomo Mihana, André Röhm, Ryoichi Horisaki, Makoto Naruse
Format: Article
Language:English
Published: MDPI AG 2023-05-01
Series:Entropy
Subjects:
random walk
quantum walk
bandit algorithm
exploration–exploitation trade-off
decision-making
Online Access:https://www.mdpi.com/1099-4300/25/6/843

Internet

https://www.mdpi.com/1099-4300/25/6/843

Similar Items