Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Depth optimization of quantum search algorithms beyond Grover's
  algorithm   Grover's quantum search algorithm provides a quadratic speedup over the
classical one. The computational complexity is based on the number of queries
to the oracle. However, depth is a more modern metric for noisy
intermediate-scale quantum computers. We propose a new depth optimization
method for quantum search algorithms. We show that Grover's algorithm is not
optimal in depth. We propose a quantum search algorithm, which can be divided
into several stages. Each stage has a new initialization, which is a rescaling
of the database. This decreases errors. The multistage design is natural for
parallel running of the quantum search algorithm.

20
The categories of this paper are: acc-phys
16
The categories of this paper are: stat
4
The categories of this paper are: cond-mat
10
The categories of this paper are: q-bio
36
The categories of this paper are: cmp-lg
3
The categories of this paper are: physics
15
The categories of this paper are: nucl-ex
12
The categories of this paper are: nucl-th
17
The categories of this paper are: q-fin
0
The categories of this paper are: hep-ph
25
The categories of this paper are: patt-sol
7
The categories of this paper are: hep-th
27
The categories of this paper are: comp-gas
31
The categories of this paper are: ao-sci
6
The categories of this paper are: astro-ph
23
The categories of this paper are: solv-int