Limit theorems for quantum walks with memory

Physical Review E, 2004

We formulate and prove a general weak limit theorem for quantum random walks in one and more dimensions. With X n denoting position at time n, we show that X n /n converges weakly as n → ∞ to a certain distribution which is absolutely continuous and of bounded support. The proof is rigorous and makes use of Fourier transform methods. This approach simplifies and extends certain preceding derivations valid in one dimension that make use of combinatorial and path integral methods.

2013

The discrete time quantum walk defined as a quantum-mechanical analogue of the discrete time random walk have recently been attracted from various and interdisciplinary fields. In this review, the weak limit theorem, that is, the asymptotic behavior, of the one-dimensional discrete time quantum walk is analytically shown. From the limit distribution of the discrete time quantum walk, the discrete time quantum walk can be taken as the quantum dynamical simulator of some physical systems. *

Quantum Information Processing, 2012

The discrete time quantum walk which is a quantum counterpart of random walk plays important roles in the theory of quantum information theory. In the present paper, we focus on discrete time quantum walks viewed as quantization of random walks on the path. We obtain a weak limit theorem for the time averaged distribution of our quantum walks.

We consider a discrete-time 2-state quantum walk on the line. The state of the quantum walker evolves according to a rule which is determined by a coin-flip operator and a position-shift operator. In this paper we take a 3-periodic time evolution as the rule. For such a quantum walk, we get a limit distribution which expresses the asymptotic behavior of the walker after a long time. The limit distribution is different from that of a time-independent quantum walk or a 2-period time-dependent quantum walk. We give some analytical results and then consider a number of variants of our model and indicate the result of simulations for these ones.

2010

Recurrence of a random walk is described by the Pólya number. For quantum walks, recurrence is understood as the return of the walker to the origin, rather than the full-revival of its quantum state. Localization for two dimensional quantum walks is known to exist in the sense of non-vanishing probability distribution in the asymptotic limit. We show on the example of the 2-D Grover walk that one can exploit the effect of localization to construct stationary solutions. Moreover, we find full-revivals of a quantum state with a period of two steps. We prove that there cannot be longer cycles for a four-state quantum walk. Stationary states and revivals result from interference which has no counterpart in classical random walks.

2010

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 up to two previous steps. 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.

arXiv (Cornell University), 2011

We study the discrete-time quantum walk in one-dimension governed by the Fibonacci transformation . We show localization does not occur for the Fibonacci quantum walk by investigating the stationary distribution of the walk, in addition, we obtain the weak limit theorem.

Physica A: Statistical Mechanics and its Applications, 2014

We study the model of quantum walks on cycles enriched by the addition of 1-step memory. We provide a formula for the probability distribution and the time-averaged limiting probability distribution of the introduced quantum walk. Using the obtained results, we discuss the properties of the introduced model and the difference in comparison to the memoryless model.

2010

In recent years quantum random walks have garnered much interest among quantum information researchers. Part of the reason is the prospect that many hard problems can be solved efficiently by employing algorithms based on quantum random walks, in the same way that classical random walks have played a central role in many hugely successful randomized algorithms. In this paper we introduce a new representation for the quantum random walks via the classical random walk with internal states. This new representation allows for a systematic approach to finding closed form expressions for the n-step distributions for a variety of quantum random walk models, and lends itself naturally to large deviation analysis. As an example, we show how to use the new representation to arrive at the same closed form expression for the Hadamard quantum random walk on a line, previously obtained by others. We assert the proposed method works in the most general settings.

Proceedings in Information and Communications Technology, 2010

We study time-dependent discrete-time quantum walks on the one-dimensional lattice. We compute the limit distribution of a twoperiod quantum walk defined by two orthogonal matrices. For the symmetric case, the distribution is determined by one of two matrices. Moreover, limit theorems for two special cases are presented.