Work

A Hybrid Classical-Quantum Annealing Algorithm for the TSP

Year: 2026

Type: conference-paper

Abstract: Hybrid quantum-classical algorithms can help mitigating the physical limitations of current quantum devices, particularly the low qubit count and the reduced topological connectivity. In this paper, we propose a hybrid technique to solve a well-known NP-hard optimization problem: the Traveling Salesperson Problem (TSP). Our approach is based on a graph contraction technique that removes most of the dimensionality of the original problem instance, producing a sub-TSP of a size suitable to be efficiently solved by a quantum device. The performance of our approach is first demonstrated on classical quantum simulation using Path Integral Monte Carlo, and then run on a D-Wave quantum annealer.

Source: Genetic and Evolutionary Computation Conference Companion (GECCO Companion)

DOI: 10.1145/3795101.3814699

Authors: Siwei Hu, Victor Lopata, Salvatore Sinno, Shruthi Thuravakkath, Paolo Zuliani

Institutions: Sapienza University of Rome, Newcastle University

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

OpenAlex ID: W7160949243

FWCI:

Cites: 35

Cited by:

Related to: 10