Travelling Salesman on a Quantum Computer.
Developed by Stephen Jordan at https://github.com/stephenjordan/qaoa_tsp. This repo just updates syntax so it compiles with the modern QDK out of the box.
This project runs the Travelling Salesman Optimization Problem (TSP-OPT) using the .net6 framework and qdk on 4 cities with 6 total routes.
See this blogpost for a surface level explanation.
See the original article for a more detailed rundown of the maths to form the Ising-Hamiltonian.
Requires the Microsoft QDK.
- compile:
dotnet build - run:
dotnet run --project TSP