Carl A. Waldspurger, Tad Hogg, et al.
IEEE Transactions on Software Engineering
The first experimental demonstration of an adiabatic quantum optimization algorithm is given. It is shown that a concrete procedure turning a continuous time adiabatic quantum algorithm into a discrete version, even when certain restrictions apply to the accessible Hamiltonians. The results indicate that there exists an optimal run time of the algorithm which can be roughly predicted using a simple decoherence model.