#56/100: Grovers SAT speedup is unimprovable || Quantum Computer Programming in 100 Easy Lessons @RyanODonnellTeaching
#56/100: Grovers SAT speedup is unimprovable || Quantum Computer Programming in 100 Easy Lessons  @RyanODonnellTeaching
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.
#56/100: Grovers SAT speedup is unimprovable || Quantum Computer Programming in 100 Easy Lessons#45/100: Discriminating 2 qubits, 2-sided error || Quantum Computer Programming in 100 Easy LessonsRandomized Communication Complexity || @ CMU || Lecture 23c of CS Theory Toolkit#72/100: Ops on separate qubits: order doesnt matter || Quantum Computer Prog. in 100 Easy Lessons#46/100: Discriminating 2 qubits, multiple copies | Quantum Computer Programming in 100 Easy LessonsSpectral Graph Theory: The Standard Random Walk || @ CMU || Lecture 13b of CS Theory Toolkit#81/100: Rotation Estimation: different settings || Quantum Computer Programming in 100 Easy Lessons#51/100: The Elitzur-Vaidman Glitter Bomb || Quantum Computer Programming in 100 Easy Lessons#9/100: Superposition-creating instructions || Quantum Computer Programming in 100 Easy LessonsFourier, Decision Trees, Learning Algorithms || @ CMU || Recitation 5 of CS Theory Toolkit#68/100: Measuring/deleting one qubit of several || Quantum Computer Programming in 100 Easy LessonsSpectral Graph Theory: the Markov transition operator || @ CMU || Lecture 14a of CS Theory Toolkit
Ryan ODonnell |

#56/100: Grover's SAT speedup is unimprovable || Quantum Computer Programming in 100 Easy Lessons

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER