9 citations · 30 across the 10 of their papers we have counts for
11 papers · 1 filter
Lackadaisical quantum walks on 2D grids with multiple marked vertices
Nikolajs Nahimovs, Raqueline A. M. Santos
Lackadaisical quantum walk (LQW) is a quantum analog of a classical lazy walk, where each vertex has a self-loop of weight . For a regular 2D grid LQW c…
Lackadaisical quantum walks on triangular and honeycomb 2D grids
Nikolajs Nahimovs
In the typical model, a discrete-time coined quantum walk search has the same running time of for 2D rectangular, triangular and honeycomb grids. It is known…
Upperbounds on the probability of finding marked connected components using quantum walks
Adam Glos, Nikolajs Nahimovs, Konstantin Balakirev +1
Quantum walk search may exhibit phenomena beyond the intuition from a conventional random walk theory. One of such examples is exceptional configuration phenomenon -- it appears th…
Lackadaisical quantum walks with multiple marked vertices
Nikolajs Nahimovs
The concept of lackadaisical quantum walk -- quantum walk with self loops -- was first introduced for discrete-time quantum walk on one-dimensional line. Later it was successfully…
On the probability of finding marked connected components using quantum walks
Nikolajs Nahimovs, Raqueline A. M. Santos, Kamil Khadiev
Finding a marked vertex in a graph can be a complicated task when using quantum walks. Recent results show that for two or more adjacent marked vertices search by quantum walk with…
Adjacent vertices can be hard to find by quantum walks
Nikolajs Nahimovs, Raqueline A. M. Santos
Quantum walks have been useful for designing quantum algorithms that outperform their classical versions for a variety of search problems. Most of the papers, however, consider a s…