arXiv:2006.11090

Mapping quantum random walks onto a Markov chain by mapping a unitary transformation to a higher dimension of an irreducible matrix

Arie Bar-Haim

Published Jun 19, 2020• 1 citation

Abstract

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> in space without interference, instead of two coin states |1>, |0> .For the case of no boundary conditions, the model is similar to a Markov chain with a stochastic matrix, i.e., it conserves the population distribution of the four coin states, and by using a proper transformation, yield probability distributions of the two quantum states |1>, |0> in space, similar to a unitary operator. Numerical results for a quantum random walk on infinite and finite lines are introduced.

DOI: 10.48550/arxiv.2006.11090

Related papers

Mapping a finite and an infinite Hadamard quantum walk onto a unique case of a random walk process

Arie Bar-Haim

A new model that maps a quantum random walk described by a Hadamard operator to a particular case of a random walk is presented. The model is represented by a Markov chain with a stochastic matrix, i.e., all the transition rates are positive, although the Hadamard operator contains negative entries. Using a proper transformation that is applied to the random walk distribution after n steps, the probability distributions in space of the two quantum states |1>, |0> are revealed. These show that a quantum walk can be entirely mapped to a particular case of a higher dimension of a random walk model. The random walk model and its equivalence to a Hadamard walk can be extended for other cases, such as a finite chain with two reflecting points

arXiv:2011.08767Nov 17, 20200 citations

Mapping a Hadamard Quantum Walk to a Unique Case of a Birth and Death Process

Arie Bar-Haim

A new model maps a quantum random walk described by a Hadamard operator to a particular case of a birth and death process. The model is represented by a 2D Markov chain with a stochastic matrix, i.e., all the transition rates are positive, although the Hadamard operator contains negative entries (this is possible by increasing the dimensionality of the system). The probability distribution of the walker population is preserved using the Markovian property. By applying a proper transformation to the population distribution of the random walk, the probability distributions of the quantum states |0>, 1> are revealed. Thus, the new model has two unique properties: it reveals the probability distribution of the quantum states as a unitary system and preserves the population distribution of the random walker as a Markovian system.

arXiv:2104.04286Apr 9, 20210 citations

Probability distributions for Markov chain based quantum walks

Radhakrishnan Balu, Chaobin Liu, Salvador Elías Venegas-Andraca

Abstract We analyze the probability distributions of the quantum walks induced from Markov chains by Szegedy (2004). The first part of this paper is devoted to the quantum walks induced from finite state Markov chains. It is shown that the probability distribution on the states of the underlying Markov chain is always convergent in the Cesaro sense. In particular, we deduce that the limiting distribution is uniform if the transition matrix is symmetric. In the case of a non-symmetric Markov chain, we exemplify that the limiting distribution of the quantum walk is not necessarily identical with the stationary distribution of the underlying irreducible Markov chain. The Szegedy scheme can be extended to infinite state Markov chains (random walks). In the second part, we formulate the quantum walk induced from a lazy random walk on the line. We then obtain the weak limit of the quantum walk. It is noted that the current quantum walk appears to spread faster than its counterpart-quantum walk on the line driven by the Grover coin discussed in literature. The paper closes with an outlook on possible future directions.

arXiv:1703.04131Journal of Physics A Mathematical and TheoreticalNov 10, 201713 citations

Asymptotic evolution of quantum walks with random coin

André Ahlbrecht, Holger Vogts, Albert H. Werner +1 more

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.

arXiv:1009.2019Journal of Mathematical PhysicsApr 1, 2011119 citations

Characterizing the Relationship Between Unitary Quantum Walks and Non-Homogeneous Random Walks

Matheus Guedes de Andrade, Franklin de Lima Marquezino, Daniel R. Figueiredo

Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the relationship between quantum and random walks has been recently discussed in specific scenarios, this work establishes a formal equivalence between the two processes on arbitrary finite graphs and general conditions for shift and coin operators. It requires empowering random walks with time heterogeneity, where the transition probability of the walker is non-uniform and time dependent. The equivalence is obtained by equating the probability of measuring the quantum walk on a given node of the graph and the probability that the random walk is at that same node, for all nodes and time steps. The first result establishes procedure for a stochastic matrix sequence to induce a random walk that yields the exact same vertex probability distribution sequence of any given quantum walk, including the scenario with multiple interfering walkers. The second result establishes a similar procedure in the opposite direction. Given any random walk, a time-dependent quantum walk with the exact same vertex probability distribution is constructed. Interestingly, the matrices constructed by the first procedure allows for a different simulation approach for quantum walks where node samples respect neighbor locality and convergence is guaranteed by the law of large numbers, enabling efficient (polynomial-time) sampling of quantum graph trajectories. Furthermore, the complexity of constructing this sequence of matrices is discussed in the general case.

Jun 29, 20210 citations

Discrete-time quantum walk with two-step 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.

Jun 7, 20120 citations