Related papers: A deterministic walk on the randomly oriented Manh…
Multi-dimensional quantum walks can exhibit highly non-trivial topological structure, providing a powerful tool for simulating quantum information and transport systems. We present a flexible implementation of a 2D optical quantum walk on a…
A recently developed model of random walks on a $D$-dimensional hyperspherical lattice, where $D$ is {\sl not} restricted to integer values, is extended to include the possibility of creating and annihilating random walkers. Steady-state…
We consider a d-dimensional random quantum walk with site-dependent random coin operators. The corresponding transition coefficients are characterized by deterministic amplitudes times independent identically distributed site-dependent…
We focus on a 2-period time-dependent quantum walk on the half line in this paper. The quantum walker launches at the edge of the half line in a localized superposition state and its time evolution is carried out with two unitary operations…
We study the 2-dimensional uniform prudent self-avoiding walk, which assigns equal probability to all nearest-neighbor self-avoiding paths of a fixed length that respect the prudent condition, namely, the path cannot take any step in the…
In this paper, we study (1,2) and (2,1) random walks in varying environments on the lattice of positive half line. We assume that the transition probabilities at site $n$ are asymptotically constants as $n\rightarrow\infty.$ For (1,2)…
We consider a one-dimensional simple random walk killed by quenched soft obstacles. The position of the obstacles is drawn according to a renewal process with a power-law increment distribution. In a previous work, we computed the…
A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…
We give a lower bound for the non-collision probability up to a long time T in a system of n independent random walks with fixed obstacles on the two-dimensional lattice. By `collision' we mean collision between the random walks as well as…
We study the full distribution $P_M(S)$ of the number of distinct sites $S$ visited by a random walker on a $d$-dimensional lattice after $M$ steps. We focus on the case $d \ge 2$, and we are interested in the long-time limit $M \gg 1$. Our…
We consider the problem of walking in an unknown street, for a robot that has a minimal sensing capability. The robot is equipped with a sensor that only detects the discontinuities in depth information (gaps) and can locate the target…
We study a generalisation of the one-dimensional Rademacher random walk introduced in Bhattacharya and Volkov (2023) to $\mathbb{Z}^2$ (for $d\ge 3$, the Rademacher random walk is always transient, as follows from Theorem 8.8 in Englander…
The quantum walk dynamics obey the laws of quantum mechanics with an extra locality constraint, which demands that the evolution operator is local in the sense that the walker must visit the neighboring locations before endeavoring to…
Low-dimensional periodic arrays of scatterers with a moving point particle are ideal models for studying deterministic diffusion. For such systems the diffusion coefficient is typically an irregular function under variation of a control…
Quantum random walks, - coined, lattice ones, - exhibit ballistic behavior with fascinating asymptotic patterns of the amplitudes. We show that averaging over the coins (using the Haar measure), these patterns blend into a spline. Also, we…
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 recently demonstrated that standard fixed-time lattice random-walk models cannot be modified to properly represent biased diffusion processes in more than two dimensions. The origin of this fundamental limitation appears to be the fact…
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 a simple random walk W_i in 1 or 2 dimensions, in which the walker may choose to stand still for a limited time. The time horizon is n, the maximum consecutive time steps which can be spent standing still is m_n and the goal is…
We propose a novel implementation of discrete time quantum walks for a neutral atom in an array of optical microtraps or an optical lattice. We analyze a one-dimensional walk in position space, with the coin, the additional qubit degree of…