Related papers: P\'olya number of continuous-time quantum walks
We analyze the recurrence probability (P\'olya number) for d-dimensional unbiased quantum walks. A sufficient condition for a quantum walk to be recurrent is derived. As a by-product we find a simple criterion for localisation of quantum…
The P\'olya number characterizes the recurrence of a random walk. We apply the generalization of this concept to quantum walks [M. \v{S}tefa\v{n}\'ak, I. Jex and T. Kiss, Phys. Rev. Lett. \textbf{100}, 020501 (2008)] which is based on a…
Recurrence in the classical random walk is well known and described by the P\'olya number. For quantum walks, recurrence is similarly understood in terms of the probability of a localized quantum walker to return to its origin. Under…
Quantum recurrence theorem holds for quantum systems with discrete energy eigenvalues and fails to hold in general for systems with continuous energy. We show that during quantum walk process dominated by interference of amplitude…
The study of recurrences and revivals in quantum systems has attracted a great deal of interest because of its importance in the control of quantum systems and its potential use in developing new technologies. In this work, we introduce a…
The recurrence properties of random walks can be characterized by P\'{o}lya number, i.e., the probability that the walker has returned to the origin at least once. In this paper, we consider recurrence properties for a general 1D random…
The P\'olya urn scheme is a discrete-time process concerning the addition and removal of colored balls. There is a known embedding of it in continuous-time, called the P\'olya process. We deal with a generalization of this stochastic model,…
The Polya number of a classical random walk on a regular lattice is known to depend solely on the dimension of the lattice. For one and two dimensions it equals one, meaning unit probability to return to the origin. This result is extremely…
We consider the simple random walk (or P\'olya walk) on the one-dimensional lattice subject to stochastic resetting to the origin with probability $r$ at each time step. The focus is on the joint statistics of the numbers…
Monitored recurrence of a one-parameter set of three-state quantum walks on a line is investigated. The calculations are considerably simplified by choosing a suitable basis of the coin space. We show that the Polya number (i.e. the site…
A discrete time quantum walk is considered in which the step lengths are chosen to be either $1$ or $2$ with the additional feature that the walker is persistent with a probability $p$. This implies that with probability $p$, the walker…
First, we prove a \emph{local almost sure central limit theorem} for lattice random walks in the plane. The corresponding version for random walks in the line was considered by the author in \cite{5}. This gives us a quantitative version of…
We consider open quantum walks on a graph, and consider the random variables defined as the passage time and number of visits to a given point of the graph. We study in particular the probability that the passage time is finite, the…
We study the problem of site recurrence of discrete time nearest neighbor open quantum random walks (OQWs) on the integer line, proving basic properties and some of its relations with the corresponding problem for unitary (coined) quantum…
We present analytical treatment of quantum walks on a cycle graph. The investigation is based on a realistic physical model of the graph in which decoherence is induced by continuous monitoring of each graph vertex with nearby quantum point…
Recurrence of a random walk is described by the Polya number. For quantum walks, recurrence is understood as the return of the walker to the origin, rather than the full-revival of its quantum state. Localization for two dimensional quantum…
We study the first detected recurrence time problem of continuous-time quantum walks on graphs. While previous works have employed projective measurements to determine the first return time, we implement a protocol based on weak…
We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…
Quantum walk is one of the main tools for quantum algorithms. Defined by analogy to classical random walk, a quantum walk is a time-homogeneous quantum process on a graph. Both random and quantum walks can be defined either in continuous or…
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…