Solving Satisfiability Problems by the Ground-State Quantum Computer

by Wenjin Mao arxiv.org E-print Archive, 23 Jun 2005 A quantum algorithm is proposed to solve the Satisfiability problems by the ground-state quantum computer. The scale of the energy gap of the ground-state quantum computer is analyzed for the 3-bit Exact Cover problem. The time cost of this algorithm on the general SAT problems is discussed. Read more