Physics – Quantum Physics
Scientific paper
2001-07-03
Phys. Rev. A 65, 042308 (2002)
Physics
Quantum Physics
4 pages RevTex, 2 encapsulated Postscript figures
Scientific paper
10.1103/PhysRevA.65.042308
The adiabatic theorem has been recently used to design quantum algorithms of a new kind, where the quantum computer evolves slowly enough so that it remains near its instantaneous ground state which tends to the solution [Farhi et al., quant-ph/0001106]. We apply this time-dependent Hamiltonian approach to the Grover's problem, i. e., searching a marked item in an unstructured database. We find that, by adjusting the evolution rate of the Hamiltonian so as to keep the evolution adiabatic on each infinitesimal time interval, the total running time is of order $\sqrt{N}$, where $N$ is the number of items in the database. We thus recover the advantage of Grover's standard algorithm as compared to a classical search, scaling as $N$. This is in contrast with the constant-rate adiabatic approach developed by Farhi et al., where the requirement of adiabaticity is expressed only globally, resulting in a time of order $N$.
Cerf Nicolas J.
Roland Jérémie
No associations
LandOfFree
Quantum Search by Local Adiabatic Evolution 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 by Local Adiabatic Evolution, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Search by Local Adiabatic Evolution will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-567327