Uploaded July 2024 | Updated November 2026, 4 days ago
In this lesson we talk about how Grover's Algorithm for SAT *cannot* be made asymptotically faster if all you assume you ever do with the circuit C is run it on input strings. Thus, to the same extent that you believe NP is not P, and additionally the "Strong Exponential Time Hypothesis" (basically, that SAT requires 2^n time), you should also believe that quantum algorithms require sqrt(2)^n time to solve SAT, and therefore cannot efficiently solve NP-hard problems.
Lesson 56 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.
In this lesson we talk about how Grover's Algorithm for SAT *cannot* be made asymptotically faster if all you assume you ever do with the circuit C is run it on input strings. Thus, to the same extent that you believe NP is not P, and additionally the "Strong Exponential Time Hypothesis" (basically, that SAT requires 2^n time), you should also believe that quantum algorithms require sqrt(2)^n time to solve SAT, and therefore cannot efficiently solve NP-hard problems.
Lesson 56 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.










