#55/100: Grovers Algorithm, Part 2 || Quantum Computer Programming in 100 Easy Lessons @RyanODonnellTeaching
#55/100: Grovers Algorithm, Part 2 || Quantum Computer Programming in 100 Easy Lessons  @RyanODonnellTeaching
Uploaded July 2024 | Updated November 2026, 2 days ago
In this lesson we wrap up the description and analysis of Grover's Algorithm for (Unique-)SAT(-search).

Lesson 55 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.
#55/100: Grovers Algorithm, Part 2 || Quantum Computer Programming in 100 Easy LessonsEntropy, and cryptographic pseudorandom generators || @ CMU || Recitation 12 of CS Theory ToolkitCSP Approximability: Optimization and Certification || @ CMU || Lecture 20c of CS Theory Toolkit#32/100: Correlation of Boolean functions || Quantum Computer Programming in 100 Easy LessonsRandom Reversible Circuits || For Tim Gowerss 60th Birthday WorkshopSpectral Graph Theory: eigenvalues || @ CMU || Lecture 15a of CS Theory Toolkit#78/100: Classical win probability of CHSH is 75% | Quantum Computer Programming in 100 Easy LessonsEpsilon-biased Generators || @ CMU || Lecture 12d of CS Theory ToolkitLayer cakes and slivers || @ CMU || Recitation 3 of CS Theory Toolkit#60/100: 1-qubit Rotation Estimation: Overview || Quantum Computer Programming in 100 Easy Lessons#59/100: Grover when you know p to within 1% || Quantum Computer Programming in 100 Easy Lessons#95/100: Rotation Estimation in superposition: 1 || Quantum Computer Programming in 100 Easy Lessons
Ryan ODonnell |

#55/100: Grover's Algorithm, Part 2 || Quantum Computer Programming in 100 Easy Lessons

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER