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

Quantum Mechanics for Scientists and Engineers 2
Stanford University via edX Quantum Mechanics for Scientists and Engineers 2
Stanford University via Stanford OpenEdx Quantum Information Science II
Massachusetts Institute of Technology via edX The Hardware of a Quantum Computer
Delft University of Technology via edX Quantum Information Science II: Efficient Quantum Computing - fault tolerance and complexity
Massachusetts Institute of Technology via edX