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

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 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 investigative journalism exposing Trump’s malfeasance? Do you, like me, consider them one of the most important venues on earth for people to be able to trust right now? No, no, I don't. They are better then MSNBC and CNN in that they do some actual legwork as opposed to talking about ice-cream scoops and extra long hand shakes, but certainly have gotten the "Russian hackers" fever and can't let go of it: https://theintercept.com/2017/01/04/washpost-is-richly-rewarded-for-false-news-about-russia-threat-while-public-is-deceived/ https://theintercept.com/2017/01/04/washpost-is-richly-rewar...