Part (a) shows that is invariant throughout the interpolation. As the Hamiltonians are Hermitian, is invariant as well: evolution starting in has no leakage into other sectors. The quantum adiabatic theorem may therefore be applied using the restricted spectral gap, even if other sectors of the full Hamiltonian have different low-energy levels.
Combining (b)(iv) with the supplied bound for gives for a constant . The matrix has diagonal entries and off-diagonal entries . Its Gershgorin discs all lie in , so . Thus the runtime criterion for adiabatic preparation of a computational history state is satisfied bywith a sufficiently large constant.
Starting from the supplied initial ground state , the resulting state obeysHere the trace norm follows the question's convention; the conventional trace distance is half this norm. The Hamiltonian has explicitly specified terms, each acting on at most five qubits, so its description and the runtime are polynomial in circuit size. If is polynomially bounded, the whole preparation has polynomial cost. The initial computational input is assumed to have been prepared, as in the premise of the quantum adiabatic theorem.
Articles by others on the same topic
There are currently no matching articles.