Unstructured Adiabatic Quantum Search |
| |
Authors: | M. Andrecut M. K. Ali |
| |
Affiliation: | (1) Department of Physics, University of Lethbridge, Lethbridge, AB, Canada, T1K 3M4 |
| |
Abstract: | In the adiabatic quantum computation model, a computational procedure is described by the continuous time evolution of a time dependent Hamiltonian. We apply this method to the Grover's problem, i.e., searching a marked item in an unstructured database. Classically, the problem can be solved only in a running time of order O(N) (where N is the number of items in the database), whereas in the quantum model a speed up of order has been obtained. We show that in the adiabatic quantum model, by a suitable choice of the time-dependent Hamiltonian, it is possible to do the calculation in constant time, independent of the the number of items in the database. However, in this case the initial time-complexity of is replaced by the complexity of implementing the driving Hamiltonian. |
| |
Keywords: | quantum computation adiabatic quantum search |
本文献已被 SpringerLink 等数据库收录! |
|