Quantum Complexity - Quantum Computation at CMU
Offered By: Ryan O'Donnell via YouTube
Course Description
Overview
Explore the intricacies of quantum complexity in this comprehensive lecture from Carnegie Mellon University's Quantum Computation and Quantum Information course. Delve into key topics such as error probabilities, complexity classes, circuit complexity, NP and NP-complete problems, and NP variance. Learn from Professor Ryan O'Donnell as he guides you through the fundamental concepts and advanced theories in quantum computation. Gain valuable insights into the intersection of quantum mechanics and computational complexity theory, enhancing your understanding of this cutting-edge field.
Syllabus
Intro
QBP
Error probabilities
Complexity Classes
Circuit Complexity
NP
NPcomplete
NP variance
NP particular
Taught by
Ryan O'Donnell
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