On the probability of finding marked connected components using quantum walks
Quantum Physics
2018-05-15 v2
Abstract
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.
Keywords
Cite
@article{arxiv.1710.04046,
title = {On the probability of finding marked connected components using quantum walks},
author = {Nikolajs Nahimovs and Raqueline A. M. Santos and Kamil Khadiev},
journal= {arXiv preprint arXiv:1710.04046},
year = {2018}
}
Comments
13 pages. To appear at Lobachevskii Journal of Mathematics