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.
Podden och tillhörande omslagsbild på den här sidan tillhör Members of Technical Staff at the Software Engineering Institute. Innehållet i podden är skapat av Members of Technical Staff at the Software Engineering Institute och inte av, eller tillsammans med, Poddtoppen.
