English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Quantum Computing is an emerging paradigm which is gathering a lot ofpopularity in the current scientific and technological community. Widelyconceived as the next frontier of computation, Quantum Computing is still atthe dawn of its development. Thus, current solving systems suffer fromsignificant limitations in terms of performance and capabilities. Someinteresting approaches have been devised by researchers and practitioners inorder to overcome these barriers, being quantum-classical hybrid algorithms oneof the most often used solving schemes. The main goal of this paper is toextend the results and findings of the recently proposed hybrid QuantumComputing - Tabu Search Algorithm for partitioning problems. To do that, wefocus our research on the adaptation of this method to the Asymmetric TravelingSalesman Problem. In overall, we have employed six well-known instancesbelonging to TSPLIB to assess the performance of Quantum Computing - TabuSearch Algorithm in comparison to QBSolv, a state-of-the-art decomposingsolver. Furthermore, as an additional contribution, this work also supposes thefirst solving of the Asymmetric Traveling Salesman Problem using a QuantumComputing based method. Aiming to boost whole community's research in QC, wehave released the project's repository as open source code for furtherapplication and improvements.

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