Quantum Constraint Satisfaction - Richard M. Karp Distinguished Lecture
Offered By: Simons Institute via YouTube
Course Description
Overview
Explore the quantum analog of NP-completeness in this Richard M. Karp Distinguished Lecture delivered by Sandy Irani from UC Irvine. Delve into the local Hamiltonian problem, the cornerstone of quantum Hamiltonian complexity, and its parallels with classical constraint satisfaction. Examine how key aspects of NP-completeness translate to the quantum setting, including search-to-decision, dichotomy theorems, unique solutions, and approximation. Gain insights into potential strategies for addressing QMA-hardness in quantum applications. Learn from Irani's expertise spanning online algorithms, scheduling, resource allocation, and quantum computation, with a focus on quantum complexity theory. This lecture, part of a series honoring Richard M. Karp's contributions to theoretical computer science, offers a comprehensive overview of quantum constraint satisfaction for a broad scientific audience.
Syllabus
Quantum Constraint Satisfaction | Richard M. Karp Distinguished Lecture
Taught by
Simons Institute
Related Courses
Algorithms: Design and Analysis, Part 2Stanford University via Coursera Intro to Theoretical Computer Science
Udacity 算法设计与分析(高级) | Advanced Design and Analysis of Algorithms
Peking University via edX Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Stanford University via Coursera Algorithm Design and Analysis
University of Pennsylvania via edX