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.
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.










