Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2507.23524 · The European Physical Journal D

Classification of coined quantum walks on the line and comparison to correlated classical random walks

Lukas Hantzko, Lennart Binkowski

Published Jul 1, 2026• 0 citations
arXivHTMLPDF

Abstract

Abstract We present a comprehensive classification of one-dimensional coined quantum walks on the infinite line, focusing on the spatial probability distributions they induce. Building on prior results, we identify all initial coin states that lead to symmetric quantum walks for arbitrary coins and provide a bijective parametrisation of all symmetric quantum walks modulo distributional equivalence. Extending beyond the symmetric case, we also give a surjective parametrisation of all coined quantum walks under the same equivalence relation, as well as a bijective parametrisation modulo equivalence of their limiting distributions. Furthermore, we derive corrected closed-form expressions for the walk amplitudes, resolving inaccuracies in previous literature, and generalise the approach to the correlated classical random walk. This unified framework enables a direct comparison between quantum and classical dynamics. Additionally, we discuss the asymptotic scaling of variances for both models, identifying quadratic spreading as a hallmark of non-trivial quantum walks and contrasting it with the linear behaviour of classical walks, except at the extremal points of maximal correlation. Finally, we compare the limiting distributions arising from quantum walks with those of the classical case. Graphical abstract - compact classification results for symmetric and general quantum walks, as well as classically correlated random walks - quantum walks spread ballistically while classically correlated random walks approach Gaussian limiting distribution - quantum coin parameter directly influence limiting distribution’s skewness

DOI
10.1140/epjd/s10053-026-01217-9

Related papers

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.04131•Journal of Physics A Mathematical and Theoretical•Nov 10, 2017•13 citations

Quantum Walks on the Line with Phase Parameters

Marcos Villagra, Masaki Nakanishi, Shigeru Yamashita +1 more

In this paper, a study on discrete-time coined quantum walks on the line is presented. Clear mathematical foundations are still lacking for this quantum walk model. As a step toward this objective, the following question is being addressed: Given a graph, what is the probability that a quantum walk arrives at a given vertex after some number of steps? This is a very natural question, and for random walks it can be answered by several different combinatorial arguments. For quantum walks this is a highly non-trivial task. Furthermore, this was only achieved before for one specific coin operator (Hadamard operator) for walks on the line. Even considering only walks on lines, generalizing these computations to a general SU(2) coin operator is a complex task. The main contribution is a closed-form formula for the amplitudes of the state of the walk (which includes the question above) for a general symmetric SU(2) operator for walks on the line. To this end, a coin operator with parameters that alters the phase of the state of the walk is defined. Then, closed-form solutions are computed by means of Fourier analysis and asymptotic approximation methods. We also present some basic properties of the walk which can be deducted using weak convergence theorems for quantum walks. In particular, the support of the induced probability distribution of the walk is calculated. Then, it is shown how changing the parameters in the coin operator affects the resulting probability distribution.

arXiv:1109.1866•IEICE Transactions on Information and Systems•Jan 1, 2012•5 citations

Quantum walks with entangled coins

S E Venegas-Andraca, J L Ball, K Burnett +1 more

We present a mathematical formalism for the description of un- restricted quantum walks with entangled coins and one walker. The numerical behaviour of such walks is examined when using a Bell state as the initial coin state, with two different coin operators, two different shift operators, and one walker. We compare and contrast the performance of these quantum walks with that of a classical random walk consisting of one walker and two maximally correlated coins as well as quantum walks with coins sharing different degrees of entanglement. We illustrate that the behaviour of our walk with entangled coins can be very different in comparison to the usual quantum walk with a single coin. We also demonstrate that simply by changing the shift operator, we can generate widely different distributions. We also compare the behaviour of quantum walks with maximally entangled coins with that of quantum walks with non-entangled coins. Finally, we show that the use of different shift operators on two and three qubit coins leads to different position probability distributions in one- and two-dimensional graphs.

arXiv:quant-ph/0411151•New Journal of Physics•Oct 17, 2005•60 citations

On the spreading of quantum walks starting from local and delocalized states

Alexandre C. Orthey, Edgard P. M. Amorim

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.

arXiv:1706.06257•Jun 20, 2017•4 citations

Dynamic behaviors of spreading in generalized Fibonacci time quasiperiodic quantum walks

Wang Wen-Juan, Tong Pei-Qing

