Quantum Algorithms of the Vertez Cover Problem on a Quantum Computer

摘要：

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, Grovers 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.

作者: Weng-Long Chang Ting-Ting Ren Mang Feng Shu-Chien Huang Lai Chin Lu Kawuu Weicheng Lin Minyi Guo

作者单位: Department of Computer Science and Information Engineering, National Kaohsiung University of Applied State Key Laboratory of Magnetic Resonance and Atomic and Molecular Physics, Wuhan Institute of Phys

会议类型: 国际会议

会议名称: 2009 WASE International Conference on Information Engineering(2009年国际信息工程会议)(ICIE 2009)

会议地点: 太原

会议语种:英文

页码: 759-762

在线出版日期: 2009-07-10（万方平台首次上网日期，不代表论文的发表时间）