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...
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 |
Ejemplares similares
-
Asymmetric quantum decision-making
por: Shiratori, Honoka, et al.
Publicado: (2023) -
Pairing Optimization via Statistics: Algebraic Structure in Pairing Problems and Its Application to Performance Enhancement
por: Fujita, Naoki, et al.
Publicado: (2023) -
Decision making for large-scale multi-armed bandit problems using bias control of chaotic temporal waveforms in semiconductor lasers
por: Morijiri, Kensei, et al.
Publicado: (2022) -
Acceleration of Approximate Matrix Multiplications on GPUs
por: Okuyama, Takuya, et al.
Publicado: (2023) -
Random walk with chaotically driven bias
por: Kim, Song-Ju, et al.
Publicado: (2016)