#10/100: Probability trees || Quantum Computer Programming in 100 Easy Lessons @RyanODonnellTeaching
#10/100: Probability trees || Quantum Computer Programming in 100 Easy Lessons  @RyanODonnellTeaching
Uploaded May 2024 | Updated November 2026, 6 hours ago
A simple way to analyze the probabilities arising in probabilistic code. As we'll see, if you just swap the word "amplitudes" for "probabilities", you get "amplitude trees", a simple way to analyze quantum code...

Lesson 1 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.
#10/100: Probability trees || Quantum Computer Programming in 100 Easy Lessons#20/100: Quantum Programming Paradigm 1 || Quantum Computer Programming in 100 Easy Lessons#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
Ryan ODonnell |

#10/100: Probability trees || Quantum Computer Programming in 100 Easy Lessons

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER