#49/100: The No-Distinguishing Principle || Quantum Computer Programming in 100 Easy Lessons @RyanODonnellTeaching
#49/100: The No-Distinguishing Principle || Quantum Computer Programming in 100 Easy Lessons  @RyanODonnellTeaching
Uploaded July 2024 | Updated November 2026, 1 day ago
We discuss the No-Distinguishing Principle (and its corollaries, the more famous "No-Cloning Principle", and the "No-Learning Principle").

Lesson 49 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.
#49/100: The No-Distinguishing Principle || Quantum Computer Programming in 100 Easy Lessons#80/100: Rotation Estimation: Birds-Eye View || Quantum Computer Programming in 100 Easy LessonsSpectral Graph Theory problems || @ CMU || Recitation 8 of CS Theory ToolkitLinear Programming: Optimization Reduces to Feasibility || @ CMU || Lecture 17d of CS Theory Toolkit#8/100: Path diagrams/matrices for instructions || Quantum Computer Programming in 100 Easy Lessons#26/100: Programming If f then Minus || Quantum Computer Programming in 100 Easy LessonsLinear Programming problems, and Convex Programming || @ CMU || Recitation 9 of CS Theory Toolkit#67/100: Rotation Estimation: n digits, 10ⁿ steps | Quantum Computer Programming in 100 Easy Lessons#63/100: Factor-1% Rotation Estimation loose ends | Quantum Computer Programming in 100 Easy Lessons#38/100: Every rotation is 2-D rotations || Quantum Computer Programming in 100 Easy LessonsQuantum Computing with Just 1 Qubit  |  The Elitzur Vaidman Bomb Algorithm#56/100: Grovers SAT speedup is unimprovable || Quantum Computer Programming in 100 Easy Lessons
Ryan ODonnell |

#49/100: The No-Distinguishing Principle || Quantum Computer Programming in 100 Easy Lessons

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER