Hybrid Quantum Approximate Optimization Using Enhanced Ant Colony Optimization to Solve Large-Scale Combinatorial Optimization Problems

Bishad Ghimire, A. Mahmood, K. Elleithy
{"title":"Hybrid Quantum Approximate Optimization Using Enhanced Ant Colony Optimization to Solve Large-Scale Combinatorial Optimization Problems","authors":"Bishad Ghimire, A. Mahmood, K. Elleithy","doi":"10.1109/ISCMI53840.2021.9654824","DOIUrl":null,"url":null,"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. A class of algorithms referred to as Quantum Approximate Optimization Algorithm (QAOA) have been recently proposed. QAOA attempts to approximately solve hard problems using a protocol know as bang-bang. The technique is based on the unitary evolution using a Hamiltonian encoding of the objective function of the combinatorial optimization problem. QAOA has been explored in the context of several optimization problems such as Max-Cut problem, variational Eigenvalue problem etc. Recently, attempts have been made to create QAOA for the Traveling Salesman Problem (TSP). Due to small node size and limited solution capability of the currently available Quantum computers and/or simulators, we develop a hybrid approach where subgraphs of a TSP tour are executed on a Quantum computer and the results from the quantum optimization are combined in further optimization of the whole tour. Since the local optimization of a subgraph is prone to getting stuck in a local minima, we overcome this problem by using a parallel Ant Colony Optimization Algorithm with periodic pheromone exchange between colonies. Our results are encouraging and yield optimum results for benchmarks with less than 50 nodes, and usually within 1% of the optimal solution for benchmarks with around 200 nodes.","PeriodicalId":260519,"journal":{"name":"2021 8th International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 8th International Conference on Soft Computing & Machine Intelligence (ISCMI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCMI53840.2021.9654824","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

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. A class of algorithms referred to as Quantum Approximate Optimization Algorithm (QAOA) have been recently proposed. QAOA attempts to approximately solve hard problems using a protocol know as bang-bang. The technique is based on the unitary evolution using a Hamiltonian encoding of the objective function of the combinatorial optimization problem. QAOA has been explored in the context of several optimization problems such as Max-Cut problem, variational Eigenvalue problem etc. Recently, attempts have been made to create QAOA for the Traveling Salesman Problem (TSP). Due to small node size and limited solution capability of the currently available Quantum computers and/or simulators, we develop a hybrid approach where subgraphs of a TSP tour are executed on a Quantum computer and the results from the quantum optimization are combined in further optimization of the whole tour. Since the local optimization of a subgraph is prone to getting stuck in a local minima, we overcome this problem by using a parallel Ant Colony Optimization Algorithm with periodic pheromone exchange between colonies. Our results are encouraging and yield optimum results for benchmarks with less than 50 nodes, and usually within 1% of the optimal solution for benchmarks with around 200 nodes.
基于增强蚁群优化的混合量子近似优化求解大规模组合优化问题
量子计算是一项很有前途的技术,可以为破解加密和解决大规模组合优化问题等当今的难题提供突破性的解决方案。最近提出了一类算法,称为量子近似优化算法(QAOA)。QAOA试图使用一种称为bang-bang的协议近似地解决难题。该方法基于对组合优化问题的目标函数进行哈密顿编码的统一演化。在极大割问题、变分特征值问题等优化问题的背景下,对QAOA进行了探讨。最近,有人尝试为旅行推销员问题(TSP)创建QAOA。由于目前可用的量子计算机和/或模拟器的节点大小小,求解能力有限,我们开发了一种混合方法,其中在量子计算机上执行TSP巡回的子图,并且量子优化的结果结合在整个巡回的进一步优化中。针对子图的局部优化容易陷入局部极小值的问题,我们采用蚁群间周期性信息素交换的并行蚁群优化算法来克服这一问题。我们的结果令人鼓舞,对于少于50个节点的基准测试可以产生最佳结果,对于大约200个节点的基准测试通常在最佳解决方案的1%以内。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书