On universal adiabatic quantum computation

We give a careful proof that ground state quantum computation can efficiently simulate universal gate model quantum computation. The proof allows for general gate model quantum computations; no restrictions are required on qubit geometry or on the locality of two-qubit gates. Our lower-bound technique may have more general application.