Related papers: Continuous-time quantum walk on integer lattices a…
We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each. We are interested in walks that proceed from one half line, through…
This paper studies long range random walks on ${\mathbb{Z}_q}^d$. $X_{t+1} = X_t + Z_t \mod q$, with $(Z_t)$ independent and identically distributed. Multiple entries of $Z_t$ can be non-zero in a transition. An emphasis is on finding the…
In quantum computation theory, quantum random walks have been utilized by many quantum search algorithms which provide improved performance over their classical counterparts. However, due to the importance of the quantum decoherence…
Discrete-time quantum walks are considered a counterpart of random walks and the study for them has been getting attention since around 2000. In this paper, we focus on a quantum walk which generates a probability distribution splitting to…
We consider a non-homogeneous random walks system on $\bbZ$ in which each active particle performs a nearest neighbor random walk and activates all inactive particles it encounters up to a total amount of $L$ jumps. We present necessary and…
We consider the dynamical properties of Quantum Walks defined on the d-dimensional cubic lattice, or the homogeneous tree of coordination number 2d, with site dependent random phases, further characterised by transition probabilities…
We consider the discrete time quantum random walks on a Sierpinski gasket. We study the hitting probability as the level of fractal goes to infinity in terms of their localization exponents $\beta_w$ , total variation exponents $\delta_w$…
We define a discrete-time, coined quantum walk on weighted graphs that is inspired by Szegedy's quantum walk. Using this, we prove that many lackadaisical quantum walks, where each vertex has $l$ integer self-loops, can be generalized to a…
The cover-time problem, i.e., time to visit every site in a system, is one of the key issues of random walks with wide applications in natural, social, and engineered systems. Addressing the full distribution of cover times for random walk…
We discuss the model of a one-dimensional, discrete-time walk on a line with spatial heterogeneity in the form of a variable set of ultrametric barriers. Inspired by the homogeneous quantum walk on a line, we develop a formalism by which…
We undertake a detailed analysis of ergodicity for homogeneous discrete-time quantum walks on the integer lattice. The most significant result of our paper holds in dimension one, and gives a complete equivalence between the absolutely…
We investigate a space-inhomogeneous discrete-time quantum walk in one dimension. We show that the walk exhibits localization by a path counting method.
Recently, quantized versions of random walks have been explored as effective elements for quantum algorithms. In the simplest case of one dimension, the theory has remained divided into the discrete-time quantum walk and the continuous-time…
We consider the random walk in an independent and identically distributed (i.i.d.) random environment on a Cayley graph of a finite free product of copies of $\mathbb{Z}$ and $\mathbb{Z}_2$. Such a Cayley graph is readily seen to be a…
In this expository note, we study several families of periodic graphs which satisfy a sufficient condition for the ergodicity of the associated continuous-time quantum walk. For these graphs, we compute the limiting distribution of the walk…
We formulate a framework for discrete-time quantum walks, motivated by classical random walks with memory. We present a specific representation of the classical walk with memory 2 on which this is based. The framework has no need for coin…
We consider the group of permutations of the vertices of a lattice. A random walk is generated by unit steps that each interchange two nearest neighbor vertices of the lattice. We study the heat equation on the permutation group, using the…
We present an idea to convert to a unitary quantum walk any open quantum walk which is defined on lattices as well as on finite graphs. This approach generalizes to the domain of open quantum walks (or quantum Markov chains) the framework…
We study time-dependent discrete-time quantum walks on the one-dimensional lattice. We compute the limit distribution of a two-period quantum walk defined by two orthogonal matrices. For the symmetric case, the distribution is determined by…
Many classical randomized algorithms (e.g., approximation algorithms for #P-complete problems) utilize the following random walk algorithm for {\em almost uniform sampling} from a state space $S$ of cardinality $N$: run a symmetric ergodic…