The adiabatic theorem and quantum adiabatic computing

The quantum adiabatic approximation has a long history. Recently, the realization that the adiabatic approximation could be used as the basis for a method of quantum computing has generated a resurgence of interest in this topic. We present a simple proof of the theorem with explicit error bounds and sketch the application of the bounds to Grovers algorithm.