Travelling Sales Person problem,how Quantum computing solves it faster
I checked out a recent article in BBC on Nasa/Google inducting a new Quantum computer – D-wave Two , what impressed me more was it’s benchmark results based on Travelling Salesman Problem(TSP). It’s been long, I did a math post so thought why not do small, simple demo on TSP for you and explain how Quantum computer like D-wave excels at it.
This demo is for people for whom combinatorial optimisation is new or those who want to check out implementation of TSP on Wolfram alpha. This post is not Computation/Mathematics experts as I won’t be covering any algorithms or optimisation approach, this post is just aimed at giving basic understanding of TSP.