#11/100: Amplitude trees || Quantum Computer Programming in 100 Easy Lessons @RyanODonnellTeaching
#11/100: Amplitude trees || Quantum Computer Programming in 100 Easy Lessons  @RyanODonnellTeaching
Uploaded May 2024 | Updated November 2026, 23 hours ago
This lesson describes how to go from quantum code to "amplitude trees", which let you figure out the new state of your qubits after running the code. Once you know this, you can (in principle) figure out how any quantum program works!

Lesson 11 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.
#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#92/100: Recapping Factoring technical details || Quantum Computer Programming in 100 Easy Lessons#7/100: Classical reversible instructions || Quantum Computer Programming in 100 Easy LessonsFiber bundle codes: Breaking the N¹ᐟ² polylog(N) barrier for quantum LDPC codes#39/100: From North Pole to Gabon to Singapore || Quantum Computer Programming in 100 Easy Lessons#25/100: Finishing CCode → QCode || Quantum Computer Programming in 100 Easy LessonsFourier Analysis of Boolean Functions, in Harvards CS 121 class. Learning, quantum, voting, & more!#41/100: Dot products || Quantum Computer Programming in 100 Easy Lessons
Ryan ODonnell |

#11/100: Amplitude trees || Quantum Computer Programming in 100 Easy Lessons

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER