Quantum Algorithms for Biomolecular Solutions of the Satisfiability Problem on a Quantum Machine.

In this paper, we demonstrate that the logic computation performed by the DNA-based algorithm for solving general cases of the satisfiability problem can be implemented more efficiently by our proposed quantum algorithm on the quantum machine proposed by Deutsch. To test our theory, we carry out a three-quantum bit nuclear magnetic resonance experiment for solving the simplest satisfiability problem. [ABSTRACT FROM PUBLISHER]