#53/100: SAT || Quantum Computer Programming in 100 Easy Lessons @RyanODonnellTeaching
#53/100: SAT || Quantum Computer Programming in 100 Easy Lessons  @RyanODonnellTeaching
Uploaded July 2024 | Updated November 2026, 1 hour ago
We discuss the SAT (Satisfiability) problem, the canonical NP-complete problem. Grover's Algorithm will solve it in ~1.4^n time!

Lesson 53 of 100 for the series "Quantum Computer Programming in 100 Easy Lessons".

Taught by Ryan O'Donnell

https://www.cs.cmu.edu/~odonnell
twitter.com/BooleanAnalysis

Filmed at Carnegie Mellon University by Buck Caldwell and Dave Ambroso for Panopto.

Exercises tune: Cover of "Exercices" by Saïan Supa Crew.
#53/100: SAT || Quantum Computer Programming in 100 Easy Lessons#21/100: CCode → QCode, If f then Minus spec || Quantum Computer Programming in 100 Easy Lessons#76/100: How Alice & Bob mutually rotate |EPR〉|| Quantum Computer Programming in 100 Easy LessonsThe secret GCD method they didnt teach you in school.#10/100: Probability trees || Quantum Computer Programming in 100 Easy Lessons#20/100: Quantum Programming Paradigm 1 || 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#97½/100: Final Prize Pantry (no quantum) || Quantum Computer Programming in 100 Easy LessonsA non-sofic group#33/100: Hadamard transform: how it works || Quantum Computer Programming in 100 Easy LessonsThe Central Binomial Coefficient || @ CMU || Recitation 1 of CS Theory Toolkit
Ryan ODonnell |

#53/100: SAT || Quantum Computer Programming in 100 Easy Lessons

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER