/Quantum-vs-Classical-Algorithms-Traveling-Salesman-Problem

Project for the University of Waterloo IQC comparing classical algorithms with the Quantum Approximate Optimization Algorithm (QAOA) for solving the Traveling Salesman Problem (TSP).

Primary LanguageJupyter Notebook

No issues in this repository yet.