9 citations · 30 across the 10 of their papers we have counts for
1 paper · 1 filter
Nikolajs Nahimovs
In the typical model, a discrete-time coined quantum walk search has the same running time of O(NlogN) for 2D rectangular, triangular and honeycomb grids. It is known…