Implementable Hybrid Quantum Ant Colony Optimization Algorithm
Mikel Garcia de Andoin, Javier Echanobe

TL;DR
This paper introduces a hybrid quantum-classical ant colony optimization algorithm designed for near-term quantum computers, effectively solving NP-hard problems like the Quadratic Assignment Problem through quantum superposition and guided exploration.
Contribution
It presents an improved, implementable quantum ant colony optimization algorithm that leverages quantum superposition and exploration strategies for constrained NP-hard problems.
Findings
Simulated noiseless quantum circuit validates the algorithm.
Experiments on IBM quantum computers demonstrate practical feasibility.
The approach efficiently explores solution spaces without pre-checking solutions.
Abstract
We propose a new hybrid quantum algorithm based on the classical Ant Colony Optimization algorithm to produce approximate solutions for NP-hard problems, in particular optimization problems. First, we discuss some previously proposed Quantum Ant Colony Optimization algorithms, and based on them, we develop an improved algorithm that can be truly implemented on near-term quantum computers. Our iterative algorithm codifies only the information about the pheromones and the exploration parameter in the quantum state, while subrogating the calculation of the numerical result to a classical computer. A new guided exploration strategy is used in order to take advantage of the quantum computation power and generate new possible solutions as a superposition of states. This approach is specially useful to solve constrained optimization problems, where we can implement efficiently the exploration…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
