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:2310.10451 · Communications in computer and information science

A Quantum Walk-Based Scheme for Distributed Searching on Arbitrary Graphs

Mathieu Roget, Giuseppe Di Molfetta

Published Jan 1, 2024• 1 citation
arXivHTMLPDF
DOI
10.1007/978-3-031-56943-2_6

Related papers

A quantum walk inspired model for distributed computing on arbitrary graphs

Mathieu Roget, Giuseppe Di Molfetta

arXiv:2502.21232•Natural Computing•Jul 14, 2026•0 citations

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

Ide Yusuke

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

Quantum walk search algorithms and effective resistance

Stephen Piddock

We consider the problem of finding a marked vertex in a graph from an arbitrary starting distribution, using a quantum walk based algorithm. We work in the framework introduced by Belovs which showed how to detect the existence of a marked vertex in $O(\sqrt{RW})$ quantum walk steps, where $R$ is the effective resistance and $W$ is the total weight of the graph. Our algorithm outputs a marked vertex in the same runtime up to a logarithmic factor in the number of marked vertices. When starting in the stationary distribution, this recovers the recent results of Ambainis et al. We also describe a new algorithm to estimate the effective resistance $R$.

arXiv:1912.04196•Dec 9, 2019•4 citations

The optimal search on graph by continuous-time quantum walks

Xi Li, Hanwu Chen, Ruan, Yue +3 more

Chakraborty and Leonardo have shown that a spatial search by quantum walk is optimal for almost all graphs. However, we observed that on some graphs, certain states cannot be searched optimally. We present a method for constructing an optimal graph that searches an arbitrary state and provides the optimal condition. We also analyze the monotonicity of the search performance and conclude that the search performance can be improved by adding edges.

arXiv:1711.01765•Nov 6, 2017•0 citations

Discrete-time quantum walk search on Johnson graphs

Xiling Xue, Yue Ruan, Zhihao Liu

Quantum Information Processing•Jan 2, 2019•15 citations

Distributed Graph Isomorphism using Quantum Walks

Jayaprabha Yadav

International Journal on Recent and Innovation Trends in Computing and Communication•Jan 1, 2015•0 citations
We consider the problem of finding a marked vertex in a graph from an arbitrary starting distribution, using a quantum walk based algorithm. We work in the framework introduced by Belovs which showed how to detect the existence of a marked vertex in O(RW)O(\sqrt{RW})O(RW​) quantum walk steps, where RRR is the effective resistance and WWW is the total weight of the graph. Our algorithm outputs a marked vertex in the same runtime up to a logarithmic factor in the number of marked vertices. When starting in the stationary distribution, this recovers the recent results of Ambainis et al. We also describe a new algorithm to estimate the effective resistance RRR.