Quantum algorithms of the vertex cover problem on a quantum computer
Journal
2009 WASE International Conference on Information Engineering, ICIE 2009
Journal Volume
2
Pages
100-103
Date Issued
2009
Author(s)
SHU-CHIEN HUANG
Abstract
In this paper, it is demonstrated that solving an instance of the vertex cover problem of any graph G with m edges and n vertices can be implemented by Hadamard gates, NOT gates, CNOT gates, CCNOT gates, Grover's operators, and quantum measurements on a quantum computer. To test our theory, an NMR (nuclear magnetic resonance) experiment for the simplest vertex-cover problem is also performed.
Type
conference paper