Quantum speedup of the Travelling Salesman Problem for bounded-degree graphs

Abstract

The Travelling Salesman Problem is one of the most famous problems in graph theory. However, little is currently known about the extent to which quantum computers could speed up algorithms for the problem. In this paper, we prove a quadratic quantum speedup when the degree of each vertex is at most 3 by applying a quantum backtracking algorithm to a classical algorithm by Xiao and Nagamochi. We then use similar techniques to accelerate a classical algorithm for when the degree of each vertex is at most 4, before speeding up higher-degree graphs via reductions to these instances.

12 pages, 3 figures, 1 table

References in corpus (2)

• Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games
• Quantum Walks and Electric Networks

Cited by in corpus (13)

• Quantum Spectral Clustering
• Applying quantum algorithms to constraint satisfaction problems
• Quantum Computing: Towards Industry Reference Problems
• Quantum speedup of branch-and-bound algorithms
• Finding spin-glass ground states using quantum walks
• The Travelling Salesman Problem and Adiabatic Quantum Computation: An Algorithm
• A hybrid algorithm framework for small quantum computers with application to finding Hamiltonian cycles
• Hybrid divide-and-conquer approach for tree search algorithms
• Multi-disk clutch optimization using quantum annealing
• An upper bound for min-max angle of polygons
• Gaussian Amplitude Amplification for Quantum Pathfinding
• Leveraging Analog Neutral Atom Quantum Computers for Diversified Pricing in Hybrid Column Generation Frameworks
• Quantum Algorithms for Unsupervised Machine Learning and Neural Networks