Quantum walk-based search algorithms with multiple marked vertices
Quantum Physics
2022-12-21 v4 Computational Complexity
Data Structures and Algorithms
Abstract
The quantum walk is a powerful tool to develop quantum algorithms, which usually are based on searching for a vertex in a graph with multiple marked vertices, Ambainis's quantum algorithm for solving the element distinctness problem being the most shining example. In this work, we address the problem of calculating analytical expressions of the time complexity of finding a marked vertex using quantum walk-based search algorithms with multiple marked vertices on arbitrary graphs, extending previous analytical methods based on Szegedy's quantum walk, which can be applied only to bipartite graphs. Two examples based on the coined quantum walk on two-dimensional lattices and hypercubes show the details of our method.
Cite
@article{arxiv.2103.12878,
title = {Quantum walk-based search algorithms with multiple marked vertices},
author = {G. A. Bezerra and P. H. G. Lugão and R. Portugal},
journal= {arXiv preprint arXiv:2103.12878},
year = {2022}
}
Comments
12 pages, 1 table, 2 figs