We examine a discrete-time quantum walk with two-step memory for a particle on a onedimensional infinite space. The walk is defined with a four-state memory space analogous to the two-state coin space commonly used in discrete time quantum walks, and a method is presented for calculating the time evolution by using the Fourier transform. An integral expression for the probability is calculated, and this is used to produce numerical solutions for the probability distribution as a function of the time step and position. The results show two peaks in the probability distribution. One peak propagates ballistically with time, which is a common feature of quantum walks. The other peak is stationary with time and located at the initial site of the particle. This feature is not common in quantum walks and suggests that tracing the immediate history of the particle using two-step memory may represent the beginning of a transition to a classical system.
We examine a discrete-time quantum walk with two-step memory for a particle on a onedimensional infinite space. The walk is defined with a four-state memory space analogous to the two-state coin space commonly used in discrete time quantum walks, and a method is presented for calculating the time evolution by using the Fourier transform. An integral expression for the probability is calculated, and this is used to produce numerical solutions for the probability distribution as a function of the time step and position. The results show two peaks in the probability distribution. One peak propagates ballistically with time, which is a common feature of quantum walks. The other peak is stationary with time and located at the initial site of the particle. This feature is not common in quantum walks and suggests that tracing the immediate history of the particle using two-step memory may represent the beginning of a transition to a classical system.
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 spaces, it imposes no constraints on the evolution operator other than unitarity, and is unifying of other approaches. As an example we construct a symmetric discrete-time quantum walk on the semi-infinite binary tree. The generating function of the amplitude at the root is computed in closed form, as a function of time and the initial level n in the tree, and we find the asymptotic and a full numerical solution for the amplitude. It exhibits a sharp interference peak and a power-law tail, as opposed to the exponentially decaying tail of a broadly peaked distribution of the classical symmetric random walk on a binary tree. The probability peak is orders of magnitude larger than it is for the classical walk (already at small n). The quantum walk shows a polynomial algorithmic speedup in n over the classical walk, which we conjecture to be of the order 2/3, based on strong trends in data.
In this paper we focus our attention on a particle that follows a unidirectional quantum walk, an alternative version of the currently widespread discrete-time quantum walk on a line. Here the walker at each time step can either remain in place or move in a fixed direction, e.g., rightward or upward. While both formulations are essentially equivalent, the present approach leads us to consider discrete Fourier transforms, which eventually results in obtaining explicit expressions for the wave functions in terms of finite sums and allows the use of efficient algorithms based on the fast Fourier transform. The wave functions here obtained govern the probability of finding the particle at any given location but determine as well the exit-time probability of the walker from a fixed interval, which is also analyzed.
Quantum walk (QW) is the quantum analog of the random walk. QW is an integral part of the development of numerous quantum algorithms. Hence, an in-depth understanding of QW helps us to grasp the quantum algorithms. We revisit the one-dimensional discrete-time QW and discuss basic steps in detail by incorporating the most general coin operator, constant in both space and time, and a localized initial state using numerical modeling. We investigate the impact of each parameter of the general coin operator on the probability distribution of the quantum walker. We show that by tuning the parameters of the general coin, one can regulate the probability distribution of the walker. We provide an algorithm for the one-dimensional quantum walk driven by the general coin operator. The study on general coin operators also includes the popular coins – Hadamard, Grover, and Fourier.
We introduce the concept of a quantum walk with two particles and study it for the case of a discrete time walk on a line. A quantum walk with more than one particle may contain entanglement, thus offering a resource unavailable in the classical scenario and which can present interesting modifications on quantum walks with single particles. In this work, we show both numerically and analytically how the entanglement and the relative phase between the states describing the coin degree of freedom of each particle will influence the evolution of the quantum walk. In particular, the probability to find at least one particle in a certain position after N steps of the walk, as well as the average distance and the squared distance between the two particles, can be larger or smaller than the case of two unentangled particles, depending on the initial conditions we choose. This resource can then be tuned according to our needs to modify the features of a quantum walk. Experimental implementations are briefly discussed.
We investigate the ballistic spreading behavior of the one-dimensional discrete time quantum walks whose time evolution is driven by any balanced quantum coin. We obtain closed-form expressions for the long-time variance of position of quantum walks starting from any initial qubit (spin-1/2 particle) and position states following a delta-like (local), Gaussian and uniform probability distributions. By averaging over all spin states, we find out that the average variance of a quantum walk starting from a local state is independent of the quantum coin, while from Gaussian and uniform states it depends on the sum of relative phases between spin states given by the quantum coin, being non-dispersive for a Fourier walk and large initial dispersion. We also perform numerical simulations of the average probability distribution and variance along the time to compare them with our analytical results.
We study the asymptotic position distribution of general quantum walks on a lattice, including walks with a random coin, which is chosen from step to step by a general Markov chain. In the unitary (i.e., nonrandom) case, we allow any unitary operator which commutes with translations and couples only sites at a finite distance from each other. For example, a single step of the walk could be composed of any finite succession of different shift and coin operations in the usual sense, with any lattice dimension and coin dimension. We find ballistic scaling and establish a direct method for computing the asymptotic distribution of position divided by time, namely as the distribution of the discrete time analog of the group velocity. In the random case, we let a Markov chain (control process) pick in each step one of finitely many unitary walks, in the sense described above. In ballistic order, we find a nonrandom drift which depends only on the mean of the control process and not on the initial state. In diffusive scaling, the limiting distribution is asymptotically Gaussian, with a covariance matrix (diffusion matrix) depending on momentum. The diffusion matrix depends not only on the mean but also on the transition rates of the control process. In the nonrandom limit, i.e., when the coins chosen are all very close or the transition rates of the control process are small, leading to long intervals of ballistic evolution, the diffusion matrix diverges. Our method is based on spatial Fourier transforms, and the first and second order perturbation theory of the eigenvalue 1 of the transition operator for each value of the momentum.