Cargando…

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

Descripción completa

Detalles Bibliográficos
Autores principales: Yamagami, Tomoki, Segawa, Etsuo, Mihana, Takatomo, Röhm, André, Horisaki, Ryoichi, Naruse, Makoto
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2023
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10297529/
https://www.ncbi.nlm.nih.gov/pubmed/37372187
http://dx.doi.org/10.3390/e25060843
Descripción
Sumario: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.