Software Engineering Institute (SEI) Podcast Series

Using the Quantum Approximate Optimization Algorithm (QAOA) to Solve Binary-Variable Optimization Problems

08.18.2022 - By Members of Technical Staff at the Software Engineering InstitutePlay

Download our free app to listen on your phone

Download on the App StoreGet it on Google Play

In this podcast from the Carnegie Mellon University Software Engineering Institute, Jason Larkin and Daniel Justice, researchers in the SEI’s AI Division, discuss a paper outlining their efforts to simulate the performance of Quantum Approximate Optimization Algorithm (QAOA) for the Max-Cut problem and compare it with some of the best classical alternatives, for exact, approximate, and heuristic solutions.

More episodes from Software Engineering Institute (SEI) Podcast Series