189 citations · 569 across the 89 of their papers we have counts for
96 papers
Interpolating walk between discrete-time quantum walk and its intrinsic random walk on graph
Yusuke Higuchi, Etsuo Segawa, Honoka Shiratori +1
We consider an interpolation with the parameter between the discrete-time quantum () and its intrinsic random () walks on a finite connected graph. Its time…
Entanglement entropy in two-particle Grover walks on graphs
Sho Kubota, Haruhiko Matsubara, Etsuo Segawa
We define a two-particle quantum walk of identical particles on a graph via the one-particle Grover walk on the Kronecker product , and call it the two-particle Gr…
Quantum spatial best-arm identification via quantum walks
Tomoki Yamagami, Etsuo Segawa, Takatomo Mihana +3
Quantum reinforcement learning has emerged as a framework combining quantum computation with sequential decision-making, and applications to the multi-armed bandit (MAB) problem ha…
Multi-player conflict avoidance through entangled quantum walks
Honoka Shiratori, Tomoki Yamagami, Etsuo Segawa +3
Quantum computing has the potential to solve complex problems faster and more efficiently than classical computing. It can achieve speedups by leveraging quantum phenomena like sup…
Normal variance mixture with arcsine law of an interpolating walk between persistent random walk and quantum walk
Saori Yoshino, Honoka Shiratori, Tomoki Yamagami +2
We propose a model that interpolates between quantum walks and persistent (correlated) random walks using one parameter on the one-dimensional lattice. We show that the limit distr…
Comfortability of quantum walks on embedded graphs on surfaces
Yusuke Higuchi, Etsuo Segawa
The time evolutions of discrete-time quantum walks on graphs are determined by the local adjacency relations of the graphs. In this paper, first, we construct a discrete-time quant…