Lackadaisical quantum walks on triangular and honeycomb 2D grids
share
In the typical model, a discrete-time coined quantum walk search has the same running time of O(√(N)logN) for 2D rectangular, triangular and honeycomb grids. It is known that for 2D rectangular grid the running time can be improved to O(√(N logN)) 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(√(N logN)) running time.
READ FULL TEXT