A quantum search algorithm based on partial adiabatic evolution

This paper presents and implements a specified partial adiabatic search algorithm on a quantum circuit. It studies the minimum energy gap between the first excited state and the ground state of the system Hamiltonian and it finds that,in the case of M = 1,the algorithm has the same performance as the local adiabatic algorithm. However,the algorithm evolves globally only within a small interval,which implies that it keeps the advantages of global adiabatic algorithms without losing the speedup of the local adiabatic search algorithm.     

An adiabatic quantum optimization for exact cover 3 problem

A perturbation method is applied to study the structure of the ground state of the adiabatic quantum optimization for the exact cover 3 problem. It is found that the instantaneous ground state near the end of the evolution is mainly composed of the eigenstates of the problem Hamiltonian, which are Hamming close to the solution state. And the instantaneous ground state immediately after the starting is mainly formed of low energy eigenstates of the problem Hamiltonian. These results are then applied to estimate the minimum gap for a special case.