Quantum Algorithm to Solve Satisfiability Problems

Abstract

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.

5 pages, 3 figures

References in corpus (3)

• Relaxation and Metastability in the RandomWalkSAT search procedure
• Mimicking Time Evolution within a Quantum Ground State: Ground-State Quantum Computation, Cloning, and Teleportation
• Efficiency of Ground State Quantum Computer

Cited by in corpus (4)

• Adiabatic Quantum Computing
• Simple proof of equivalence between adiabatic quantum computation and the circuit model
• The Phase Transition in Exact Cover
• Quantum Algorithms of Bio-molecular Solutions for the Clique Problem on a Quantum Computer