YoVDO

Quantum Constraint Satisfaction - Richard M. Karp Distinguished Lecture

Offered By: Simons Institute via YouTube

Tags

Quantum Computing Courses Algorithms Courses Theoretical Computer Science Courses NP-completeness Courses Quantum Complexity Theory Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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

Information Theory
The Chinese University of Hong Kong via Coursera
Intro to Computer Science
University of Virginia via Udacity
Analytic Combinatorics, Part I
Princeton University via Coursera
Algorithms, Part I
Princeton University via Coursera
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University via Coursera