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

InTech eBooks

Search via Quantum Walk

Jiangfeng Du, Chao Lei, Qin Gan, Dawei Lu, Xinhua Peng

Published Apr 26, 2011• 3 citations
Publisher

Abstract

Quantum walk
DOI
10.5772/15814

Related papers

Faster search by lackadaisical quantum walk

Thomas G. Wong

arXiv:1706.06939•Quantum Information Processing•Feb 13, 2018•55 citations

Implementation and Viusalization of Quantum Walks

Addie Jordon, Austin Hawkins-Seagram, Ulrike Stege

Quantum walks (QWs) are the quantum analogue to classical random walks. We explore various implementations of QWs and create visualizations for each, with the goal of increasing educational accessibility. A new QW, called sticky walk, is introduced, where the walker sticks to targets once found. Corresponding pseudocode and Qiskit implementations are provided. Sticky walk helps bridge the gap between non-searching QWs and Quantum Walk Search (which may be an unintuitive search algorithm for those new to QWs).

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 1, 2022•3 citations

Quantum Walks

Peng Xue

Elsevier eBooks•Jan 1, 2025•0 citations

Complexity Analysis of Quantum Walk Based Search Algorithms

B. L. Douglas, Jingbo B. Wang

We present several families of graphs that allow both efficient quantum walk implementations and efficient quantum walk based search algorithms. For these graphs, we construct quantum circuits that explicitly implement the full quantum walk search algorithm, without reference to a `black box' oracle. These circuits provide a practically implementable method to explore quantum walk based search algorithms with the aim of eventual real-world applications. We also provide a numerical analysis of a quantum walk based search along a twisted toroid family of graphs, which requires O($\sqrt{n}$ log($n$)) elementary 2-qubit quantum gate operations to find a marked node.

arXiv:1408.1616•Journal of Computational and Theoretical Nanoscience•Jun 20, 2013•7 citations

Quantum Walk Search Algorithms

Richard J. Lipton, Kenneth W. Regan

This chapter contains sections titled: 15.1 Search in Big Graphs, 15.2 General Quantum Walk for Graph Search, 15.3 Specifying the Generic Walk, 15.4 Adding the Data, 15.5 Toolkit Theorem for Quantum Walk Search, 15.6 Grover Search as Generic Walk, 15.7 Element Distinctness, 15.8 Subgraph Triangle Incidence, 15.9 Finding a Triangle, 15.10 Evaluating Formulas and Playing Chess, 15.11 Problems, 15.12 Summary and Notes

•Jan 1, 2014•0 citations

Quantum Walks

Franklin de Lima Marquezino, Renato Portugal, Carlile Lavor

SpringerBriefs in computer science•Jan 1, 2019•0 citations
Quantum walks (QWs) are the quantum analogue to classical random walks. We explore various implementations of QWs and create visualizations for each, with the goal of increasing educational accessibility. A new QW, called sticky walk, is introduced, where the walker sticks to targets once found. Corresponding pseudocode and Qiskit implementations are provided. Sticky walk helps bridge the gap between non-searching QWs and Quantum Walk Search (which may be an unintuitive search algorithm for those new to QWs).
We present several families of graphs that allow both efficient quantum walk implementations and efficient quantum walk based search algorithms. For these graphs, we construct quantum circuits that explicitly implement the full quantum walk search algorithm, without reference to a `black box' oracle. These circuits provide a practically implementable method to explore quantum walk based search algorithms with the aim of eventual real-world applications. We also provide a numerical analysis of a quantum walk based search along a twisted toroid family of graphs, which requires O(n\sqrt{n}n​ log(nnn)) elementary 2-qubit quantum gate operations to find a marked node.