Lackadaisical quantum walks on triangular and honeycomb 2D grids

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.

arXiv commentarXiv admin note: text overlap with arXiv:1808.00672

References in corpus (9)

• Quantum Computation and Decision Trees
• A Quantum Random Walk Search Algorithm
• One-Dimensional Three-State Quantum Walk
• Faster quantum walk algorithm for the two dimensional spatial search
• Grover Search with Lackadaisical Quantum Walks
• Faster Search by Lackadaisical Quantum Walk
• Limit distributions of three-state quantum walks: the role of coin eigenstates
• Spatial quantum search in a triangular network
• Analysis of Lackadaisical Quantum Walks