  In complexity theory, there exists a famous unsolved problem whether NP can
be P or not. In this paper, we discuss this aspect in SAT (satisfiability)
problem, and it is shown that the SAT can be solved in plynomial time by means
of quantum algorithm.
