Ryan O'Donnell

#35/100: Kets || Quantum Computer Programming in 100 Easy Lessons

Complexity of Basic Arithmetic || @ CMU || Lecture 7a of CS Theory Toolkit

#71/100: Entanglement || Quantum Computer Programming in 100 Easy Lessons

#82/100: The Hadamard Test || Quantum Computer Programming in 100 Easy Lessons

#83/100: The Hadamard Test: analysis || Quantum Computer Programming in 100 Easy Lessons

#81/100: Rotation Estimation: different settings || Quantum Computer Programming in 100 Easy Lessons

#84/100: Factoring Algorithm: the overview || Quantum Computer Programming in 100 Easy Lessons

#65/100: Rotation Estimation, n digits accuracy? || Quantum Computer Programming in 100 Easy Lessons

#70/100: Tensor product || Quantum Computer Programming in 100 Easy Lessons

#32/100: Correlation || Quantum Computer Programming in 100 Easy Lessons

#67/100: Rotation Estimation: n digits, 10ⁿ steps | Quantum Computer Programming in 100 Easy Lessons

#85/100: We need to find the length of a cycle || Quantum Computer Programming in 100 Easy Lessons

#64/100: Rotation Estimation with additive error || Quantum Computer Programming in 100 Easy Lessons

#86/100: Rotation Estimation gives clues about L || Quantum Computer Programming in 100 Easy Lessons

#75/100: The key property of |EPR〉|| Quantum Computer Programming in 100 Easy Lessons

#73/100: Quantum teleportation: Part 1 || Quantum Computer Programming in 100 Easy Lessons

#76/100: How Alice & Bob mutually rotate |EPR〉|| Quantum Computer Programming in 100 Easy Lessons

#87/100: Finding "L" from the clues || Quantum Computer Programming in 100 Easy Lessons

#68/100: Measuring/deleting one qubit of several || Quantum Computer Programming in 100 Easy Lessons

#88/100: Planes of rotation for IncrL, Part 1|| Quantum Computer Programming in 100 Easy Lessons

#66/100: Factoring via Rotation Estimation: plan || Quantum Computer Programming in 100 Easy Lessons

#74/100: Quantum teleportation: Part 2 || Quantum Computer Programming in 100 Easy Lessons

#89/100: One Steering Wheel vector for IncrL || Quantum Computer Programming in 100 Easy Lessons

#80/100: Rotation Estimation: Bird's-Eye View || Quantum Computer Programming in 100 Easy Lessons

#72/100: Ops on separate qubits: order doesn't matter || Quantum Computer Prog. in 100 Easy Lessons

#79/100: Quantum win probability of CHSH is 85% | Quantum Computer Programming in 100 Easy Lessons

Analysis of Boolean Functions at CMU - Lecture 15: Constraint satisfacation problems

Analysis of Boolean Functions at CMU - Lecture 10: LTFs and noise stability

Dinur's Proof of the PCP Theorem: outline || @ CMU || Lecture 27b of CS Theory Toolkit

Fourier Analysis of Boolean Functions, in Harvard's CS 121 class. Learning, quantum, voting, & more!

Reed--Solomon Codes || @ CMU || Lecture 11d of CS Theory Toolkit

Exponential Time Hypotheses: ETH and SETH || @ CMU || Lecture 26d of CS Theory Toolkit

Great Ideas in Theoretical Computer Science: Linear Algebra (Spring 2016)

#35/100: Kets || Quantum Computer Programming in 100 Easy Lessons

Spectral Graph Theory: conductance and Sparsest-Cut || @ CMU || Lecture 15b of CS Theory Toolkit

Great Ideas in Theoretical Computer Science: Countability and Diagonalization (Spring 2013)

#51/100: The Elitzur-Vaidman Glitter Bomb || Quantum Computer Programming in 100 Easy Lessons

Analysis of Boolean Functions at CMU - Lecture 21: Additive combinatorics

Great Ideas in Theoretical Computer Science: Randomized Algorithms (Spring 2016)

Great Ideas in Theoretical Computer Science: Probability 1 (Spring 2013)

k-wise Independent Generators || @ CMU || Lecture 12c of CS Theory Toolkit

Quantum Computing with Just 1 Qubit | The Elitzur--Vaidman Bomb 'Algorithm'