YoVDO

Quantum Complexity - Quantum Computation at CMU

Offered By: Ryan O'Donnell via YouTube

Tags

Quantum Information Courses NP-Complete Problems Courses NP-completeness Courses Circuit Complexity Courses

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

Automata Theory
Stanford University via edX
Computability, Complexity & Algorithms
Georgia Institute of Technology via Udacity
Advanced Algorithms and Complexity
University of California, San Diego via Coursera
NP-Complete Problems
University of California, San Diego via edX
Razonamiento artificial
Universidad Nacional Autónoma de México via Coursera