Uploaded June 2024 | Updated November 2026, 4 days ago
If f : {0,1}ⁿ → {0,1} is any Boolean function that is easy to compute classically, then the qubit command "if f(B1, ..., Bn) then Minus" (the "phase oracle for f") is easy to compute quantumly. In this episode we show why this is.
Lesson 26 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.
If f : {0,1}ⁿ → {0,1} is any Boolean function that is easy to compute classically, then the qubit command "if f(B1, ..., Bn) then Minus" (the "phase oracle for f") is easy to compute quantumly. In this episode we show why this is.
Lesson 26 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.










