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

Software Engineering Institute (SEI) Podcast Series
18/08/2022 27 min
Using the Quantum Approximate Optimization Algorithm (QAOA) to Solve Binary-Variable Optimization Problems

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

Descargar episodio Ver en sitio original

Episode Synopsis

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 of the podcast Software Engineering Institute (SEI) Podcast Series

Orchestrating the Chaos: Protecting Wireless Networks from Cyber Attacks 02/12/2025
From Data to Performance: Understanding and Improving Your AI Model 10/11/2025
What Could Possibly Go Wrong? Safety Analysis for AI Systems 31/10/2025
Getting Your Software Supply Chain In Tune with SBOM Harmonization 23/10/2025
API Security: An Emerging Concern in Zero Trust Implementations 08/10/2025
Delivering Next-Generation AI Capabilities 29/09/2025
The Benefits of Rust Adoption for Mission-and-Safety-Critical Systems 16/09/2025
Threat Modeling: Protecting Our Nation's Complex Software-Intensive Systems 05/09/2025
Understanding Container Reproducibility Challenges: Stopping the Next Solar Winds 30/07/2025
Mitigating Cyber Risk with Secure by Design 14/07/2025
© 2003-2026 ZARZA | AHEAD OF OUR TIME
privacy policy
In God we trust In God we trust
PreSales Questions? Click Here
or call our toll-free line at +1-888-5002068 Miami, Florida, USA