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:2008.03639 · IEEE Transactions on Emerging Topics in Computational Intelligence

Random Walks: A Review of Algorithms and Applications

Feng Xia, Jiaying Liu, Hansong Nie, Yonghao Fu, Liangtian Wan, Xiangjie Kong

Published Nov 25, 2019• 329 citations
arXivHTMLPDF

Abstract

A random walk is known as a random process which describes a path including a succession of random steps in the mathematical space. It has increasingly been popular in various disciplines such as mathematics and computer science. Furthermore, in quantum mechanics, quantum walks can be regarded as quantum analogues of classical random walks. Classical random walks and quantum walks can be used to calculate the proximity between nodes and extract the topology in the network. Various random walk related models can be applied in different fields, which is of great significance to downstream tasks such as link prediction, recommendation, computer vision, semi-supervised learning, and network embedding. In this article, we aim to provide a comprehensive review of classical random walks and quantum walks. We first review the knowledge of classical random walks and quantum walks, including basic concepts and some typical algorithms. We also compare the algorithms based on quantum walks and classical random walks from the perspective of time complexity. Then we introduce their applications in the field of computer science. Finally we discuss the open issues from the perspectives of efficiency, main-memory volume, and computing time of existing algorithms. This study aims to contribute to this growing area of research by exploring random walks and quantum walks together.

DOI
10.1109/tetci.2019.2952908

Related papers

Advances in Random and Quantum Walks: Bridging Classical and Quantum Computational Paradigms

Anurag Soni, Akhtar Rasool, Dhirendra Pratap Singh

In the world of computational probing, random walks and quantum walks are two separate but tightly linked paradigms. Classical stochastic processes like random walks are based on the random movement of particles in mathematical space and have been extensively used in data mining, network analysis, computer vision, etc. Quantum walks, by contrast generalize random walks into the quantum realm, taking the benefit of the quantum superposition and interference in order to investigate multiple paths at the same time. Quantum walks provide significant potential for algorithmic development: in quantum computing and communication, and in Scientific modelling and simulation. This paper provides an in-depth survey of random walks and quantum walks, outlining historical context, fundamental principles, applications, challenges, and future prospects. In this paper, motivated by the abstractness of both random walks and quantum walks, we survey the field of computational exploration at large scales, coalescing the myriad notions and difficult challenges addressed by existing research efforts on random and quantum walks, inferring a nuanced and multifaceted view on how both random walks and quantum walks are involved in paving the way to future development in many fields.

Procedia Computer Science•Jan 1, 2025•1 citation

Review on Quantum Walk Algorithm

Wenda Zhou

Abstract Quantum walk is the quantum version of classical random walk, which has shown great advantage over classical algorithms. In this article, main discoveries and breakthroughs along with several applications in the last two decades are reviewed and discussed. Reducing hitting time and diminishing mixing time, as two hot research fields, are addressed. Possibility of universal computation with more generic case of quantum walk is also mentioned. In the future, we can expect new methods and models being feasible ways to approach the theoretical lower bounds of related problems, as well as more efficient applications on specific scene.

Journal of Physics Conference Series•Jan 1, 2021•24 citations

Quantum random walks: An introductory overview

Julia Kempe

This article aims to provide an introductory survey on quantum random walks.Starting from a physical effect to illustrate the main ideas we will introduce quantum random walks, review some of their properties and outline their striking differences to classical walks.We will touch upon both physical effects and computer science applications, introducing some of the main concepts and language of present day quantum information science in this context.We will mention recent developments in this new area and outline some open questions. God does not play dice.

arXiv:quant-ph/0303081•Contemporary Physics•Jul 1, 2003•1,670 citations

Application of Quantum Walk for Signal Processing

V. S. Moskvin

