Quick revision to Grover's algorithm and solve a Boolean Satisfiability Problem. Then, apply to a Travelling Salesman Problem. As Grover's algorithm is $O(sqrt(N)), both problems are still in exponential time.
-
Chapter 1 Grover's algorithm revision and illustrate with an example Boolean Satisfiability Problem.
-
Chapter 2 attempt to solve a 4 nodes Travelling Salesman Problem.
- Qiskit 1.0.2 or up is required.
- Install qiskit 1.x, https://www.youtube.com/watch?v=dZWz4Gs_BuI
- Grover's algorithm, https://en.wikipedia.org/wiki/Grover%27s_algorithm
- Boolean Satisfiability Problem, https://en.wikipedia.org/wiki/Boolean_satisfiability_problem
- Travelling Salesman Problem, https://en.wikipedia.org/wiki/Travelling_salesman_problem