Quantum Approximate Optimization Algorithm and Local Max-Cut - IPAM at UCLA
Offered By: Institute for Pure & Applied Mathematics (IPAM) via YouTube
Course Description
Overview
Explore the application of Quantum Approximate Optimization Algorithm (QAOA) to local variants of classical NP-hard problems in this 28-minute conference talk by Alexandra Kolla from the University of California, Santa Cruz. Delve into the study of QAOA on local problems, focusing on LocalMaxCut as a potential area where quantum algorithms might outperform classical ones. Examine preliminary results suggesting that quantum supremacy may be achievable on complex graphs, while local algorithms still outperform QAOA on simple graph instances. Gain insights into the motivation behind this research, the methodology used, and future directions in the field of quantum numerical linear algebra.
Syllabus
Intro
Motivation
QAOA
Local MaxCut
Results
Taught by
Institute for Pure & Applied Mathematics (IPAM)
Related Courses
Intro to Computer ScienceUniversity of Virginia via Udacity Quantum Mechanics for IT/NT/BT
Korea University via Open Education by Blackboard Emergent Phenomena in Science and Everyday Life
University of California, Irvine via Coursera Quantum Information and Computing
Indian Institute of Technology Bombay via Swayam Quantum Computing
Indian Institute of Technology Kanpur via Swayam