论文信息 - Quantum Algorithms and Mathematical Formulations of Biomolecular Solutions of the Vertex Cover Problem in the Finite-Dimensional Hilbert Space

Quantum Algorithms and Mathematical Formulations of Biomolecular Solutions of the Vertex Cover Problem in the Finite-Dimensional Hilbert Space

In this paper, it is shown that the proposed quantum algorithm for implementing Boolean circuits generated from the DNA-based algorithm solving the vertex-cover problem of any graph G with m edges and n vertices is the optimal quantum algorithm. Next, it is also demonstrated that mathematical solutions of the same biomolecular solutions are represented in terms of a unit vector in the finite-dimensional Hilbert space. Furthermore, for testing our theory, a nuclear magnetic resonance (NMR) experiment of three quantum bits to solve the simplest vertex-cover problem is completed.

[1] H. S. Allen. The Quantum Theory , 1928, Nature.

[2] Athanasios V. Vasilakos,et al. Molecular Computing: Towards a Novel Computing Architecture for Complex Problem Solving , 2014 .

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

[4] A. Turing. On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[5] Richard M. Karp,et al. On the Computational Complexity of Combinatorial Problems , 1975, Networks.

[6] Sandor Imre,et al. Quantum Computing and Communications: An Engineering Approach , 2005 .

[7] Gerd Folkers,et al. On computable numbers , 2016 .

[8] R. Feynman. Simulating physics with computers , 1999 .

[9] R. M. Karp,et al. Computational Complexity of Combinatorial and Graph-Theoretic Problems , 2011 .

[10] 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.