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.
Chang
Weng-Long
WL
Department of Computer Science and Information Engineering, National Kaohsiung University of Applied Sciences, Kaohsiung City 80778, Taiwan, ROC. changwl@cc.kuas.edu.tw
Ren
Ting-Ting
TT
Luo
Jun
J
Feng
Mang
M
Guo
Minyi
M
Weicheng Lin
Kawuu
K
D000465:Algorithms; D001704:Biopolymers / Q000737:chemistry*; D003198:Computer Simulation; D039301:Computers, Molecular; D004247:DNA / Q000737:chemistry*; D008956:Models, Chemical; D011789:Quantum Theory
D001704:Biopolymers; D004247:DNA