Discrete adiabatic quantum computation with quadric variation

Quantum adiabatic algorithm is a method of solving computational problems by evolving the ground state with a slowly varying Hamiltonian to reach the required output state. This paper proposes a new variation method for the phase functions, quadric variation method. The experiments are carried out solving random instances of 3-SAT problems with three variation methods: linear, cubic, and quadric. The experiment´s result has revealed that the overall search costs with the quadric variation are less than those for other methods with higher probability of finding the solutions on average.