Study on Adiabatic Quantum Computation in Deutsch Problem

Abstract

Adiabatic quantum computation has been proposed as a quantum algorithm with adiabatic evolution to solve combinatorial optimization problem, then it has been applied to many problems like satisfiability problem. Among them, Deutsch problem has been tried to be solved by using adiabatic quantum computation. In this paper, we modify the adiabatic quantum computation and propose to solve Deutsch problem more efficiently by a method with higher observation probability.