Quantum search by partial adiabatic evolution
Data Structures and Algorithms
2015-05-19 v1 Quantum Physics
Abstract
A quantum search algorithm based on the partial adiabatic evolution\cite{Tulsi2009} 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 , of the local adiabatic search algorithm\cite{Roland2002}, to .
Cite
@article{arxiv.1007.1528,
title = {Quantum search by partial adiabatic evolution},
author = {Ying-Yu Zhang and Song-Feng Lu},
journal= {arXiv preprint arXiv:1007.1528},
year = {2015}
}