Signal processing is important for modern technologies such as digital communication systems and sensor networks, and is used to enhance and optimize the quality of transmitted signals. However, traditional methods and design frameworks are insufficient for the demands of future communication networks, which are expected to be highly complex and constantly changing. Our research focuses on a mathematical model known as a Markov model, which represents a system as a series of states linked by transitions. This model can be applied to various signal processing challenges in telecommunications, such as the modeling of communication channels, sources of information, and the correction of distortion and noise in transmitted signals. We examine the random walk algorithm, a simple and efficient way to simulate the behavior of a Markov chain, as it can provide valuable insights into the performance of communication systems and help to optimize their design. However, it may not be able to accurately model systems with complex transitions or systems that exhibit long-term correlations. In order to address the challenges and limitations of classical random walk, we propose the use of quantum random walk, which is a quantum mechanical version of classical random walk. It describes the motion of particles in a probabilistic way, similar to classical random walk, but with the added complexity of quantum mechanics. We also provide quantum walk algorithm with Hadamard gate implementation for coin operator.

2018Systems of Signal Synchronization, Generating and Processing in Telecommunications (SYNCHROINFO)•Jun 28, 2023•1 citation

Quantum Walk-Based Algorithms for Large-Scale Graph Search

Jincheng Zhang

This paper investigates the application of quantum walk algorithms to large-scale graph search problems. Classical algorithms often struggle with the computational complexity of exploring vast graphs, particularly when searching for specific patterns or nodes. Quantum walks, inspired by the probabilistic nature of random walks, provide a promising alternative by utilizing quantum superposition and interference to accelerate the search process. We explore the theoretical framework and potential advantages of employing quantum walks for graph traversal, focusing on scenarios where exponential speedups are theoretically possible. This work aims to demonstrate the potential of quantum computing to tackle computationally demanding graph search tasks that are currently intractable for classical methods. The core concept leverages the ability to simultaneously explore multiple paths within a graph, drastically reducing the search time compared to sequential exploration. We present a foundational understanding of quantum walk implementation and analyze its suitability for various graph search algorithms.

•Aug 28, 2026•0 citations

Quantum Walk Computing: Theory, Implementation, and Application

Xiaogang Qiang, Shixin Ma, Haijing Song

The classical random walk formalism plays an important role in a wide range of applications. Its quantum counterpart, the quantum walk, is proposed as an important theoretical model for quantum computing. By exploiting quantum effects such as superposition, interference, and entanglement, quantum walks and their variations have been extensively studied for achieving computing power beyond that of classical computing and have been broadly used in designing quantum algorithms for algebraic and optimization problems, graph and network analysis, and quantum Hamiltonian and biochemical process simulations. Moreover, quantum walk models have been proven capable of universal quantum computation. Unlike conventional quantum circuit models, quantum walks provide a feasible path for implementing application-specific quantum computing, particularly in the noisy intermediate-scale quantum era. Recently, remarkable progress has been achieved in implementing a wide variety of quantum walks and quantum walk applications, which demonstrates the great potential of quantum walks. In this review, we provide a thorough summary of quantum walks and quantum walk computing, including theories and characteristics, physical implementations, and applications. We also discuss the challenges facing quantum walk computing, which aims to realize a practical quantum computer in the near future.

