Uploaded June 2024 | Updated November 2026, 1 day ago
Suppose you have some classical code that computes a function f, taking in n input bits and outputting 1 bit. There is a natural way to turn it into quantum code that implements "if f then minus". We describe this "quantum spec" in this lesson.
Lesson 21 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.
Suppose you have some classical code that computes a function f, taking in n input bits and outputting 1 bit. There is a natural way to turn it into quantum code that implements "if f then minus". We describe this "quantum spec" in this lesson.
Lesson 21 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.










