Quantum walks, the quantum mechanical counterpart of classical random walks, is an
advanced tool for building quantum algorithms that has been recently shown to constitute a …

Classical first-passage times under restart are used in a wide variety of models, yet the
quantum version of the problem still misses key concepts. We study the quantum hitting time …

Repeatedly monitored quantum walks with a rate 1/τ yield discrete-time trajectories which
are inherently random. With these paths the first-hitting time with sharp restart is studied. We …

In the present paper, we construct QMCs (Quantum Markov Chains) associated with Open
Quantum Random Walks such that the transition operator of the chain is defined by OQRW …

We provide a general framework to compute the probability distribution $ F_ r (t) $ of the first
detection time of a'state of interest'in a closed quantum system subjected to random …

The problem of the time of arrival of a quantum system in a specified state is considered in
the framework of the repeated measurement protocol and in particular the limit of continuous …

We study a quantum walk of a single particle that is subject to stroboscopic projective
measurements on a graph with two sites. This two-level system is the minimal model of a …

The first detection of a quantum particle on a graph is shown to depend sensitively on the
distance ξ between the detector and initial location of the particle, and on the sampling time …

Recurrence is an interesting property that describes whether the walker will eventually
return to the origin on infinite lattices in classical random walks. Since measurement …

Even after decades of research, the problem of first passage time statistics for quantum
dynamics remains a challenging topic of fundamental and practical importance. Using a …