#74/100: Quantum teleportation: Part 2 || Quantum Computer Programming in 100 Easy Lessons @RyanODonnellTeaching
#74/100: Quantum teleportation: Part 2 || Quantum Computer Programming in 100 Easy Lessons  @RyanODonnellTeaching
Uploaded August 2024 | Updated November 2026, 16 hours ago
In this lesson we finish the explanation of quantum teleportation..

Lesson 74 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.
#74/100: Quantum teleportation: Part 2 || Quantum Computer Programming in 100 Easy Lessons#89/100: One Steering Wheel vector for IncrL || Quantum Computer Programming in 100 Easy Lessons#97½/100: Final Prize Pantry (no quantum) || Quantum Computer Programming in 100 Easy LessonsA non-sofic group#33/100: Hadamard transform: how it works || Quantum Computer Programming in 100 Easy LessonsThe Central Binomial Coefficient || @ CMU || Recitation 1 of CS Theory Toolkit#50/100: Discriminating two rotations || Quantum Computer Programming in 100 Easy Lessons#11/100: Amplitude trees || Quantum Computer Programming in 100 Easy Lessons#61/100: Detecting medium 1-qubit rotations || Quantum Computer Programming in 100 Easy Lessons#35/100: Kets || Quantum Computer Programming in 100 Easy Lessons#47/100: Discriminating 2 qubits: optimal error || Quantum Computer Programming in 100 Easy Lessons#31/100: Bitmasked XOR functions || Quantum Computer Programming in 100 Easy Lessons
Ryan ODonnell |

#74/100: Quantum teleportation: Part 2 || Quantum Computer Programming in 100 Easy Lessons

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER