Quick Navigation
Topics
Quantum Machine Learning
Quantum State Preparation Representation
Lackadaisical quantum walks on triangular and honeycomb 2D grids
arXiv
Authors: Nikolajs Nahimovs
Year
2020
Paper ID
21987
Status
Preprint
Abstract Read
~2 min
Abstract Words
120
Citations
N/A
Abstract
In the typical model, a discrete-time coined quantum walk search has the same running time of O\(sqrt{N} log{N}\) for 2D rectangular, triangular and honeycomb grids. It is known that for 2D rectangular grid the running time can be improved to O\(sqrt{N log{N}}\) using several different techniques. One of such techniques is adding a self-loop of weight 4/N to each vertex (i.e. making the walk lackadaisical). In this paper we apply lackadaisical approach to quantum walk search on triangular and honeycomb 2D grids. We show that for both types of grids adding a self-loop of weight 6/N and 3/N for triangular and honeycomb grids, respectively, results in O\(sqrt{N log{N}}\) running time.
Why This Paper Matters
- This paper contributes to the Quantum Machine Learning research area in the Quantum Articles archive.
- It adds a 2020 reference point for readers tracking recent quantum research.
- In the typical model, a discrete-time coined quantum walk search has the same running time of O(sqrtN logN) for 2D rectangular, triangular and honeycomb grids.
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
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
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.