In this paper, we present an implementation of a Job Selection Problem (JSP) -- a generalization of the well-known Travelling Salesperson Problem (TSP) -- of N=9 jobs on its Quadratic Unconstrained Binary Optimization (QUBO) form, using O(N) qubits on DWave's Advantage_system4.1 quantum annealing device. The best known quantum algorithm for TSP to date uses O(N2) qubits. A solution is found using the quantum method. However, since hardware is not yet able to compensate the increase in search-space size, no present overall advantage is achieved when comparing the quantum results with either exhaustive or equiprobably sampled classical solutions of the problem.
@article{arxiv.2309.16522,
title = {Quantum hobbit routing: Annealer implementation of generalized Travelling Salesperson Problem},
author = {Iñigo Perez Delgado and Beatriz García Markaida and Aitor Moreno Fdez. de Leceta and Jon Ander Ochoa Uriarte},
journal= {arXiv preprint arXiv:2309.16522},
year = {2023}
}