arXiv:2403.00367

A Novel Quantum Algorithm for Ant Colony Optimization

Qian Qiu, Mohan Wu, Qichun Sun, Li, Xiaogang, Hua Xu

Published Mar 1, 2024• 2 citations

Abstract

Quantum ant colony optimization (QACO) has drew much attention since it combines the advantages of quantum computing and ant colony optimization (ACO) algorithms and overcomes some limitations of the traditional ACO algorithm. However, due to the hardware resource limitations of currently available quantum computers, such as the limited number of qubits, lack of high-fidelity gating operation, and low noisy tolerance, the practical application of the QACO is quite challenging. In this paper, we introduce a hybrid quantum-classical algorithm by combining the clustering algorithm with QACO algorithm, so that this extended QACO can handle large-scale optimization problems, which makes the practical application of QACO based on available quantum computation resource possible. To verify the effectiveness and performance of the algorithm, we tested the developed QACO algorithm with the Travelling Salesman Problem (TSP) as benchmarks. The developed QACO algorithm shows better performance under multiple data set. In addition, the developed QACO algorithm also manifests the robustness to noise of calculation process, which is typically a major barrier for practical application of quantum computers. Our work shows that the combination of the clustering algorithm with QACO has effectively extended the application scenario of QACO in current NISQ era of quantum computing.

DOI: 10.48550/arxiv.2403.00367

Related papers

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

Qian Qiu, Liang Zhang, Mohan Wu +4 more

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.

arXiv:2410.17277Oct 8, 20240 citations

Quantum Ant Colony Algorithm for Solving the Traveling Salesman Problem: A Theoretical and Practical Analysis

Yida Li

The quantum ant colony algorithm (QACO) is explored as a solution to the traveling salesman problem (TSP), targeting inefficiencies such as slow convergence and local optima entrapment found in traditional ant colony optimization (ACO) methods. By integrating quantum computing elements, specifically quantum rotation gates and qubits, into the ACO framework, QACO demonstrates enhanced efficiency and faster convergence. This paper delves into the foundational principles of quantum computing and their application to refine ACO, effectively solving the TSP. An in-depth analysis is provided, showcasing QACO's advantages over traditional ACO through empirical examples. These examples illustrate QACO's potential to improve path planning for applications within the rapidly growing e-commerce and logistics sectors. The integration of quantum mechanisms facilitates a more dynamic pheromone update process, which significantly reduces the likelihood of premature convergence and enhances solution quality in complex optimization scenarios. This advancement indicates a promising direction for future research in algorithmic optimization in both theoretical and practical applications.

Applied and Computational EngineeringNov 28, 20241 citation

Hybrid Parallel Ant Colony Optimization for Application to Quantum Computing to Solve Large-Scale Combinatorial Optimization Problems

Bishad Ghimire, Ausif Mahmood, Khaled M. Elleithy

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.

Applied SciencesOct 29, 20238 citations

A novel quantum algorithm for ant colony optimisation

Mrityunjay Ghosh, Nivedita Dey, Debdeep Mitra +1 more

Abstract Ant colony optimisation (ACO) is a commonly used meta‐heuristic to solve complex combinatorial optimisation problems like the travelling salesman problem (TSP), vehicle routing problem (VRP) etc. However, classical ACO algorithms provide better optimal solutions but do not reduce computation time overhead to a significant extent. Algorithmic speed‐up can be achieved by using parallelism offered by quantum computing. Existing quantum algorithms to solve ACO are either quantum‐inspired classical algorithms or hybrid quantum‐classical algorithms. Since all these algorithms need the intervention of classical computing, leveraging the true potential of quantum computing on real quantum hardware remains a challenge. This study's main contribution is to propose a fully quantum algorithm to solve ACO, enhancing the quantum information processing toolbox in the fault‐tolerant quantum computing (FTQC) era. We have solved the single source single destination (SSSD) shortest‐path problem using our proposed adaptive quantum circuit for representing the dynamic pheromone‐updating strategy in real IBMQ devices. Our quantum ACO technique can be further used as a quantum ORACLE to solve complex optimisation problems in a fully quantum setup with significant speed up upon the availability of more qubits.

arXiv:2010.07413IET Quantum CommunicationNov 2, 202125 citations

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

Bishad Ghimire, Ausif Mahmood, Khaled M. Elleithy

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.

International Conference on Soft Computing & Machine Intelligence (ISCMI)Nov 26, 20216 citations

Algoritmos cuánticos y Quantum Ant Colony Optimization

Mikel Garcia de Andoin

[EN] I propose an improved algorithm that can be implemented on a real quantum computer with a new guided exploration strategy. The benchmarks made by simulating the quantum circuit shows that the time to solve a problem using QACO could outperform greatly other classical bio-inspired algorithms, in particular the one QACO is based on, the Ant Colony Optimization. Quantum computation is on the verge of becoming the new technology for solving time- and energy-consuming problems. To make use of the full potential of quantum computers one must implement algorithms that are significantly different from the ones used on digital computers. This work serves as an introduction to both quantum computing and algorithms. Starting from the basis of the quantum physics, I expose each of the steps needed to understand the mathematics beneath this topic. Using this basis, I develope one quantum algorithm from scratch. Based on a previously proposed Quantum Ant Colony Optimization (QACO) algorithm, I propose an improved algorithm that can be implemented on a real quantum computer with a new guided exploration strategy. The benchmarks made by simulating the quantum circuit shows that the time to solve a problem using QACO could outperform greatly other classical bio-inspired algorithms, in particular the one QACO is based on, the Ant Colony Optimization.

Dec 15, 20200 citations