Quantum Algorithm to Solve Satisfiability Problems
Quantum Physics
2015-06-26 v2
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.
Cite
@article{arxiv.quant-ph/0411194,
title = {Quantum Algorithm to Solve Satisfiability Problems},
author = {Wenjin Mao},
journal= {arXiv preprint arXiv:quant-ph/0411194},
year = {2015}
}
Comments
5 pages, 3 figures