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.

[1]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[2]  Minyi Guo,et al.  Fast parallel molecular algorithms for DNA-based computation: factoring integers , 2004, Proceedings. Fourth IEEE Symposium on Bioinformatics and Bioengineering.

[3]  Weng-Long Chang.  Fast Parallel DNA-Based Algorithms for Molecular Computation: The Set-Partition Problem , 2007, IEEE Transactions on NanoBioscience.

[4]  Timothy F. Havel,et al.  Nuclear magnetic resonance spectroscopy: an experimentally accessible paradigm for quantum computing , 1997, quant-ph/9709001.

[5]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[6]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[7]  R J Lipton,et al.  DNA solution of hard computational problems. , 1995, Science.

[8]  L M Adleman,et al.  Molecular computation of solutions to combinatorial problems. , 1994, Science.