Solving Satisfiability Problems by the Ground-State Quantum Computer
classification
🪐 quant-ph
cond-mat.mes-hallcs.CC
keywords
quantumcomputerground-stateproblemsalgorithmsatisfiabilityanalyzedcost
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.