Traveling Salesman Problem Optimization using QAOA in Qiskit

[AditiRupade]

Team Name: QuantumArtist

Your team's name (if your team took part in the QHack Coding Challenge, the name here should match)

Project Description:

Travelling Salesman Problem (TSP) is a known NP-complete problem especially to computer scientists and mathematicians. The problem states that "There is a salesman who is travelling from one city to another to sell something. The goal is to find the shortest path between the cities so that the salesman will be able travel all the cities and return back in as much least time as possible". Given the statement above, this project will aim to reduce the travel time of the salesman using an Quantum Approximate Optimization Algorithm (QAOA).

Presentation:

A hyperlink to an explanatory presentation of your team’s hackathon project in a non-technical form (e.g., video, blog post, jupyter notebook, website, slideshow, etc.).

Source code:

https://github.com/AditiRupade/TSP-Optimization-using-QAOA

Which challenges/prizes would you like to submit your project for?

1. IBM Qiskit Challenge
2. QAOA Challenge
3. Science Challenge

[isaacdevlugt]

Thank you for your submission! There's still time to populate your submission with code, presentation material, etc. Please make any final adjustments before the deadline tonight at 17h00 EST!

Good luck!