{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T19:07:32Z","timestamp":1767035252302},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,11,26]],"date-time":"2021-11-26T00:00:00Z","timestamp":1637884800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,11,26]],"date-time":"2021-11-26T00:00:00Z","timestamp":1637884800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,11,26]],"date-time":"2021-11-26T00:00:00Z","timestamp":1637884800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,11,26]]},"DOI":"10.1109\/iscmi53840.2021.9654824","type":"proceedings-article","created":{"date-parts":[[2021,12,29]],"date-time":"2021-12-29T19:46:48Z","timestamp":1640807208000},"page":"108-113","source":"Crossref","is-referenced-by-count":3,"title":["Hybrid Quantum Approximate Optimization Using Enhanced Ant Colony Optimization to Solve Large-Scale Combinatorial Optimization Problems"],"prefix":"10.1109","author":[{"given":"Bishad","family":"Ghimire","sequence":"first","affiliation":[]},{"given":"Ausif","family":"Mahmood","sequence":"additional","affiliation":[]},{"given":"Khaled","family":"Elleithy","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"year":"2019","author":"zhou","article-title":"Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices","key":"ref10"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1016\/j.jalgor.2004.06.001"},{"year":"2018","author":"crooks","article-title":"Performance of the quantum approximate optimization algorithm on the maximum cut problem","key":"ref12"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1145\/227683.227684"},{"year":"2019","author":"streif","article-title":"Comparison of QAOA with Quantum and Simulated Annealing","key":"ref14"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.26421\/QIC19.13-14-3"},{"year":"2019","author":"bravyi","article-title":"Obstacles to state preparation and variational optimization from symmetry protection","key":"ref16"},{"year":"2017","author":"jiang","article-title":"Near-optimal quantum circuit for grover’s unstructured search using a transverse field","key":"ref17"},{"year":"2021","author":"li","article-title":"Large-scale Quantum Approximate Optimization via Divide-and-Conquer","key":"ref18"},{"year":"2018","author":"srinivasan","article-title":"Efficient quantum algorithm for solving travelling salesman problem: An IBM quantum experience","key":"ref19"},{"year":"2019","author":"morales","article-title":"On the Universality of the Quantum Approximate Optimization Algorithm","key":"ref4"},{"year":"2015","author":"farhi","article-title":"A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem","key":"ref3"},{"year":"2019","author":"farhi","article-title":"Quantum Supremacy through the Quantum Approximate, Optimization Algorithm","key":"ref6"},{"year":"2014","author":"farhi","article-title":"A Quantum Approximate Optimization Algorithm","key":"ref5"},{"key":"ref8","first-page":"3","article-title":"Combinatorial Optimization Algorithms and Complexity","author":"papadimitriou","year":"1998"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1007\/978-3-030-23922-0"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.3390\/a12020034"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/ACCESS.2020.2970105"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1038\/ncomms5213"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1007\/s42452-019-1829-x"},{"key":"ref21","article-title":"Parallel cooperating ant colonies with improved periodic exchange strategies","author":"ghimire","year":"2014","journal-title":"ACM Conference on High Performance Computing (HPC)"}],"event":{"name":"2021 8th International Conference on Soft Computing & Machine Intelligence (ISCMI)","start":{"date-parts":[[2021,11,26]]},"location":"Cario, Egypt","end":{"date-parts":[[2021,11,27]]}},"container-title":["2021 8th International Conference on Soft Computing & Machine Intelligence (ISCMI)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9654797\/9654798\/09654824.pdf?arnumber=9654824","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T13:00:05Z","timestamp":1652187605000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9654824\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,26]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/iscmi53840.2021.9654824","relation":{},"subject":[],"published":{"date-parts":[[2021,11,26]]}}}