Academic Learning
Ryan O'Donnell
Computer science and mathematics lectures span theoretical foundations, complexity, Boolean-function analysis, and quantum computing. The catalog combines online research talks with full course series, ranging from an introductory quantum-programming sequence to graduate-level theory classes. It is best suited to learners seeking rigorous, curriculum-style instruction and willing to meet stated prerequisites in programming, probability, linear algebra, discrete mathematics, or CS theory.
Editorially reviewed:

Based on 20 recent videos
Assessed 03 October 2026
Editorial note
WorthWatch verdict
Best for
self-directed learners pursuing rigorous theoretical computer science
Strength
cumulative lecture sequences for proof-based quantum and complexity study
Consider if
you have the programming, mathematics, and theory prerequisites for advanced material
Recent videos
Latest from the source
Deep Dive
Ryan O'Donnell: Rigorous Paths Through Complexity and Quantum Computing
Main focus
Ryan O'Donnell organizes theoretical computer science and mathematics into full university-style courses, from complexity theory and Boolean functions to quantum computing. Research talks sit alongside sequences designed for undergraduate and graduate study.
Why it matters
Choose this archive when you want a sustained route into theoretical CS rather than a quick overview. Course sequences make it possible to follow subjects such as quantum programming or complexity theory across a structured run of lectures.
Style
Full-length lectures anchor Ryan O'Donnell, with course series paced for cumulative study and online research talks adding specialist perspectives. The teaching invites learners to work through formal concepts, proofs, and technical prerequisites.
Consistency
Course runs and research talks shape a 386-video collection spanning introductory quantum programming through graduate theory. One undergraduate sequence is incomplete.
- Complexity theory
- Quantum computing and programming
- Analysis of Boolean functions
- Theoretical computer science foundations
- Mathematical proofs and discrete structures
- Academic research talks
Check prerequisites before starting: several series assume programming, probability, linear algebra, discrete mathematics, proofs, or earlier computer science theory.




