  A new quantum algorithm is proposed to solve Satisfiability(SAT) problems by
taking advantage of non-unitary transformation in ground state quantum
computer. The energy gap scale of the ground state quantum computer is analyzed
for 3-bit Exact Cover problems. The time cost of this algorithm on general SAT
problems is discussed.
