Using the Quantum Approximate Optimization Algorithm (QAOA) to Solve Binary-Variable Optimization Problems
2022-08-18
Download
Right click and do "save link as"
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
Challenging the Myth of the 10x Programmer
2020-11-09
2020-11-09
Optimizing Process Maturity in CMMC Level 5
2020-10-13
2020-10-13
Quantum Computing: The Quantum Advantage
2020-09-17
2020-09-17
CMMC Scoring 101
2020-09-02
2020-09-02
Developing an Effective CMMC Policy
2020-08-17
2020-08-17
Documenting Process for CMMC
2020-07-30
2020-07-30
Agile Cybersecurity
2020-07-20
2020-07-20
CMMC Levels 1-3: Going Beyond NIST SP-171
2020-07-01
2020-07-01
The Future of Cyber: Secure Coding
2020-06-15
2020-06-15
The Future of Cyber: Cybercrime
2020-05-07
2020-05-07
An Ethical AI Framework
2020-04-28
2020-04-28
My Story in Computing: Madison Quinn Oliver
2020-04-13
2020-04-13
The Future of Cyber: Security and Privacy
2020-02-26
2020-02-26
Get this podcast on your
phone, FREE
