用于量子机器上可满足性问题的生物分子解决方案的量子算法。

Quantum algorithms for biomolecular solutions of the satisfiability problem on a quantum machine.

作者信息

Chang Weng-Long, Ren Ting-Ting, Luo Jun, Feng Mang, Guo Minyi, Weicheng Lin Kawuu

机构信息

Department of Computer Science and Information Engineering, National Kaohsiung University of Applied Sciences, Kaohsiung City 80778, Taiwan, ROC.

出版信息

IEEE Trans Nanobioscience. 2008 Sep;7(3):215-22. doi: 10.1109/TNB.2008.2002286.

DOI:10.1109/TNB.2008.2002286

PMID:18779102

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.

摘要

在本文中，我们证明了基于DNA的算法在解决可满足性问题的一般情况下所执行的逻辑计算，可以通过我们提出的量子算法在由多伊奇提出的量子机器上更高效地实现。为了验证我们的理论，我们进行了一个用于解决最简单可满足性问题的三量子比特核磁共振实验。