Solving the Traveling Salesmen Problem with IBM Q Quantum Computers
TimeTuesday, July 306:30pm - 8:30pm
LocationCrystal Foyer and Crystal B
DescriptionQuantum Computing (QC) is an exotic type of computational resource that offers a possibility of better solutions to problems where classical computers have failed to find. Such type of problems are the notorious NP-Complete problems which center around optimization and complex decision-making algorithms. A good example of this type problems is the Traveling Salesman Problems (TSP) which its intend is to find the shortest optimal path across cities and returning to the starting city. In this project we measure the efficiency of IBM quantum computers and their capability of finding an optimal path for the TSP against a regular classical computer.