Related papers: Non-uniform mixing of quantum walk on cycles
In this paper, we study the properties of lackadaisical quantum walks on a line. This model is first proposed in~\cite{wong2015grover} as a quantum analogue of lazy random walks where each vertex is attached $\tau$ self-loops. We derive an…
Quantum particles are known to be faster than classical when they propagate stochastically on certain graphs. A time needed for a particle to reach a target node on a distance, the hitting time, can be exponentially less for quantum walks…
Random walks represent an important tool for probing the structural and dynamical properties of networks and modeling transport and diffusion processes on networks. However, when individuals' movement becomes dictated by more complicated…
We study the effect of small decoherence in continuous-time quantum walks on long-range interacting cycles, which are constructed by connecting all the two nodes of distance m on the cycle graph. In our investigation, each node is…
A continuous-time quantum walk is modelled using a graph. In this short paper, we provide lower bounds on the size of a graph that would allow for some quantum phenomena to occur. Among other things, we show that, in the adjacency matrix…
A random walk scheme, consisting of alternating phases of regular Brownian motion and L\'evy walks, is proposed as a model for run-and-tumble bacterial motion. Within the continuous-time random walk approach we obtain the long-time and…
A connection between the asymptotic behavior of the open quantum walk and the spectrum of a generalized quantum coins is studied. For the case of simultaneously diagonalizable transition operators an exact expression for probability…
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…
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 study the distributions of the continuous-time quantum walk on a one-dimensional lattice. In particular we will consider walks on unbounded lattices, walks with one and two boundaries and Dirichlet boundary conditions, and walks with…
Coherent evolution governs the behaviour of all quantum systems, but in nature it is often subjected to influence of a classical environment. For analysing quantum transport phenomena quantum walks emerge as suitable model systems. In…
We study the model of quantum walks on cycles enriched by the addition of 1-step memory. We provide a formula for the probability distribution and the time-averaged limiting probability distribution of the introduced quantum walk. Using the…
The quantum random walk has been much studied recently, largely due to its highly nonclassical behavior. In this paper, we study one possible route to classical behavior for the discrete quantum walk on the line: the presence of decoherence…
We present a generalized definition of discrete-time quantum walks convenient for capturing a rather broad spectrum of walker's behavior on arbitrary graphs. It includes and covers both: the geometry of possible walker's positions with…
Quantum walk acts obviously different from its classical counterpart, but decoherence will lessen and close the gap between them. To understand this process, it is necessary to investigate the evolution of quantum walk under different…
Random walk has wide applications in many fields, such as machine learning, biology, physics, and chemistry. Random walk can be discrete or continuous in time and space. Asymmetric random walk could be described by drift-diffusion equation.…
Quantum random walks have received much interest due to their non-intuitive dynamics, which may hold the key to a new generation of quantum algorithms. What remains a major challenge is a physical realization that is experimentally viable…
Quantum walks have emerged as an interesting alternative to the usual circuit model for quantum computing. While still universal for quantum computing, the quantum walk model has very different physical requirements, which lends itself more…
We show that particle transport in a uniform, quantum multi-baker map, is generically ballistic in the long time limit, for any fixed value of Planck's constant. However, for fixed times, the semi-classical limit leads to diffusion. Random…
The fundamental problem of sampling from the limiting distribution of quantum walks on networks, known as \emph{mixing}, finds widespread applications in several areas of quantum information and computation. Of particular interest in most…