#23/100: AND/OR/NOT code (for CCode → QCode) || Quantum Computer Programming in 100 Easy Lessons @RyanODonnellTeaching
#23/100: AND/OR/NOT code (for CCode → QCode) || Quantum Computer Programming in 100 Easy Lessons  @RyanODonnellTeaching
Uploaded June 2024 | Updated November 2026, 3 hours ago
We get started on how to convert classical code to quantum code. The first step is to pass through the simplest kind of classical code, which I call "AND/OR/NOT code". (Some call it "Boolean circuits".)

Lesson 23 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.
#23/100: AND/OR/NOT code (for CCode → QCode) || Quantum Computer Programming in 100 Easy LessonsLearning About Quantum States 8:  Learning the eigenvectors via GL(d) representation theoryLearning Parity with Noise|| @ CMU || Lecture 26b of CS Theory ToolkitSpectral Graph Theory: Enter Linear Algebra || @ CMU || Lecture 13c of CS Theory ToolkitMutual Information || @ CMU || Lecture 24b of CS Theory ToolkitMoments, Concentration, and Initializing an Array || @ CMU || Recitation 4 of CS Theory ToolkitExpander Graphs Application 1: Good Codes || @ CMU || Lecture 16b of CS Theory Toolkit#18/100: How Toggles Detective works (Part 1/2) || Quantum Computer Programming in 100 Easy Lessons#16/100: Hadamards unitary even w/ other qubits || Quantum Computer Programming in 100 Easy Lessons#57/100: Grovering with s satisfying strings || Quantum Computer Programming in 100 Easy LessonsLinear Programming: Bit Complexity || @ CMU || Lecture 17c of CS Theory Toolkit#55/100: Grovers Algorithm, Part 2 || Quantum Computer Programming in 100 Easy Lessons
Ryan ODonnell |

#23/100: AND/OR/NOT code (for CCode → QCode) || Quantum Computer Programming in 100 Easy Lessons

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER