Abstract Random walks in a finite Abelian group G are studied. They use Markov chains with doubly stochastic transition matrices, in a Birkhoff subpolytope B ( G ) associated with the group G . It is shown that all future probability vectors belong to a polytope which does not depend on the transition matrices, and which shrinks during time evolution. Various quantities are used to describe the probability vectors: the majorization preorder, Lorenz values and the Gini index, entropic quantities, and the total variation distance. The general results are applied to the additive group Z ( d ) , and to the Heisenberg–Weyl group H W ( d ) / Z ( d ) . A physical implementation of random walks in Z ( d ) that involves a sequence of non-selective projective measurements, is discussed. A physical implementation of random walks in the Heisenberg–Weyl group H W ( d ) / Z ( d ) using a sequence of non-selective positive operator-valued measure measurements with coherent states, is also presented.
Abstract Random walks in a finite Abelian group G are studied. They use Markov chains with doubly stochastic transition matrices, in a Birkhoff subpolytope B ( G ) associated with the group G . It is shown that all future probability vectors belong to a polytope which does not depend on the transition matrices, and which shrinks during time evolution. Various quantities are used to describe the probability vectors: the majorization preorder, Lorenz values and the Gini index, entropic quantities, and the total variation distance. The general results are applied to the additive group Z ( d ) , and to the Heisenberg–Weyl group H W ( d ) / Z ( d ) . A physical implementation of random walks in Z ( d ) that involves a sequence of non-selective projective measurements, is discussed. A physical implementation of random walks in the Heisenberg–Weyl group H W ( d ) / Z ( d ) using a sequence of non-selective positive operator-valued measure measurements with coherent states, is also presented.
A time-dependent finite-state Markov chain that uses doubly stochastic transition matrices, is considered. Entropic quantities that describe the randomness of the probability vectors, and also the randomness of the discrete paths, are studied. Universal convex polytopes are introduced which contain all future probability vectors, and which are based on the Birkhoff–von Neumann expansion for doubly stochastic matrices. They are universal in the sense that they depend only on the present probability vector, and are independent of the doubly stochastic transition matrices that describe time evolution in the future. It is shown that as the discrete time increases these convex polytopes shrink, and the minimum entropy of the probability vectors in them increases. These ideas are applied to a sequence of non-selective measurements (with different projectors in each step) on a quantum system with d-dimensional Hilbert space. The unitary time evolution in the intervals between the measurements, is taken into account. The non-selective measurements destroy stroboscopically the non-diagonal elements in the density matrix. This ‘hermaphrodite’ system is an interesting combination of a classical probabilistic system (immediately after the measurements) and a quantum system (in the intervals between the measurements). Various examples are discussed. In the ergodic example, the system follows asymptotically all discrete paths with the same probability. In the example of rapidly repeated non-selective measurements, we get the well known quantum Zeno effect with ‘frozen discrete paths’ (presented here as a biproduct of our general methodology based on Markov chains with doubly stochastic transition matrices).
Algebraic random walks (ARW) and quantum mechanical random walks (QRW) are investigated and related. Based on minimal data provided by the underlying bialgebras of functions defined on e. g the real line R, the abelian finite group Z_N, and the canonical Heisenberg-Weyl algebra hw, and by introducing appropriate functionals on those algebras, examples of ARWs are constructed. These walks involve short and long range transition probabilities as in the case of R walk, bistochastic matrices as for the case of Z_N walk, or coherent state vectors as in the case of hw walk. The increase of classical entropy due to majorization order of those ARWs is shown, and further their corresponding evolution equations are obtained. Especially for the case of hw ARW, the diffusion limit of evolution equation leads to a quantum master equation for the density matrix of a boson system interacting with a bath of quantum oscillators prepared in squeezed vacuum state. A number of generalizations to other types of ARWs and some open problems are also stated. Next, QRWs are briefly presented together with some of their distinctive properties, such as their enhanced diffusion rates, and their behavior in respect to the relation of majorization to quantum entropy. Finally, the relation of ARWs to QRWs is investigated in terms of the theorem of unitary extension of completely positive trace preserving (CPTP) evolution maps by means of auxiliary vector spaces. It is applied to extend the CPTP step evolution map of a ARW for a quantum walker system into a unitary step evolution map for an associated QRW of a walker+quantum coin system. Examples and extensions are provided.
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.
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.
We investigate the use of discrete-time quantum walks to sample from an almost-uniform distribution, in the absence of any external source of randomness. Integers are encoded on the vertices of a cycle graph, and a quantum walker evolves for a fixed number of steps before its position is measured and recorded. The walker is then reset to the measured site, and the procedure is iterated to produce the sequence of random numbers. We show that when the quantum walk parameters, such as the coin operator and initial state, satisfy the conditions of the ergodic theorem for random walks on finite groups, the resulting sequence converges asymptotically to the uniform distribution. Although correlations between successive outcomes are unavoidable, they can be significantly reduced by a suitable choice of the evolution time. By analyzing the iterated convolution of the quantum walk transition probability and exploiting the ergodic theorem, we demonstrate convergence of the marginal distributions toward the uniform distribution in the asymptotic limit.
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.