Ryan O'Donnell Courses

Quantum Query Complexity - Quantum Computation at CMU

Explore quantum query complexity, decision problems, and key concepts like Simon's algorithm and element distinctness in this advanced lecture on quantum computation.

• YouTube
• 1 hour 21 minutes
• On-Demand
• Free Video

Shor's Factoring Algorithm - Lecture 16 of Quantum Computation at CMU

Explore Shor's Factoring Algorithm, a groundbreaking quantum computation technique that challenges traditional cryptography and revolutionizes number theory and computer science.

• YouTube
• 1 hour 20 minutes
• On-Demand
• Free Video

Revealing XOR-Patterns I - Lecture 11 of Quantum Computation at CMU

Explore quantum computation concepts like XOR-patterns, sign implementation, and superposition in this advanced lecture on revealing quantum patterns and functions.

• YouTube
• 1 hour 24 minutes
• On-Demand
• Free Video

Basics of Quantum Computing - Lecture 10 of Quantum Computation at CMU

Explore quantum computing fundamentals, including efficiency, probabilities, circuits, gates, and reversible computation. Gain insights into key concepts and important questions in this field.

• YouTube
• 1 hour 23 minutes
• On-Demand
• Free Video

Partial Measurements and Spooky Action at a Distance - Quantum Computation at CMU

Explore partial measurements and quantum entanglement in this lecture, delving into the fascinating concept of "spooky action at a distance" and its implications for quantum computation.

• YouTube
• 1 hour 22 minutes
• On-Demand
• Free Video

Multi-Qubit Systems - Lecture 5 of Quantum Computation at CMU

Explore multi-qubit systems, tensor products, and joint states in quantum computation. Learn about Bell states and fundamental properties of quantum systems with multiple qubits.

• YouTube
• 1 hour 23 minutes
• On-Demand
• Free Video

Unitary Transformations and the Elitzur-Vaidman Bomb - Quantum Computation at CMU

Explore unitary transformations and the Elitzur-Vaidman bomb paradox in quantum computation, covering linear transformations, reflections, and allowable quantum operations.

• YouTube
• 1 hour 22 minutes
• On-Demand
• Free Video

Understanding and Measuring One Qubit - Lecture 3 of Quantum Computation and Information at CMU

Explore quantum mechanics fundamentals, focusing on understanding and measuring one qubit. Learn about measuring devices, inner products, and quantum notation.

• YouTube
• 1 hour 21 minutes
• On-Demand
• Free Video

Razborov-Smolensky Lower Bounds for AC0[p] - Graduate Complexity Lecture at CMU

Explore Razborov-Smolensky lower bounds for AC0[p] circuits, covering key theorems, gate replacements, and error bounds in computational complexity theory.

• YouTube
• 1 hour 13 minutes
• On-Demand
• Free Video

Permanent is #P-Complete: Graduate Complexity Lecture at CMU

Explore the #P-completeness of the Permanent problem in this advanced computational complexity theory lecture, covering key concepts and reduction techniques.

• YouTube
• 1 hour 14 minutes
• On-Demand
• Free Video

The Switching Lemma - PRST Version - Graduate Complexity Lecture at CMU

Explore the Switching Lemma in computational complexity theory, focusing on the PRST version and its proof, with insights on decision trees and probability bounds.

• YouTube
• 55 minutes
• On-Demand
• Free Video

IP = PSPACE - Graduate Complexity Lecture at CMU

Explore interactive proof systems and their relationship to complexity classes, focusing on the IP = PSPACE theorem and its implications for computational theory.

• YouTube
• 1 hour 19 minutes
• On-Demand
• Free Video

Algebraic Circuit Complexity

Explore algebraic circuit complexity, including models, formulas, and NP connections in computational complexity theory.

• YouTube
• 1 hour 20 minutes
• On-Demand
• Free Video

Approximate Counting - Graduate Complexity Lecture at CMU

Explore advanced computational complexity theory, focusing on approximate counting techniques, Chebyshev's Inequality, and interactive proofs in this graduate-level lecture.

• YouTube
• 1 hour 20 minutes
• On-Demand
• Free Video

More on Constant-Round Interactive Proof Systems - Graduate Complexity Lecture at CMU

Explore constant-round interactive proof systems in computational complexity theory, covering MA, AM, BPP, and efficient error reduction techniques.

• YouTube
• 1 hour 21 minutes
• On-Demand
• Free Video