Related papers: Limiting distributions of ergodic continuous-time …
Focusing on a continuous-time quantum walk on $\mathbb{Z}=\left\{0,\pm 1,\pm 2,\ldots\right\}$, we analyze a probability distribution with which the quantum walker is observed at a position. The walker launches off at a localized state and…
We consider continuous-time random walk models described by arbitrary sojourn time probability density functions. We find a general expression for the distribution of time-averaged observables for such systems, generalizing some recent…
We investigate the equidistribution of the eigenfunctions on quantum graphs in the high-energy limit. Our main result is an estimate of the deviations from equidistribution for large well-connected graphs. We use an exact field-theoretic…
We set the ground for a theory of quantum walks on graphs- the generalization of random walks on finite graphs to the quantum world. Such quantum walks do not converge to any stationary distribution, as they are unitary and reversible.…
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…
We construct a new type of quantum walks on simplicial complexes as a natural extension of the well-known Szegedy walk on graphs. One can numerically observe that our proposing quantum walks possess linear spreading and localization as in…
Motivated by a model presented by S. Gudder, we study a quantum generalization of Markov chains and discuss the relation between these maps and open quantum random walks, a class of quantum channels described by S. Attal et al. We consider…
In this note, we discuss a general definition of quantum random walks on graphs and illustrate with a simple graph the possibility of very different behavior between a classical random walk and its quantum analogue. In this graph,…
The method of the quantum probability theory only requires simple structural data of graph and allows us to avoid a heavy combinational argument often necessary to obtain full description of spectrum of the adjacency matrix. In the present…
Quantum walks are standard tools for searching graphs for marked vertices, and they often yield quadratic speedups over a classical random walk's hitting time. In some exceptional cases, however, the system only evolves by sign flips,…
We study the semiclassical behaviour of eigenfunctions of quantum systems with ergodic classical limit. By the quantum ergodicity theorem almost all of these eigenfunctions become equidistributed in a weak sense. We give a simple derivation…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
Random walk models, such as the trap model, continuous time random walks, and comb models exhibit weak ergodicity breaking, when the average waiting time is infinite. The open question is: what statistical mechanical theory replaces the…
Recently, random walks on dynamic graphs have been studied because of their adaptivity to the time-varying structure of real-world networks. In general, there is a tremendous gap between static and dynamic graph settings for the lazy simple…
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…
A quantum walk is the quantum analogue of a random walk. While it is relatively well understood how quantum walks can speed up random walk hitting times, it is a long-standing open question to what extent quantum walks can speed up the…
We study the analogues of irreducibility, period, and communicating classes for open quantum random walks, as defined by Attal et al. (J. Stat. Phys., 2012). We recover results similar to the standard ones for Markov chains, in terms of…
We quantitatively differentiate between the spreads of discrete-time quantum and classical random walks on a cyclic graph. Due to the closed nature of any cyclic graph, there is additional "collision"- like interference in the quantum…
For a continuous-time quantum walk on a line the variance of the position observable grows quadratically in time, whereas, for its classical counterpart on the same graph, it exhibits a linear, diffusive, behaviour. A quantum walk, thus,…
Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the…