Solving Satisfiability Problems by the Ground-State Quantum Computer
<|reference_start|>Solving Satisfiability Problems by the Ground-State Quantum Computer: 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.<|reference_end|>
@article{mao2005solving,
    title={Solving Satisfiability Problems by the Ground-State Quantum Computer},
    author={Wenjin Mao},
    journal={Phys. Rev. A 72, 052316 (2005)},
    year={2005},
    doi={10.1103/PhysRevA.72.052316},
    archivePrefix={arXiv},
    eprint={quant-ph/0506200},
    primaryClass={quant-ph cond-mat.mes-hall cs.CC}
}