Quantum speedup of the Travelling Salesman Problem for bounded-degree graphs — mentioned by rdtsc

Tue, 13 Feb 2018 22:31:41 GMT

Now I was wondering about TSP why it was mentioned at all and if there were any new results since I dabbled in quantum computing. It seems with some constraints on vertex degrees, which seems to be practical, it's possible to do have some speedup (not polynomial of course). For example https://arxiv.org/abs/1612.06203 claims O(1.3^N) for 4 nodes vs O(1.6^N) for classical. For example with N=500 that's 1e57 vs 1e102. But yeah still wouldn't have picked it as _the_ example to use. Not on topic but since Scott had to mention it... > Would you agree that the Washington Post has been a leader in…

Paper and discussion history. A mention is not an endorsement.

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

Quantum speedup of the Travelling Salesman Problem for bounded-degree graphs — mentioned by rdtsc