Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Fast quantum search algorithm and Bounds on it   We recast Grover's generalised search algorithm in a geometric language even
when the states are not approximately orthogonal. We provide a possible search
algorithm based on an arbitrary unitary transformation which can speed up the
steps still further. We discuss the lower and upper bounds on the transition
matrix elements when the unitary operator changes with time, thereby implying
that quantum search process can not be too fast or too slow. This is a
remarkable feature of quantum computation unlike classical one. Quantum
mechanical uncertainty relation puts bounds on search process. Also we mention
the problems of perturbation and other issues in time-dependent search
operation.

25
The categories of this paper are: patt-sol
37
The categories of this paper are: supr-con
29
The categories of this paper are: funct-an
1
The categories of this paper are: cs
20
The categories of this paper are: acc-phys
33
The categories of this paper are: plasm-ph
17
The categories of this paper are: q-fin
26
The categories of this paper are: bayes-an
27
The categories of this paper are: comp-gas
9
The categories of this paper are: nlin
10
The categories of this paper are: q-bio
21
The categories of this paper are: adap-org
19
The categories of this paper are: eess
14
The categories of this paper are: math-ph
0
The categories of this paper are: hep-ph
3
The categories of this paper are: physics