Rao, MV Panduranga (2007) Bounding Run-Times of Local Adiabatic Algorithms. In: 4th International Conference on Theory and Applications of Models of Computation, MAY 22-25, 2007, Shanghai.
fulltextio0.pdf - Published Version
Restricted to Registered users only
Download (433Kb) | Request a copy
A common trick for designing faster quantum adiabatic algorithms is to apply the adiabaticity condition locally at every instant. However it is often difficult to determine the instantaneous gap between the lowest two eigenvalues, which is an essential ingredient in the adiabaticity condition. In this paper we present a simple linear algebraic technique for obtaining a lower bound on the instantaneous gap even in such a situation. As an illustration, we investigate the adiabatic un-ordered search of van Dam et al.  and Roland and Cerf  when the non-zero entries of the diagonal final Hamiltonian are perturbed by a polynomial (in log N, where N is the length of the unordered list) amount. We use our technique to derive a bound on the running time of a local adiabatic schedule in terms of the minimum gap between the lowest two eigenvalues.
|Item Type:||Conference Paper|
|Additional Information:||Copyright of this article belongs to Springer.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||11 Mar 2010 11:04|
|Last Modified:||19 Sep 2010 05:56|
Actions (login required)