Add to ORKG© 2018, Pleiades Publishing, Ltd. 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 Grover’s coin may have no speed-up over classical exhaustive search. In this paper, we analyze the probability of finding a marked vertex for a set of connected components of marked vertices. We prove two upper bounds on the probability of finding a marked vertex and sketch further research directions
The main results on quantum walk search are scattered over different, incomparable frameworks, most ...
The quantum walk dynamics obey the laws of quantum mechanics with an extra locality constraint, whic...
We study scattering quantum walks on highly symmetric graphs and use the walks to solve search probl...
© 2018, Pleiades Publishing, Ltd. Finding a marked vertex in a graph can be a complicated task when ...
Quantum walk search may exhibit phenomena beyond the intuition from a conventional random walk theor...
A quantum walk algorithm can detect the presence of a marked vertex on a graph quadratically faster ...
We give a quantum algorithm for finding a marked element on the grid when there are multiple marked ...
We solve an open problem by constructing quantum walks that not only detect but also find marked ver...
Many quantum algorithms critically rely on quantum walk search, or the use of quantum walks to speed...
This book addresses an interesting area of quantum computation called quantum walks, which play an i...
There has been a very large body of research on searching a marked vertex on a graph based on quantu...
Some of the quantum searching models have been given by perturbed quantum walks. Driving some pertur...
The spatial search problem aims to find a marked vertex of a finite graph using a dynamic with two c...
We provide a new spatial search algorithm by continuous-time quantum walk which can find a marked no...
This thesis considers the use of the quantum walk for graph-based pattern recognition tasks. The mai...
The main results on quantum walk search are scattered over different, incomparable frameworks, most ...
The quantum walk dynamics obey the laws of quantum mechanics with an extra locality constraint, whic...
We study scattering quantum walks on highly symmetric graphs and use the walks to solve search probl...
© 2018, Pleiades Publishing, Ltd. Finding a marked vertex in a graph can be a complicated task when ...
Quantum walk search may exhibit phenomena beyond the intuition from a conventional random walk theor...
A quantum walk algorithm can detect the presence of a marked vertex on a graph quadratically faster ...
We give a quantum algorithm for finding a marked element on the grid when there are multiple marked ...
We solve an open problem by constructing quantum walks that not only detect but also find marked ver...
Many quantum algorithms critically rely on quantum walk search, or the use of quantum walks to speed...
This book addresses an interesting area of quantum computation called quantum walks, which play an i...
There has been a very large body of research on searching a marked vertex on a graph based on quantu...
Some of the quantum searching models have been given by perturbed quantum walks. Driving some pertur...
The spatial search problem aims to find a marked vertex of a finite graph using a dynamic with two c...
We provide a new spatial search algorithm by continuous-time quantum walk which can find a marked no...
This thesis considers the use of the quantum walk for graph-based pattern recognition tasks. The mai...
The main results on quantum walk search are scattered over different, incomparable frameworks, most ...
The quantum walk dynamics obey the laws of quantum mechanics with an extra locality constraint, whic...
We study scattering quantum walks on highly symmetric graphs and use the walks to solve search probl...