#18/100: How Toggles Detective works (Part 1/2) || Quantum Computer Programming in 100 Easy Lessons @RyanODonnellTeaching
#18/100: How Toggles Detective works (Part 1/2) || Quantum Computer Programming in 100 Easy Lessons  @RyanODonnellTeaching
Uploaded June 2024 | Updated November 2026, 3 days ago
Here we start to show how the Mystery Toggles demo from Lesson 2 actually works.

Lesson 18 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.
#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 LessonsEntropy, and cryptographic pseudorandom generators || @ CMU || Recitation 12 of CS Theory ToolkitCSP Approximability: Optimization and Certification || @ CMU || Lecture 20c of CS Theory Toolkit#32/100: Correlation of Boolean functions || Quantum Computer Programming in 100 Easy LessonsRandom Reversible Circuits || For Tim Gowerss 60th Birthday WorkshopSpectral Graph Theory: eigenvalues || @ CMU || Lecture 15a of CS Theory Toolkit#78/100: Classical win probability of CHSH is 75% | Quantum Computer Programming in 100 Easy LessonsEpsilon-biased Generators || @ CMU || Lecture 12d of CS Theory Toolkit
Ryan ODonnell |

#18/100: How Toggles Detective works (Part 1/2) || Quantum Computer Programming in 100 Easy Lessons

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER