#9/100: Superposition-creating instructions || Quantum Computer Programming in 100 Easy Lessons @RyanODonnellTeaching
#9/100: Superposition-creating instructions || Quantum Computer Programming in 100 Easy Lessons  @RyanODonnellTeaching
Uploaded May 2024 | Updated November 2026, 3 days ago
A definition of the Hadamard instruction (gate), as well as some other quantum instructions that create superpositions.

Lesson 9 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.
#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#29/100: Quantum Bias-Busting (Deutsch Jozsa) || Quantum Computer Programming in 100 Easy Lessons#32/100: Correlation || Quantum Computer Programming in 100 Easy Lessons#82/100: The Hadamard Test || Quantum Computer Programming in 100 Easy LessonsSolving the Max-Cut SDP || @ CMU || Lecture 19c of CS Theory ToolkitIntro to Cryptography || @ CMU || Lecture 25a of CS Theory Toolkit#64/100: Rotation Estimation with additive error || Quantum Computer Programming in 100 Easy Lessons#79/100: Quantum win probability of CHSH is 85% | Quantum Computer Programming in 100 Easy LessonsAsymptotically Good Codes || @ CMU || Lecture 11e of CS Theory Toolkit
Ryan ODonnell |

#9/100: Superposition-creating instructions || Quantum Computer Programming in 100 Easy Lessons

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER