Related papers: Pseudo Memory Effects, Majorization and Entropy in…
Here, a new two-dimensional process, discrete in time and space, that yields the results of both a random walk and a quantum random walk, is introduced. This model describes the population distribution of four coin states |1>,-|1>, |0> -|0>…
We study a family of correlated one-dimensional random walks with a finite memory range M.These walks are extensions of the Taylor's walk as investigated by Goldstein, which has a memory range equal to one. At each step, with a probability…
This tutorial article showcases the many varieties and uses of quantum walks. Discrete time quantum walks are introduced as counterparts of classical random walks. The emphasis is on the connections and differences between the two types of…
The idea that the search efficiency can be increased with the help of a number of autonomous agents is often relevant in many situations, which is known among biologists and roboticists as a stigmergy. This is due to the fact that, in any…
The evolution of a walker in standard "Discrete-time Quantum Walk (DTQW)" is determined by coin and shift unitary operators. The conditional shift operator shifts the position of the walker to right or left by unit step size while the…
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…
The development of quantum walks in the context of quantum computation, as generalisations of random walk techniques, led rapidly to several new quantum algorithms. These all follow unitary quantum evolution, apart from the final…
A random walk is known as a random process which describes a path including a succession of random steps in the mathematical space. It has increasingly been popular in various disciplines such as mathematics and computer science.…
We introduce the Peierls substitution to a two-dimensional discrete-time quantum walk on a square lattice to examine the spreading dynamics and the coin-position entanglement in the presence of an artificial gauge field. We use the ratio of…
A quantum central limit theorem for a continuous-time quantum walk on a homogeneous tree is derived from quantum probability theory. As a consequence, a new type of limit theorems for another continuous-time walk introduced by the walk is…
We advance the previous studies of quantum walks on the line with two coins. Such four-state quantum walks driven by a three-direction shift operator may have nonzero stationary distributions (localization), thus distinguishing themselves…
Lazy quantum walks were presented by Andrew M. Childs to prove that the continuous-time quantum walk is a limit of the discrete-time quantum walk [Commun.Math.Phys.294,581-603(2010)]. In this paper, we discuss properties of lazy quantum…
Quantum walks are quantum counterparts of random walks and their probability distributions are different from each other. A quantum walker distributes on a Hilbert space and it is observed at a location with a probability. The finding…
We construct a quantum random walk algorithm, based on the Dirac operator instead of the Laplacian. The algorithm explores multiple evolutionary branches by superposition of states, and does not require the coin toss instruction of…
We discuss spreading estimates for dynamical systems given by the iteration of an extended CMV matrix. Using a connection due to Cantero--Gr\"unbaum--Moral--Vel\'azquez, this enables us to study spreading rates for quantum walks in one…
Quantum walk (QW) utilizes its internal quantum states to decide the displacement, thereby introducing single-particle entanglement between the internal and positional degrees of freedom. By simulating three variants of QW with the…
We investigate if the degradation of a quantum directional reference frame through repeated use can be modeled as a classical direction undergoing a random walk on a sphere. We demonstrate that the behaviour of the fidelity for a degrading…
Quantum walks, both discrete (coined) and continuous time, form the basis of several recent quantum algorithms. Here we use numerical simulations to study the properties of discrete, coined quantum walks. We investigate the variation in the…
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 study the evolution of quantum correlations in two-particle discrete-time non-unitary quantum walks on a line with gain and loss. The two particles are initially prepared in a maximally entangled state and evolve independently. Using…