Traveling Salesman Problem (TSP)
The Jupyter Notebook for the TSP has a 7 city and a 48 city example with executable code. Both seem to use qbsolv in the classical mode.
1. Is it correct to conclude that no quantum effects are simulated?
2. What modifications are needed so that the 48 city example will execute qbsolv in a hybrid manner (classical-QPU combination)?
3. Suppose we want to change the 48 city example to run another TSP. I recognize that N = the number of cities and the distance matrix need to be changed. What else in the code needs to be modified?
Thanks, Richard H. Warren