"Exponential Quantum Speedup for the Traveling Salesman Problem"!

BQP algorithm with exponential speedup, reducing complexity to O(N^3 log(N)κ/ε + 1/ε^3) vs classical O(N^N).

A breakthrough in quantum computing for NP-hard problems!

https://eprint.iacr.org/2024/626.pdf