Speaker
Dr
Karol Capała
(AGH University of Krakow)
Description
Szegedy quantum walks represent a generalization of discrete random walks to the quantum domain, finding broad applications in quantum computing. Recent studies have demonstrated that classical resetting mechanisms can accelerate the arrival of a particle at its target, even in the context of quantum walks. This poster presents an approach to introducing purely quantum resetting into Szegedy walks. Furthermore, it investigates how resetting affects key quantities characterizing the problem of reaching a selected vertex for various graph types, including hitting times and vertex occupation probabilities.
Primary author
Dr
Karol Capała
(AGH University of Krakow)
Co-authors
Ms
Weronika Witek
(AGH University of Krakow)
Dr
Katarzyna Rycerz
(AGH University of Krakow)