Quantum walk (QW), the quantum mechanical counterpart of classical random walk, has recently been studied in various fields. The evolution of the discrete time quantum walk can be described as follows: the walker changes its spin state by the coin operator C, then takes one step left or right according to its spin state. For homogeneous quantum walk, the coin operator is independent of time and the standard deviation of the position grows linearly in time. It is quadratically faster than that in the classical random walk. In this work, we numerically study the dynamical behaviors of spreading in a one-dimensional discrete time quasiperiodic quantum walk (DTQQW). The DTQQW is that the coin operator is dependent on time and takes two different coins C() and C() arranged in generalized Fibonacci (GF) sequences. The GF sequences are constructed from A by the recursion relation: AAmBn, BA, for m, n are positive integers. They can be classified into two classes according to the wandering exponent . For 0, they belong to the first class, and for 0, they belong to the second class. For one dimensional system, the behaviors of two classes of GF systems are different either for the electronic spectrum of an electron in quasiperiodic potentials or for the quantum phase transitions of the quasiperiodic spin chains. In this paper, we discuss the cases of two different C operators (C();C()) arranged in GF sequences and find that the spreading behaviors are superdiffusion (the standard deviation of the position ~t; 0:5 1) for the two classes of GF DTQQW. For the second class of GF DTQQW, the exponent values are larger than those of the first class of GF DTQQW in the case of two identical C operators. By exploring the probability distribution in the real space, we find that for the first class of GF DTQQW, the probability distributions are almost the same for different initial states and are similar to the classical Gaussian distribution. For the probability distributions of the second class of GF DTQQW, there are two peaks at the two edges and the height of the two peaks can be different for different initial states. They are similar to the ballistic distribution of the homogeneous quantum walk. Therefore, we conclude that for the first class of GF DTQQW, the spreading behaviors are close to those of the classical random walk ( = 0:5) while for the second class of GF DTQQW, they are close to those of the homogeneous quantum walk ( = 1). This result is quite different from the characteristics of the quantum phase transitions in two classes of GF quasiperiodic quantum spin chains.

Acta Physica Sinica•Jan 1, 2016•0 citations

One-dimensional coinless quantum walks

Renato Portugal, Stefan Boettcher, Stefan Falkner

A coinless, discrete-time quantum walk possesses a Hilbert space whose dimension is smaller compared to the widely studied coined walk. Coined walks require the direct product of the site basis with the coin space; coinless walks operate purely in the site basis, which is clearly minimal. These coinless quantum walks have received considerable attention recently because they have evolution operators that can be obtained by a graphical method based on lattice tessellations and they have been shown to be as efficient as the best known coined walks when used as a quantum search algorithm. We argue that both formulations in their most general form are equivalent. In particular, we demonstrate how to transform the one-dimensional version of the coinless quantum walk into an equivalent extended coined version for a specific family of evolution operators. We present some of its basic, asymptotic features for the one-dimensional lattice with some examples of tessellations, and analyze the mixing time and limiting probability distributions on cycles.

