• Open Access IconOpen Access
  • Cite Icon16
  • https://doi.org/10.26421/qic20.13-14-4Copy DOI Icon

Analysis of lackadaisical quantum walks

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

The lackadaisical quantum walk is a quantum analogue of the lazy random walk obtained by adding a self-loop to each vertex in the graph. We analytically prove that lackadaisical quantum walks can find a unique marked vertex on any regular locally arc-transitive graph with constant success probability quadratically faster than the hitting time. This result proves several speculations and numerical findings in previous work, including the conjectures that the lackadaisical quantum walk finds a unique marked vertex with constant success probability on the torus, cycle, Johnson graphs, and other classes of vertex-transitive graphs. Our proof establishes and uses a relationship between lackadaisical quantum walks and quantum interpolated walks for any regular locally arc-transitive graph.

Similar Papers
  • Research Article
  • Citations5

On applying the lackadaisical quantum walk algorithm to search for multiple solutions on grids

  • Dec 05, 2022
  • Information Sciences
  • Jonathan H.A De Carvalho +3
  • Research Article
  • Citations10

One-dimensional lackadaisical quantum walks

  • Nov 24, 2017
  • Journal of Physics A: Mathematical and Theoretical
  • Kun Wang +3
  • Research Article
  • Citations10

On biases of permutation and keystream bytes of RC4 towards the secret key

  • Feb 07, 2009
  • Cryptography and Communications
  • Goutam Paul +1
  • Research Article
  • Citations3

Asymptotic Spectral Analysis on the Johnson Graphs in Infinite Degree and Zero Temperature Limit

  • Jan 01, 2004
  • Interdisciplinary Information Sciences
  • Akihito Hora
  • Research Article
  • Citations21

Constructing quantum Hash functions based on quantum walks on Johnson graphs

  • May 15, 2018
  • Quantum Information Processing
  • Wei-Feng Cao +5
  • Research Article
  • Citations16

Discrete-time quantum walk search on Johnson graphs

  • Jan 02, 2019
  • Quantum Information Processing
  • Xi-Ling Xue +2
  • Research Article
  • Citations42

Network reliability with node failures

  • Feb 03, 2000
  • Networks
  • Shaobin Liu +2
  • Conference Article
  • Citations91

Span programs for functions with constant-sized 1-certificates

  • May 19, 2012
  • Aleksandrs Belovs
  • Research Article
  • Citations8

Deterministic random walks on finite graphs

  • Mar 20, 2014
  • Random Structures & Algorithms
  • Shuji Kijima +2
  • Book Chapter
  • Citations6

(Short Paper) Analysis of a Strong Fault Attack on Static/Ephemeral CSIDH

  • Jan 01, 2021
  • Jason T Legrow +1
  • Research Article
  • Citations28

Discrete q-distributions on Bernoulli trials with a geometrically varying success probability

  • Mar 19, 2010
  • Journal of Statistical Planning and Inference
  • Ch.A Charalambides
  • Research Article
  • Citations1

Pulsation of quantum walk on Johnson graph

  • Nov 19, 2025
  • Quantum Information Processing
  • Taisuke Hosaka +1
  • Research Article
  • Citations23

Faster quantum walk search on a weighted graph

  • Sep 21, 2015
  • Physical Review A
  • Thomas G Wong
  • Research Article
  • Citations9

Modeling the Impact of Spatial Correlations of Road Failures on Travel Times during Adverse Weather Conditions

  • May 07, 2019
  • Transportation Research Record: Journal of the Transportation Research Board
  • Wisinee Wisetjindawat +3
  • Research Article
  • Citations9

NP-hardness of the recognition of coordinated graphs

  • Jul 02, 2008
  • Annals of Operations Research
  • Francisco J Soulignac +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.