Instead of traditionally (globally) adiabatic evolution algorithm for unstructured search, we focus on the structured adiabatic quantum search by nesting a partial search over a reduced set of variables into a global search for solving an optimization problem on adaptive support vector regression (ASVR) yielding an average complexity of order radicnalpha, with alpha<1, compared with a quadratic speedup of order radicN over a naive Grover 's search.
Published in:
Innovative Computing, Information and Control, 2007. ICICIC '07. Second International Conference on
Date of Conference: 5-7 Sept. 2007