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:1912.06256 · Quantum Information Processing

On the equivalence between quantum and random walks on finite graphs

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

Published Nov 1, 2020• 9 citations
arXivHTMLPDF
DOI
10.1007/s11128-020-02917-w

Related papers

Quantum decomposition of random walk on Cayley graph of finite group

Yuanbao Kang

Physica A Statistical Mechanics and its Applications•Apr 13, 2016•2 citations

Graph partition and simple random walk/quantum walk search on graph

Ide Yusuke

電気学会研究会資料•Jan 1, 2018•0 citations

From quantum graphs to quantum random walks

Gregor Tanner

arXiv:quant-ph/0504224•Springer eBooks•Jun 25, 2006•25 citations

Using quantum walks to unitarily represent random walks on finite graphs

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

Quantum and random walks have been shown to be equivalent in the following sense: a time-dependent random walk can be constructed such that its vertex distribution at all time instants is identical to the vertex distribution of any discrete-time coined quantum walk on a finite graph. This equivalence establishes a deep connection between the two processes, far stronger than simply considering quantum walks as quantum analogs of classical random walks. The present paper strengthens this connection by providing a construction that establishes this equivalence in the reverse direction: a unitary time-dependent quantum walk can be constructed such that its vertex distribution is identical to the vertex distribution of any random walk on a finite graph at all time instants. The construction shown here describes a quantum walk that matches a random walk without measurements at all time steps (an otherwise trivial statement): measurement is performed in a quantum walk that evolved unitarily until a given time $t$ such that its vertex distribution is identical to the random walk at time $t$. The construction procedure is general, covering both homogeneous and nonhomogeneous random walks. For homogeneous random walks, unitary evolution implies time dependency for the quantum walk, since homogeneous quantum walks do not converge under arbitrary initial conditions, while a broad class of random walks does. Thus, the absence of convergence demonstrated for a quantum walk in its debut comes from both time homogeneity and unitarity, rather than unitarity alone, and our results shed light on the power of quantum walks to generate samples for arbitrary probability distributions. Finally, the construction here proposed is used to simulate quantum walks that match uniform random walks on the cycle and the torus.

arXiv:2103.06463•Physical Review A•Apr 12, 2024•1 citation

Quantum Walks on Finite Graphs

Renato Portugal

Springer eBooks•Jan 1, 2013•0 citations

Quantum walks can unitarily match random walks on finite graphs

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

Quantum and random walks were proven to be equivalent on finite graphs by demonstrating how to construct a time-dependent random walk sharing the exact same evolution of vertex probability of any given discrete-time coined quantum walk. Such equivalence stipulated a deep connection between the processes that is far stronger than simply considering quantum walks as quantum analogues of random walks. This article expands on the connection between quantum and random walks by demonstrating a procedure that constructs a time-dependent quantum walk matching the evolution of vertex probability of any given random walk in a unitary way. It is a trivial fact that a quantum walk measured at all time steps of its evolution degrades to a random walk. More interestingly, the method presented describes a quantum walk that matches a random walk without measurement operations, such that the unitary evolution of the quantum walk captures the probability evolution of the random walk. The construction procedure is general, covering both homogeneous and non-homogeneous random walks. For the homogeneous random walk case, the properties of unitary evolution imply that the quantum walk described is time-dependent since homogeneous quantum walks do not converge for arbitrary initial conditions

•Mar 11, 2021•1 citation
Quantum and random walks have been shown to be equivalent in the following sense: a time-dependent random walk can be constructed such that its vertex distribution at all time instants is identical to the vertex distribution of any discrete-time coined quantum walk on a finite graph. This equivalence establishes a deep connection between the two processes, far stronger than simply considering quantum walks as quantum analogs of classical random walks. The present paper strengthens this connection by providing a construction that establishes this equivalence in the reverse direction: a unitary time-dependent quantum walk can be constructed such that its vertex distribution is identical to the vertex distribution of any random walk on a finite graph at all time instants. The construction shown here describes a quantum walk that matches a random walk without measurements at all time steps (an otherwise trivial statement): measurement is performed in a quantum walk that evolved unitarily until a given time ttt such that its vertex distribution is identical to the random walk at time ttt. The construction procedure is general, covering both homogeneous and nonhomogeneous random walks. For homogeneous random walks, unitary evolution implies time dependency for the quantum walk, since homogeneous quantum walks do not converge under arbitrary initial conditions, while a broad class of random walks does. Thus, the absence of convergence demonstrated for a quantum walk in its debut comes from both time homogeneity and unitarity, rather than unitarity alone, and our results shed light on the power of quantum walks to generate samples for arbitrary probability distributions. Finally, the construction here proposed is used to simulate quantum walks that match uniform random walks on the cycle and the torus.
Quantum and random walks were proven to be equivalent on finite graphs by demonstrating how to construct a time-dependent random walk sharing the exact same evolution of vertex probability of any given discrete-time coined quantum walk. Such equivalence stipulated a deep connection between the processes that is far stronger than simply considering quantum walks as quantum analogues of random walks. This article expands on the connection between quantum and random walks by demonstrating a procedure that constructs a time-dependent quantum walk matching the evolution of vertex probability of any given random walk in a unitary way. It is a trivial fact that a quantum walk measured at all time steps of its evolution degrades to a random walk. More interestingly, the method presented describes a quantum walk that matches a random walk without measurement operations, such that the unitary evolution of the quantum walk captures the probability evolution of the random walk. The construction procedure is general, covering both homogeneous and non-homogeneous random walks. For the homogeneous random walk case, the properties of unitary evolution imply that the quantum walk described is time-dependent since homogeneous quantum walks do not converge for arbitrary initial conditions