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

Faster search by lackadaisical quantum walk

Thomas G. Wong

Published Feb 13, 2018• 50 citations
arXivHTMLPDF
DOI
10.1007/s11128-018-1840-y

Related papers

Faster search of clustered marked states with lackadaisical quantum walks

Amit Saha, Ritajit Majumdar, Debasri Saha +2 more

arXiv:2107.02049•Quantum Information Processing•Aug 13, 2022•15 citations

Quantum Walk Based Search Algorithms

Miklós Sántha

arXiv:0808.0059•Springer eBooks•Apr 29, 2008•182 citations

Quantum search on Hanoi network

Pulak Ranjan Giri, V. E. Korepin

Hanoi network (HN) has a one-dimensional periodic lattice as its main structure with additional long-range edges, which allow having efficient quantum walk algorithm that can find a target state on the network faster than the exhaustive classical search. In this paper, we use regular quantum walks and lackadaisical quantum walks, respectively, to search for a target state. From the curve fitting of the numerical results for HN of degrees three and four, we find that their running time for the regular quantum walks are followed by amplitude amplification scales as [Formula: see text] and [Formula: see text], respectively. For the search by lackadaisical quantum walks, the running time scales are as [Formula: see text] and [Formula: see text], respectively.

arXiv:1903.08020•International Journal of Quantum Information•Oct 1, 2019•5 citations

Search via Quantum Walk

Jiangfeng Du, Chao Lei, Qin Gan +2 more

Quantum walk

InTech eBooks•Apr 26, 2011•4 citations

Noise-resilient spatial search with lackadaisical quantum walks

Gabriel Mauricio Oswald Vieira, Nelson Maculan, Franklin de Lima Marquezino

Abstract Quantum walks are a powerful framework for the development of quantum algorithms, with lackadaisical quantum walks (LQWs) standing out as an efficient model for spatial search. In this work, we investigate how broken-link decoherence affects the performance of LQW-based search on a two-dimensional toroidal grid. We show through numerical simulations that while decoherence drives the loopless walk toward a uniform distribution and eliminates its search capability, the inclusion of self-loops significantly mitigates this effect. In particular, even under noise, the marked vertex remains identifiable with probability well above uniform, demonstrating that self-loops enhance the robustness of LQWs in realistic scenarios. These findings extend the known advantages of LQWs from the noiseless setting to noisy environments, consolidating self-loops as a valuable resource for designing resilient quantum search algorithms.

arXiv:2508.13462•Quantum Information Processing•May 20, 2026•0 citations

Quantum Search

Sergei Kurgalin, Sergei Borzunov

Texts in computer science•Jan 1, 2021•0 citations
Hanoi network (HN) has a one-dimensional periodic lattice as its main structure with additional long-range edges, which allow having efficient quantum walk algorithm that can find a target state on the network faster than the exhaustive classical search. In this paper, we use regular quantum walks and lackadaisical quantum walks, respectively, to search for a target state. From the curve fitting of the numerical results for HN of degrees three and four, we find that their running time for the regular quantum walks are followed by amplitude amplification scales as [Formula: see text] and [Formula: see text], respectively. For the search by lackadaisical quantum walks, the running time scales are as [Formula: see text] and [Formula: see text], respectively.
Abstract Quantum walks are a powerful framework for the development of quantum algorithms, with lackadaisical quantum walks (LQWs) standing out as an efficient model for spatial search. In this work, we investigate how broken-link decoherence affects the performance of LQW-based search on a two-dimensional toroidal grid. We show through numerical simulations that while decoherence drives the loopless walk toward a uniform distribution and eliminates its search capability, the inclusion of self-loops significantly mitigates this effect. In particular, even under noise, the marked vertex remains identifiable with probability well above uniform, demonstrating that self-loops enhance the robustness of LQWs in realistic scenarios. These findings extend the known advantages of LQWs from the noiseless setting to noisy environments, consolidating self-loops as a valuable resource for designing resilient quantum search algorithms.