One-dimensional quantum walks with two-step memory

Jing-Feng Wu, Peng Xu, Xuanmin Zhu

Daniel ben‐Avraham, Eric M. Bollt, Christino Tamon

Michael Mc Gettrick

We investigate the quantum versions of a one-dimensional random walk, whose corresponding Markov Chain is of order 2. This corresponds to the walk having a memory of one previous step. We derive the amplitudes and probabilities for these walks, and point out how they differ from both classical random walks, and quantum walks without memory.

Chris Jones

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.

Daniel ben‐Avraham, Eric M. Bollt, Christino Tamon

João Fernando Doriguello Diniz