Quantum Algorithm to Solve Satisfiability Problems
classification
🪐 quant-ph
keywords
problemsquantumalgorithmcomputergroundsatisfiabilitysolvestate
read the original 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.
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.