Adiabatic quantum algorithms
Jeffrey Egger, Micah Blake McCurdy, Jordan Kyriakidis · Canadian Journal of Physics · 2013
We propose a notion of algorithm for adiabatic quantum computing for which one can coherently identify a notion of input, permitting a sensible notion of time complexity. We propose that time complexity bounds for adiabatic algorithms should be sought by examining the geometric structure of that portion of the relevant space of Hamiltonians for which the spectral gap is bounded below.