Solving Satisfiability Problems by the Ground-State Quantum Computer
Quantum Physics
2009-11-11 v1 Mesoscale and Nanoscale Physics
Computational Complexity
Abstract
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.
Cite
@article{arxiv.quant-ph/0506200,
title = {Solving Satisfiability Problems by the Ground-State Quantum Computer},
author = {Wenjin Mao},
journal= {arXiv preprint arXiv:quant-ph/0506200},
year = {2009}
}
Comments
Extended version of quant-ph/0411194. 8 pages, 7 figures