Abstract
Adiabatic quantum computation has been proposed as quantum parallel processing with adiabatic evolution by using a superposition state to solve combinatorial optimization problem, then it has been applied to many problems like satisfiability problem. Among them, Deutsch and Deutsch-Jozsa problems have been tried to be solved by using adiabatic quantum computation. In our previous paper, it has been shown that the adiabatic quantum computation in Deutsch problem is modified by using a cubic step function instead of a linear step parameter. In this paper, it is proposed to solve Bernstein-Vazirani problem more efficiently by the same cubic method to obtain a solution with higher observation probability of 99.6%.
