How to make the quantum adiabatic algorithm fail

The quantum adiabatic algorithm is a Hamiltonian based quantum algorithm designed to find the minimum of a classical cost function whose domain has size N. We show that poor choices for the Hamiltonian can guarantee that the algorithm will not find the minimum if the run time grows more slowly than root N. These poor choices are nonlocal and wash out any structure in the cost function to be minimized, and the best that can be hoped for is Grover speedup. These failures tell us what not to do when designing quantum adiabatic algorithms.