arXiv:2404.04178•Intelligent Computing•Jan 1, 2024•77 citations
A random walk is known as a random process which describes a path including a succession of random steps in the mathematical space. It has increasingly been popular in various disciplines such as mathematics and computer science. Furthermore, in quantum mechanics, quantum walks can be regarded as quantum analogues of classical random walks. Classical random walks and quantum walks can be used to calculate the proximity between nodes and extract the topology in the network. Various random walk related models can be applied in different fields, which is of great significance to downstream tasks such as link prediction, recommendation, computer vision, semi-supervised learning, and network embedding. In this article, we aim to provide a comprehensive review of classical random walks and quantum walks. We first review the knowledge of classical random walks and quantum walks, including basic concepts and some typical algorithms. We also compare the algorithms based on quantum walks and classical random walks from the perspective of time complexity. Then we introduce their applications in the field of computer science. Finally we discuss the open issues from the perspectives of efficiency, main-memory volume, and computing time of existing algorithms. This study aims to contribute to this growing area of research by exploring random walks and quantum walks together.
In the world of computational probing, random walks and quantum walks are two separate but tightly linked paradigms. Classical stochastic processes like random walks are based on the random movement of particles in mathematical space and have been extensively used in data mining, network analysis, computer vision, etc. Quantum walks, by contrast generalize random walks into the quantum realm, taking the benefit of the quantum superposition and interference in order to investigate multiple paths at the same time. Quantum walks provide significant potential for algorithmic development: in quantum computing and communication, and in Scientific modelling and simulation. This paper provides an in-depth survey of random walks and quantum walks, outlining historical context, fundamental principles, applications, challenges, and future prospects. In this paper, motivated by the abstractness of both random walks and quantum walks, we survey the field of computational exploration at large scales, coalescing the myriad notions and difficult challenges addressed by existing research efforts on random and quantum walks, inferring a nuanced and multifaceted view on how both random walks and quantum walks are involved in paving the way to future development in many fields.
Abstract Quantum walk is the quantum version of classical random walk, which has shown great advantage over classical algorithms. In this article, main discoveries and breakthroughs along with several applications in the last two decades are reviewed and discussed. Reducing hitting time and diminishing mixing time, as two hot research fields, are addressed. Possibility of universal computation with more generic case of quantum walk is also mentioned. In the future, we can expect new methods and models being feasible ways to approach the theoretical lower bounds of related problems, as well as more efficient applications on specific scene.
This article aims to provide an introductory survey on quantum random walks.Starting from a physical effect to illustrate the main ideas we will introduce quantum random walks, review some of their properties and outline their striking differences to classical walks.We will touch upon both physical effects and computer science applications, introducing some of the main concepts and language of present day quantum information science in this context.We will mention recent developments in this new area and outline some open questions. God does not play dice.
Signal processing is important for modern technologies such as digital communication systems and sensor networks, and is used to enhance and optimize the quality of transmitted signals. However, traditional methods and design frameworks are insufficient for the demands of future communication networks, which are expected to be highly complex and constantly changing. Our research focuses on a mathematical model known as a Markov model, which represents a system as a series of states linked by transitions. This model can be applied to various signal processing challenges in telecommunications, such as the modeling of communication channels, sources of information, and the correction of distortion and noise in transmitted signals. We examine the random walk algorithm, a simple and efficient way to simulate the behavior of a Markov chain, as it can provide valuable insights into the performance of communication systems and help to optimize their design. However, it may not be able to accurately model systems with complex transitions or systems that exhibit long-term correlations. In order to address the challenges and limitations of classical random walk, we propose the use of quantum random walk, which is a quantum mechanical version of classical random walk. It describes the motion of particles in a probabilistic way, similar to classical random walk, but with the added complexity of quantum mechanics. We also provide quantum walk algorithm with Hadamard gate implementation for coin operator.
This paper investigates the application of quantum walk algorithms to large-scale graph search problems. Classical algorithms often struggle with the computational complexity of exploring vast graphs, particularly when searching for specific patterns or nodes. Quantum walks, inspired by the probabilistic nature of random walks, provide a promising alternative by utilizing quantum superposition and interference to accelerate the search process. We explore the theoretical framework and potential advantages of employing quantum walks for graph traversal, focusing on scenarios where exponential speedups are theoretically possible. This work aims to demonstrate the potential of quantum computing to tackle computationally demanding graph search tasks that are currently intractable for classical methods. The core concept leverages the ability to simultaneously explore multiple paths within a graph, drastically reducing the search time compared to sequential exploration. We present a foundational understanding of quantum walk implementation and analyze its suitability for various graph search algorithms.
The classical random walk formalism plays an important role in a wide range of applications. Its quantum counterpart, the quantum walk, is proposed as an important theoretical model for quantum computing. By exploiting quantum effects such as superposition, interference, and entanglement, quantum walks and their variations have been extensively studied for achieving computing power beyond that of classical computing and have been broadly used in designing quantum algorithms for algebraic and optimization problems, graph and network analysis, and quantum Hamiltonian and biochemical process simulations. Moreover, quantum walk models have been proven capable of universal quantum computation. Unlike conventional quantum circuit models, quantum walks provide a feasible path for implementing application-specific quantum computing, particularly in the noisy intermediate-scale quantum era. Recently, remarkable progress has been achieved in implementing a wide variety of quantum walks and quantum walk applications, which demonstrates the great potential of quantum walks. In this review, we provide a thorough summary of quantum walks and quantum walk computing, including theories and characteristics, physical implementations, and applications. We also discuss the challenges facing quantum walk computing, which aims to realize a practical quantum computer in the near future.