arXiv:1408.5166•Physical Review A•May 18, 2015•26 citations
Abstract We present a comprehensive classification of one-dimensional coined quantum walks on the infinite line, focusing on the spatial probability distributions they induce. Building on prior results, we identify all initial coin states that lead to symmetric quantum walks for arbitrary coins and provide a bijective parametrisation of all symmetric quantum walks modulo distributional equivalence. Extending beyond the symmetric case, we also give a surjective parametrisation of all coined quantum walks under the same equivalence relation, as well as a bijective parametrisation modulo equivalence of their limiting distributions. Furthermore, we derive corrected closed-form expressions for the walk amplitudes, resolving inaccuracies in previous literature, and generalise the approach to the correlated classical random walk. This unified framework enables a direct comparison between quantum and classical dynamics. Additionally, we discuss the asymptotic scaling of variances for both models, identifying quadratic spreading as a hallmark of non-trivial quantum walks and contrasting it with the linear behaviour of classical walks, except at the extremal points of maximal correlation. Finally, we compare the limiting distributions arising from quantum walks with those of the classical case. Graphical abstract - compact classification results for symmetric and general quantum walks, as well as classically correlated random walks - quantum walks spread ballistically while classically correlated random walks approach Gaussian limiting distribution - quantum coin parameter directly influence limiting distribution’s skewness
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.
In this paper, a study on discrete-time coined quantum walks on the line is presented. Clear mathematical foundations are still lacking for this quantum walk model. As a step toward this objective, the following question is being addressed: Given a graph, what is the probability that a quantum walk arrives at a given vertex after some number of steps? This is a very natural question, and for random walks it can be answered by several different combinatorial arguments. For quantum walks this is a highly non-trivial task. Furthermore, this was only achieved before for one specific coin operator (Hadamard operator) for walks on the line. Even considering only walks on lines, generalizing these computations to a general SU(2) coin operator is a complex task. The main contribution is a closed-form formula for the amplitudes of the state of the walk (which includes the question above) for a general symmetric SU(2) operator for walks on the line. To this end, a coin operator with parameters that alters the phase of the state of the walk is defined. Then, closed-form solutions are computed by means of Fourier analysis and asymptotic approximation methods. We also present some basic properties of the walk which can be deducted using weak convergence theorems for quantum walks. In particular, the support of the induced probability distribution of the walk is calculated. Then, it is shown how changing the parameters in the coin operator affects the resulting probability distribution.
We present a mathematical formalism for the description of un- restricted quantum walks with entangled coins and one walker. The numerical behaviour of such walks is examined when using a Bell state as the initial coin state, with two different coin operators, two different shift operators, and one walker. We compare and contrast the performance of these quantum walks with that of a classical random walk consisting of one walker and two maximally correlated coins as well as quantum walks with coins sharing different degrees of entanglement. We illustrate that the behaviour of our walk with entangled coins can be very different in comparison to the usual quantum walk with a single coin. We also demonstrate that simply by changing the shift operator, we can generate widely different distributions. We also compare the behaviour of quantum walks with maximally entangled coins with that of quantum walks with non-entangled coins. Finally, we show that the use of different shift operators on two and three qubit coins leads to different position probability distributions in one- and two-dimensional graphs.
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/21/21/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.
Quantum walk (QW), the quantum mechanical counterpart of classical random walk, has recently been studied in various fields. The evolution of the discrete time quantum walk can be described as follows: the walker changes its spin state by the coin operator C, then takes one step left or right according to its spin state. For homogeneous quantum walk, the coin operator is independent of time and the standard deviation of the position grows linearly in time. It is quadratically faster than that in the classical random walk. In this work, we numerically study the dynamical behaviors of spreading in a one-dimensional discrete time quasiperiodic quantum walk (DTQQW). The DTQQW is that the coin operator is dependent on time and takes two different coins C() and C() arranged in generalized Fibonacci (GF) sequences. The GF sequences are constructed from A by the recursion relation: AAmBn, BA, for m, n are positive integers. They can be classified into two classes according to the wandering exponent . For 0, they belong to the first class, and for 0, they belong to the second class. For one dimensional system, the behaviors of two classes of GF systems are different either for the electronic spectrum of an electron in quasiperiodic potentials or for the quantum phase transitions of the quasiperiodic spin chains. In this paper, we discuss the cases of two different C operators (C();C()) arranged in GF sequences and find that the spreading behaviors are superdiffusion (the standard deviation of the position ~t; 0:5 1) for the two classes of GF DTQQW. For the second class of GF DTQQW, the exponent values are larger than those of the first class of GF DTQQW in the case of two identical C operators. By exploring the probability distribution in the real space, we find that for the first class of GF DTQQW, the probability distributions are almost the same for different initial states and are similar to the classical Gaussian distribution. For the probability distributions of the second class of GF DTQQW, there are two peaks at the two edges and the height of the two peaks can be different for different initial states. They are similar to the ballistic distribution of the homogeneous quantum walk. Therefore, we conclude that for the first class of GF DTQQW, the spreading behaviors are close to those of the classical random walk ( = 0:5) while for the second class of GF DTQQW, they are close to those of the homogeneous quantum walk ( = 1). This result is quite different from the characteristics of the quantum phase transitions in two classes of GF quasiperiodic quantum spin chains.
A coinless, discrete-time quantum walk possesses a Hilbert space whose dimension is smaller compared to the widely studied coined walk. Coined walks require the direct product of the site basis with the coin space; coinless walks operate purely in the site basis, which is clearly minimal. These coinless quantum walks have received considerable attention recently because they have evolution operators that can be obtained by a graphical method based on lattice tessellations and they have been shown to be as efficient as the best known coined walks when used as a quantum search algorithm. We argue that both formulations in their most general form are equivalent. In particular, we demonstrate how to transform the one-dimensional version of the coinless quantum walk into an equivalent extended coined version for a specific family of evolution operators. We present some of its basic, asymptotic features for the one-dimensional lattice with some examples of tessellations, and analyze the mixing time and limiting probability distributions on cycles.