Quantum search by partial adiabatic evolution
Yingyu Zhang, Songfeng Lu · Physical Review A · 2010
A quantum search algorithm based on the partial adiabatic evolution [Phys. Rev. A 80, 052328 (2009)] is provided. We calculate its time complexity and find that the algorithm improves the time complexity, which is $O(\sqrt{N/M})$, of the local adiabatic search algorithm [Phys. Rev. A 65, 042308 (2002)] to $O(\sqrt{N}/M)$.