Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Quantum walk-based search algorithms with multiple marked vertices   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.

20
The categories of this paper are: acc-phys
35
The categories of this paper are: mtrl-th
28
The categories of this paper are: alg-geom
11
The categories of this paper are: hep-lat
24
The categories of this paper are: dg-ga
16
The categories of this paper are: stat
26
The categories of this paper are: bayes-an
37
The categories of this paper are: supr-con
25
The categories of this paper are: patt-sol
3
The categories of this paper are: physics
15
The categories of this paper are: nucl-ex
21
The categories of this paper are: adap-org
0
The categories of this paper are: hep-ph
5
The categories of this paper are: gr-qc
18
The categories of this paper are: econ
27
The categories of this paper are: comp-gas