Affiliation:
1. State Key Laboratory of Mathematical Engineering and Advanced Computing, Zheng Zhou, Henan, P. R. China
2. University of Science and Technology of China, He Fei, Anhui, P. R. China
Abstract
Quantum computing has shown great potential and advantages in solving integer factorization and disordered database search. However, it is not easy to solve specific problems with quantum computing device efficiently and widely, because a lot of professional background knowledge is required. In order to solve this problem, we propose an optimization problem’s automatic hybird quantum framework (OpAQ) for solving user-specified problems on a hybrid computing architecture including both quantum and classical computing resources. Such a solver can allow nonprofessionals who are not familiar with quantum physics and quantum computing to use quantum computing device to solve some classically difficult problems easily. Combinatorial optimization problem is one of the most important problems in both academic and industry. In this paper, we mainly focus on these problems and solve them with OpAQ, which is based on quantum approximation optimization algorithm (QAOA). We evaluate the performance of our approach in solving Graph Coloring, Max-cut, Traveling Salesman and Knapsack Problem. The experimental results show that quantum solver can achieve almost the same optimal solutions with the classical.
Publisher
World Scientific Pub Co Pte Ltd
Subject
Electrical and Electronic Engineering,Atomic and Molecular Physics, and Optics,Electronic, Optical and Magnetic Materials
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献