Quantum search by partial adiabatic evolution
Abstract
A quantum search algorithm based on the partial adiabatic evolutionTulsi2009 is provided. We calculate its time complexity by studying the Hamiltonian in a two-dimensional Hilbert space. It is found that the algorithm improves the time complexity, which is O(N/M), of the local adiabatic search algorithmRoland2002, to O(N/M).
0