Affiliation:
1. Department of Computer Science and Engineering, University of Bridgeport, Bridgeport, CT 06604, USA
Abstract
Quantum computing is a promising technology that may provide breakthrough solutions to today’s difficult problems such as breaking encryption and solving large-scale combinatorial optimization problems. An algorithm referred to as Quantum Approximate Optimization Algorithm (QAOA) has been recently proposed to approximately solve hard problems using a protocol know as bang–bang. The technique is based on unitary evolution using a Hamiltonian encoding of the objective function of the combinatorial optimization problem. The QAOA was explored in the context of several optimization problems such as the Max-Cut problem and the Traveling Salesman Problem (TSP). Due to the relatively small node-size solution capability of the available quantum computers and simulators, we developed a hybrid approach where sub-graphs of a TSP tour can be executed on a quantum computer, and the results from the quantum optimization are combined for a further optimization of the whole tour. Since the local optimization of a sub-graph is prone to becoming trapped in a local minimum, we overcame this problem by using a parallel Ant Colony Optimization (ACO) algorithm with periodic pheromone exchange between colonies. Our method exceeds existing approaches which have attempted partitioning a graph for small problems (less than 48 nodes) with sub-optimal results. We obtained optimum results for benchmarks with less than 150 nodes and results usually within 1% of the known optimal solution for benchmarks with around 2000 nodes.
Subject
Fluid Flow and Transfer Processes,Computer Science Applications,Process Chemistry and Technology,General Engineering,Instrumentation,General Materials Science
Reference36 articles.
1. Quantum Optimization and Quantum Learning: A Survey;Li;IEEE Access,2020
2. Hadfield, S., Wang, Z., O’gorman, B., Rieffel, E.G., Venturelli, D., and Biswas, R. (2019). From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz. Algorithms, 12.
3. Cho, C.Q. (2022). D-Wave’s 500-Qubit Machine Hits the Cloud Experimental prototype offers sneak peek of 7,000-qubit quantum computer. IEEE Spectr., Available online: https://cacm.acm.org/news/262712-d-waves-500-qubit-machine-hits-the-cloud.
4. Wu, Z. (2020, January 3–5). A Comparative Study of solving Traveling Salesman Problem with Genetic Algorithm, Ant Colony Algorithm, and Particle Swarm Optimization. Proceedings of the 2020 2nd International Conference on Robotics Systems and Vehicle Technology, Xiamen, China.
5. Farhi, E., Goldstone, J., and Gutmann, S. (2015). A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem. arXiv.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献