  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 being current solving systems suffering 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 solver 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.
