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

Quantum walks: a comprehensive review

Salvador Elías Venegas-Andraca

Published Jul 7, 2012• 983 citations
arXivHTMLPDF
DOI
10.1007/s11128-012-0432-5

Related papers

Open quantum walks: A mini review of the field and recent developments

Ilya Sinayskiy, Francesco Petruccione

The European Physical Journal Special Topics•Jan 29, 2019•19 citations

Quantum walk and its application domains: A systematic review

Karuna Kadian, Sunita Garhwal, Ajay Kumar

Computer Science Review•Jul 19, 2021•158 citations

Random Walks: A Review of Algorithms and Applications

Feng Xia, Jiaying Liu, Hansong Nie +3 more

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.

arXiv:2008.03639•IEEE Transactions on Emerging Topics in Computational Intelligence•Nov 25, 2019•329 citations

Introduction to Quantum Walks

Renato Portugal

Quantum science and technology•Jan 1, 2018•2 citations

Topology in Photonic Discrete-Time Quantum Walks: A Comprehensive Review

Graciana Puentes

We present a comprehensive review of photonic implementations of discrete-time quantum walks (DTQW) in the spatial and temporal domains. Moreover, we introduce a novel scheme for DTQWs using transverse spatial modes of single photons and programmable spatial light modulators (SLM) to manipulate them. We discuss current applications of such photonic DTQW architectures in quantum simulation of topological effects in photonic systems.

IntechOpen eBooks•Feb 23, 2022•1 citation

Introduction to Quantum Walks

Renato Portugal

Springer eBooks•Jan 1, 2013•1 citation
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.