Quick Navigation

Topics

Quantum Optimization Quantum Machine Learning Quantum Simulation

Faster Search by Lackadaisical Quantum Walk

arXiv
Authors: Thomas G. Wong

Year

2017

Paper ID

45075

Status

Preprint

Abstract Read

~2 min

Abstract Words

131

Citations

N/A

Abstract

In the typical model, a discrete-time coined quantum walk searching the 2D grid for a marked vertex achieves a success probability of O\(1/log N\) in O\(sqrt{N log N}\) steps, which with amplitude amplification yields an overall runtime of O\(sqrt{N} log N\). We show that making the quantum walk lackadaisical or lazy by adding a self-loop of weight 4/N to each vertex speeds up the search, causing the success probability to reach a constant near 1 in O\(sqrt{N log N}\) steps, thus yielding an O\(sqrt{log N}\) improvement over the typical, loopless algorithm. This improved runtime matches the best known quantum algorithms for this search problem. Our results are based on numerical simulations since the algorithm is not an instance of the abstract search algorithm.

Why This Paper Matters

  • This paper contributes to the Quantum Machine Learning research area in the Quantum Articles archive.
  • It adds a 2017 reference point for readers tracking recent quantum research.
  • In the typical model, a discrete-time coined quantum walk searching the 2D grid for a marked vertex achieves a success probability of O(1/log N) in O(sqrtN log N) steps, which...

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

Local Citation Graph (Related-Paper Links)

Current Paper #45075 #73048 A Non-Commutative Voronovskaya ... #73043 Challenges in the simulation of... #73041 Comment on "Beyond-classical co... #73031 A Scalable Approach to Solve th...

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.