Related papers: One Dimensional Quantum Walks with Memory
We introduce a one-dimensional random walk, which at each step performs a reinforced dynamics with probability $\theta$ and with probability $1 - \theta$, the random walk performs a step independent of the past. We analyse its asymptotic…
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…
We consider the 2D alternate quantum walk on a cylinder. We concentrate on the study of the motion along the open dimension, in the spirit of looking at the closed coordinate as a small or "hidden" extra dimension. If one starts from…
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…
Multi-dimensional quantum walks usually require large coin spaces. Here we show that the non-localized case of the spatial density probability of the two-dimensional Grover walk can be obtained using only a two-dimensional coin space and a…
We show that discrete-time quantum walks on the line, $\mathbb{Z}$, behave as "the quantum tunneling". In particular, quantum walkers can tunnel through a double-well with the transmission probability $1$ under a mild condition. This is a…
We analyze the role of dimensionality in the time evolution of discrete time quantum walks through the example of the three-state walk on a two-dimensional, triangular lattice. We show that the three-state Grover walk does not lead to…
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…
We outline basic properties of a symmetric random walk in one dimension, in which the length of the nth step equals lambda^n, with lambda<1. As the number of steps N-->oo, the probability that the endpoint is at x, P_{lambda}(x;N),…
The question of whether quantum spatial search in two dimensions can be made optimal has long been an open problem. We report progress towards its resolution by showing that the oracle complexity for target location can be made optimal, by…
Consider a randomly-oriented two dimensional Manhattan lattice where each horizontal line and each vertical line is assigned, once and for all, a random direction by flipping independent and identically distributed coins. A deterministic…
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…
This note introduces some examples of quantum random walks in d-dimensional Eucilidean space and proves the weak convergence of their rescaled n-step densities. One of the examples is called the Plancherel quantum walk because the "quantum…
Simple random walks are a basic staple of the foundation of probability theory and form the building block of many useful and complex stochastic processes. In this paper we study a natural generalization of the random walk to a process in…
A quantum computing algorithm for rhythm generation is presented, which aims to expand and explore quantum computing applications in the arts, particularly in music. The algorithm maps quantum random walk trajectories onto a rhythmspace --…
We study a symmetric random walk (RW) in one spatial dimension in environment, formed by several zones of finite width, where the probability of transition between two neighboring points and corresponding diffusion coefficient are…
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…
Quantum walks are considered in a one-dimensional random medium characterized by static or dynamic disorder. Quantum interference for static disorder can lead to Anderson localization which completely hinders the quantum walk and it is…
In this work, we study the effect of a moving detector on a discrete time one dimensional Quantum Random Walk where the movement is realized in the form of hopping/shifts. The occupation probability $f(x,t;n,s)$ is estimated as the number…
We report on the possibility of controlling quantum random walks with a step-dependent coin. The coin is characterized by a (single) rotation angle. Considering different rotation angles, one can find diverse probability distributions for…