No title
The traveling salesman problem (TSP) is a well-known computationally hard problem often used to benchmark new optimization algorithms. With recent advances in the field of quantum computing, quantum optimization algorithms are emerging as promising new ways to potentially solve such problems that remain difficult for classical computers. However, most modern quantum processing units (QPUs) still l
