Hamiltonian Travelling Salesman Problem

Project information

We map the travelling salesman problem to quantum physics problems, and apply efficient Variational Monte Carlo methods to find their ground state, which is equivalent to finding the shortest path.

371 Commits
1 Branch
0 Tags

README

Created on

August 25, 2020

Loading