Ryan O'Donnell Courses

Constraint Satisfaction Problems - Lecture 20b of CS Theory Toolkit

1 rating

Explore Constraint Satisfaction Problems, their formal definition, examples, and algorithms. Learn about the Dichotomy Theorem and its implications for theoretical computer science research.

• YouTube
• 32 minutes
• Self-Paced
• Free Video

Quantum Algorithms Recap: Hadamard Transform - Lesson 97

Recap quantum algorithms involving the Hadamard Transform, exploring key concepts and applications in quantum computing.

• YouTube
• 30 minutes
• Self-Paced
• Free Video

Factoring Finally Finished - Quantum Computer Programming - Lesson 96

Complete the efficient quantum factoring algorithm by mastering Rotation Estimation in superposition, a crucial step in quantum computing.

• YouTube
• 21 minutes
• Self-Paced
• Free Video

Why Study Quantum Computing? - Lesson 100 of Quantum Computer Programming in 100 Easy Lessons

Explore the significance and potential of quantum computing in this thought-provoking conclusion to a comprehensive series on quantum programming.

• YouTube
• 11 minutes
• Self-Paced
• Free Video

Quantum Algorithms Recap: Factoring - Lesson 99

Explore quantum algorithms for factoring and rotation estimation, understanding their efficiency in quantum computing.

• YouTube
• 18 minutes
• Self-Paced
• Free Video

Quantum Algorithms Recap: Grover's Algorithm and SAT - Lesson 98

Recap geometric and rotational aspects of quantum computing, focusing on Grover's Algorithm for SAT in this advanced quantum programming lesson.

• YouTube
• 17 minutes
• Self-Paced
• Free Video

Learning About Quantum States - Majorization Theorems for the RSK Process

Explore combinatorial theorems on RSK process applied to random words, focusing on Young diagram majorization in different scenarios.

• YouTube
• 22 minutes
• Self-Paced
• Free Video

High-Dimensional Expanders - How I Learned to Stop Worrying and Love Group-Theoretic Constructions

Explore high-dimensional expanders, focusing on 2-dimensional cases, graphs of constant link, and group-theoretic constructions. Gain insights into advanced mathematical concepts and recent research developments.

• YouTube
• 47 minutes
• Self-Paced
• Free Video

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

Explore quantum computing fundamentals and the Elitzur-Vaidman bomb detection algorithm using a single qubit, covering key concepts and practical applications in this engaging lecture.

• YouTube
• 1 hour 8 minutes
• Self-Paced
• Free Video

Improved Quantum Data Analysis - Shadow Tomography

Explore improved quantum shadow tomography, focusing on optimal dependence on observables, dimension, and error tolerance. Learn connections to adaptive data analysis in this advanced talk.

• YouTube
• 59 minutes
• Self-Paced
• Free Video

Dinur's PCP- Degree-Reduction, Expanderizing, Mini-PCP - Lecture 27c of CS Theory Toolkit

Explore Dinur's PCP Theorem proof, covering degree-reduction, expanderizing, and alphabet-reduction in theoretical computer science. Gain insights into advanced concepts for research in computational complexity.

• YouTube
• 26 minutes
• Self-Paced
• Free Video

Deterministic Communication Complexity - Lecture 23b of CS Theory Toolkit

Explore deterministic communication complexity, protocols, matrices, and the Log Rank conjecture in this graduate-level lecture on theoretical computer science fundamentals.

• YouTube
• 37 minutes
• Self-Paced
• Free Video

Trees and Series-Parallel Graphs - Lecture 22a of CS Theory Toolkit

Explore treewidth, CSPs, and graph theory fundamentals for theoretical computer science research, focusing on trees and series-parallel graphs.

• YouTube
• 21 minutes
• Self-Paced
• Free Video

Goemans-Williamson: Rounding the Max-Cut SDP - Lecture 20a of CS Theory Toolkit

Efficient algorithm for approximating maximum graph cuts using semidefinite programming and randomized rounding, with guaranteed performance ratio of 0.878.

• YouTube
• 32 minutes
• Self-Paced
• Free Video

The SDP Relaxation for Max-Cut - Lecture 19b of CS Theory Toolkit

Explore SDP relaxation for Max-Cut, transforming a quadratic program into a semidefinite program solvable by the Ellipsoid Algorithm. Part of CMU's graduate-level CS Theory Toolkit course.

• YouTube
• 33 minutes
• Self-Paced
• Free Video