A practical applicable quantum-classical hybrid ant colony algorithm for the NISQ era

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Qiu, Qian, Zhang, Liang, Wu, Mohan, Sun, Qichun, Li, Xiaogang, Li, Da-Chuang, Xu, Hua
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908100041113600
author Qiu, Qian
Zhang, Liang
Wu, Mohan
Sun, Qichun
Li, Xiaogang
Li, Da-Chuang
Xu, Hua
author_facet Qiu, Qian
Zhang, Liang
Wu, Mohan
Sun, Qichun
Li, Xiaogang
Li, Da-Chuang
Xu, Hua
contents Quantum ant colony optimization (QACO) has drew much attention since it combines the advantages of quantum computing and ant colony optimization (ACO) algorithm overcoming some limitations of the traditional ACO algorithm. However,due to the hardware resource limitations of currently available quantum computers, the practical application of the QACO is still not realized. In this paper, we developed a quantum-classical hybrid algorithm by combining the clustering algorithm with QACO algorithm.This extended QACO can handle large-scale optimization problems with currently available quantum computing resource. We have tested the effectiveness and performance of the extended QACO algorithm with the Travelling Salesman Problem (TSP) as benchmarks, and found the algorithm achieves better performance under multiple diverse datasets. In addition, we investigated the noise impact on the extended QACO and evaluated its operation possibility on current available noisy intermediate scale quantum(NISQ) devices. Our work shows that the combination of the clustering algorithm with QACO effectively improved its problem solving scale, which makes its practical application possible in current NISQ era of quantum computing.
format Preprint
id arxiv_https___arxiv_org_abs_2410_17277
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle A practical applicable quantum-classical hybrid ant colony algorithm for the NISQ era
Qiu, Qian
Zhang, Liang
Wu, Mohan
Sun, Qichun
Li, Xiaogang
Li, Da-Chuang
Xu, Hua
Quantum Physics
Neural and Evolutionary Computing
Quantum ant colony optimization (QACO) has drew much attention since it combines the advantages of quantum computing and ant colony optimization (ACO) algorithm overcoming some limitations of the traditional ACO algorithm. However,due to the hardware resource limitations of currently available quantum computers, the practical application of the QACO is still not realized. In this paper, we developed a quantum-classical hybrid algorithm by combining the clustering algorithm with QACO algorithm.This extended QACO can handle large-scale optimization problems with currently available quantum computing resource. We have tested the effectiveness and performance of the extended QACO algorithm with the Travelling Salesman Problem (TSP) as benchmarks, and found the algorithm achieves better performance under multiple diverse datasets. In addition, we investigated the noise impact on the extended QACO and evaluated its operation possibility on current available noisy intermediate scale quantum(NISQ) devices. Our work shows that the combination of the clustering algorithm with QACO effectively improved its problem solving scale, which makes its practical application possible in current NISQ era of quantum computing.
title A practical applicable quantum-classical hybrid ant colony algorithm for the NISQ era
topic Quantum Physics
Neural and Evolutionary Computing
url https://arxiv.org/abs/2410.17277