Physics – Quantum Physics
Scientific paper
2004-12-15
Physics
Quantum Physics
4 pages, no figure
Scientific paper
Grover's algorithm is one of the most important quantum algorithms, which performs the task of searching an unsorted database without a priori probability. Recently the adiabatic evolution has been used to design and reproduce quantum algorithms, including Grover's algorithm. In this paper, we show that quantum search algorithm by adiabatic evolution has two properties that conventional quantum search algorithm doesn't have. Firstly, we show that in the initial state of the algorithm only the amplitude of the basis state corresponding to the solution affects the running time of the algorithm, while other amplitudes do not. Using this property, if we know a priori probability about the location of the solution before search, we can modify the adiabatic evolution to make the algorithm faster. Secondly, we show that by a factor for the initial and finial Hamiltonians we can reduce the running time of the algorithm arbitrarily. Especially, we can reduce the running time of adiabatic search algorithm to a constant time independent of the size of the database. The second property can be extended to other adiabatic algorithms.
Wei Zhaohui
Ying Mingsheng
No associations
LandOfFree
Quantum search algorithm by adiabatic evolution under a priori probability does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Quantum search algorithm by adiabatic evolution under a priori probability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum search algorithm by adiabatic evolution under a priori probability will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-93077