Related papers: Quantum walks: the first detected passage time pro…
Properties of the probability distribution generated by a discrete-time quantum walk, such as the number of peaks it contains, depend strongly on the choice of the initial condition. In the present paper we discuss from this point of view…
We investigate first-passage statistics of an ensemble of N noninteracting random walks on a line. Starting from a configuration in which all particles are located in the positive half-line, we study S_n(t), the probability that the nth…
A randomly walking quantum particle evolving by Schr\"odinger's equation searches for a unique marked vertex on the "simplex of complete graphs" in time $\Theta(N^{3/4})$. In this paper, we give a weighted version of this graph that…
The first passage time (FPT) for random walks is a key indicator of how fast information diffuses in a given system. Despite the role of FPT as a fundamental feature in transport phenomena, its behavior, particularly in heterogeneous…
The position density of a "particle" performing a continuous-time quantum walk on the integer lattice, viewed on length scales inversely proportional to the time t, converges (as t tends to infinity) to a probability distribution that…
In this study, we investigate the emergence of the quantum boomerang effect in discrete-time quantum walks (DTQWs) subjected to random phase disorder. Our analysis shows that this effect can arise solely from the intrinsic momentum dynamics…
We solve an open problem by constructing quantum walks that not only detect but also find marked vertices in a graph. In the case when the marked set $M$ consists of a single vertex, the number of steps of the quantum walk is quadratically…
We study first-passage statistics for one-dimensional random walks $S_n$ with independent and identically distributed jumps starting from the origin. We focus on the joint distribution of the first-passage time $\tau_b$ and first-passage…
We explore a discrete-time, coined quantum walk on a quantum network where the coherent superposition of walker-moves originates from the unitary interaction of the walker-coin with the qubit degrees of freedom in the quantum network. The…
This work focuses on the quantum mixing time, which is crucial for efficient quantum sampling and algorithm performance. We extend Richter's previous analysis of continuous time quantum walks on the periodic lattice $\mathbb{Z}_{n_1}\times…
Interplay between quantum interference and classical randomness can enhance performance of various quantum information tasks. In the present paper we analyze recurrence phenomena in the discrete-time quantum stochastic walk on a line, which…
We consider discrete-time nearest-neighbor quantum walks on random environments in one dimension. Using the method based on a path counting, we present both quenched and annealed weak limit theorems for the quantum walk.
We investigate the role of a time and spin-dependent phase shift on the evolution of one-dimensional discrete-time quantum walks. By employing Floquet engineering, a time and spin-dependent phase shift ($\phi$) is imprinted onto the…
A one-dimensional quantum oscillator is monitored by taking repeated position measurements. As a first con- tribution, it is shown that, under a quantum nondemolition measurement scheme applied to a system initially at the ground state, (i)…
Restart is a common strategy observed in nature that accelerates first-passage processes and has been extensively studied using classical random walks. In the quantum regime, restart in continuous-time quantum walks (CTQWs) has been shown…
The quantum Zeno effect consists in the hindrance of the evolution of a quantum system that is very frequently monitored and found to be in its initial state at every single measurement. On the basis of the correct formula for the survival…
Discrete-time quantum walks (DTQWs) in random artificial electric and gravitational fields are studied analytically and numerically. The analytical computations are carried by a new method which allows a direct exact analytical…
This paper presents a simple model that mimics quantum mechanics (QM) results in terms of probability fields of free particles subject to self-interference, without using Schr\"{o}dinger equation or wavefunctions. Unlike the standard QM…
We consider $N$ non-interacting fermions performing continuous-time quantum walks on a one-dimensional lattice. The system is launched from a most compact configuration where the fermions occupy neighboring sites. We calculate exactly the…
Quantum algorithms have demonstrated provable speedups over classical counterparts, yet establishing a comprehensive theoretical framework to understand the quantum advantage remains a core challenge. In this work, we decode the quantum…