**Rapid Data Search Using Adiabatic Quantum Computation** - Saurya Das

We show that in Adiabatic Quantum Computation, a suitable choice of time-dependent Hamiltonian can considerably speed up the search for a marked item in an unstructured database (of size N). Consequently, the item can be found in a time much less than O(sqrt(N)), required by previous algorithms. The price to pay is that in intermediate stages of the computation process, the ground state energy of the computer increases to large values, although it returns to zero at the end of the process. We give specific examples of such Hamiltonians and propose ways to keep the intermediate energy low.
REFERENCES: (1) S. Das, R. Kobes, G. Kunstatter, J. Phys. A: Math. Gen. 36 (2003) 1-7 [quant-ph/0204044]. (2) D. Ahrensmeier, S. Das, R. Kobes, G. Kunstatter, H. Zaraket, Proc. of QCMC-02, MIT [quant-ph./0208107].