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

Faster search of clustered marked states with lackadaisical quantum walks

Amit Saha, Ritajit Majumdar, Debasri Saha, Amlan Chakrabarti, Susmita Sur‐Kolay

Published Aug 13, 2022• 27 citations
arXivHTMLPDF
DOI
10.1007/s11128-022-03606-6

Related papers

Lackadaisical Quantum Walks with Multiple Marked Vertices

Nikolajs Nahimovs

Lecture notes in computer science•Jan 1, 2019•18 citations

Faster search by lackadaisical quantum walk

Thomas G. Wong

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

Impacts of Multiple Solutions on the Lackadaisical Quantum Walk Search Algorithm

Jonathan H. A. de Carvalho, Luciano S. de Souza, Fernando M. de Paula Neto +1 more

Lecture notes in computer science•Jan 1, 2020•6 citations

Lackadaisical Quantum Walk in the Hypercube to Search for Multiple Marked Vertices

Luciano S. de Souza, Jonathan H. A. de Carvalho, Tiago A. E. Ferreira

arXiv:2108.09399•Lecture notes in computer science•Jan 1, 2021•7 citations

Scaling in the dynamics of directed lackadaisical quantum walks

Pranay Naredi, J. Bharathi Kannan, M. S. Santhanam

arXiv:2211.06167•Physics Letters A•Sep 27, 2025•0 citations

Lackadaisical quantum walks with multiple marked vertices

Nikolajs Nahimovs

The concept of lackadaisical quantum walk -- quantum walk with self loops -- was first introduced for discrete-time quantum walk on one-dimensional line. Later it was successfully applied to improve the running time of the spacial search on two-dimensional grid. In this paper we study search by lackadaisical quantum walk on the two-dimensional grid with multiple marked vertices. First, we show that the lackadaisical quantum walk, similarly to the regular (non-lackadaisical) quantum walk, has exceptional configuration, i.e. placements of marked vertices for which the walk has no speed-up over the classical exhaustive search. Next, we demonstrate that the weight of the self-loop suggested in the previous papers is not optimal for multiple marked vertices. And, last, we show how to adjust the weight of the self-loop to overcome the aforementioned problem.

arXiv:1808.00672•Aug 2, 2018•1 citation
The concept of lackadaisical quantum walk -- quantum walk with self loops -- was first introduced for discrete-time quantum walk on one-dimensional line. Later it was successfully applied to improve the running time of the spacial search on two-dimensional grid. In this paper we study search by lackadaisical quantum walk on the two-dimensional grid with multiple marked vertices. First, we show that the lackadaisical quantum walk, similarly to the regular (non-lackadaisical) quantum walk, has exceptional configuration, i.e. placements of marked vertices for which the walk has no speed-up over the classical exhaustive search. Next, we demonstrate that the weight of the self-loop suggested in the previous papers is not optimal for multiple marked vertices. And, last, we show how to adjust the weight of the self-loop to overcome the aforementioned problem.