Recently,there has been a growing interest in the adiabatic quantum computation (AQC).The AQC was first proposed by Farhi to solve the 3-SAT problem,[1] which is NP-complete,but soon it was proved that it is equivalent to the standard circuit model.[2,3] Conventionally,the AQC works by applying a time-dependent Hamiltonian(H)(t) that interpolates smoothly from an initial Hamiltonian(H)I,whose ground state is an equal superposition of the computational basis,to a final Hamiltonian (H)p,whose ground state encodes the solution to the computation problem.If the Hamiltonian (H)(t) varies sufficiently slowly,then the quantum adiabatic theorem guarantees that the final state of the quantum computer will be very close to the ground state of the final Hamiltonian.Thus a measurement on the final state will yield a solution of the problem with high probability.