# Focusing on the Hybrid Quantum Computing -- Tabu Search Algorithm: new results on the Asymmetric Salesman Problem

arXiv: https://arxiv.org/abs/2102.05919 · HTML: https://mlsanity.com/paper/2102.05919/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- Builds on 7 of its 59 references that are in the map.
- First posted on arXiv 11 Feb 2021.

## Builds on (most cited first, 7 of 7)

- [Ising formulations of many NP problems](https://mlsanity.com/paper/1302.5843/) (2013)
- [Stochastic gradient descent for hybrid quantum-classical optimization](https://mlsanity.com/paper/1910.01155/) (2019)
- [Quantum Computing based Hybrid Solution Strategies for Large-scale Discrete-Continuous Optimization Problems](https://mlsanity.com/paper/1910.13045/) (2019)
- [Noise-Resilient Variational Hybrid Quantum-Classical Optimization](https://mlsanity.com/paper/1912.06744/) (2019)
- [Hybrid Quantum Computing -- Tabu Search Algorithm for Partitioning Problems: preliminary study on the Traveling Salesman Problem](https://mlsanity.com/paper/2012.04984/) (2020)
- [An Improved Discrete Bat Algorithm for Symmetric and Asymmetric Traveling Salesman Problems](https://mlsanity.com/paper/1604.04138/) (2016)
- [A Coevolutionary Variable Neighborhood Search Algorithm for Discrete Multitasking (CoVNS): Application to Community Detection over Graphs](https://mlsanity.com/paper/2009.14477/) (2020)

## Built on by (most cited first, 3 of 3)

- [D-Wave's Nonlinear-Program Hybrid Solver: Description and Performance Analysis](https://mlsanity.com/paper/2410.07980/) (2024)
- [QOPTLib: a Quantum Computing Oriented Benchmark for Combinatorial Optimization Problems](https://mlsanity.com/paper/2404.15852/) (2024)
- [Analyzing the behaviour of D'WAVE quantum annealer: fine-tuning parameterization and tests with restrictive Hamiltonian formulations](https://mlsanity.com/paper/2207.00253/) (2022)

## Abstract (arXiv)

Quantum Computing is an emerging paradigm which is gathering a lot of popularity in the current scientific and technological community. Widely conceived as the next frontier of computation, Quantum Computing is still at the dawn of its development. Thus, current solving systems suffer from significant limitations in terms of performance and capabilities. Some interesting approaches have been devised by researchers and practitioners in order to overcome these barriers, being quantum-classical hybrid algorithms one of the most often used solving schemes. The main goal of this paper is to extend the results and findings of the recently proposed hybrid Quantum Computing - Tabu Search Algorithm for partitioning problems. To do that, we focus our research on the adaptation of this method to the Asymmetric Traveling Salesman Problem. In overall, we have employed six well-known instances belonging to TSPLIB to assess the performance of Quantum Computing - Tabu Search Algorithm in comparison to QBSolv, a state-of-the-art decomposing solver. Furthermore, as an additional contribution, this work also supposes the first solving of the Asymmetric Traveling Salesman Problem using a Quantum Computing based method. Aiming to boost whole community's research in QC, we have released the project's repository as open source code for further application and improvements.