| Literature DB >> 18779102 |
Weng-Long Chang1, Ting-Ting Ren, Jun Luo, Mang Feng, Minyi Guo, Kawuu Weicheng Lin.
Abstract
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.Mesh：
Substances：
Year: 2008 PMID： 18779102 DOI： 10.1109/TNB.2008.2002286
Source DB: PubMed Journal: IEEE Trans Nanobioscience ISSN： 1536-1241 Impact factor: 2.935