#87/100: Finding L from the clues || Quantum Computer Programming in 100 Easy Lessons @RyanODonnellTeaching
#87/100: Finding L from the clues || Quantum Computer Programming in 100 Easy Lessons  @RyanODonnellTeaching
Uploaded August 2024 | Updated November 2026, 2 hours ago
In this lesson we illustrate how an efficient classical algorithm can figure out the mystery cycle length "L" given just a few random "clues" of the type spit out by Rotation Estimation.

Lesson 87 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.
#87/100: Finding L from the clues || Quantum Computer Programming in 100 Easy LessonsRelaxing ILPs to LPs: Bipartite Max-Perfect-Matching || @ CMU || Lecture 18b of CS Theory ToolkitPauli error estimation via Population RecoveryGoemans Williamson: Rounding the Max-Cut SDP || @ CMU || Lecture 20a of CS Theory ToolkitComputational Indistinguishability || @ CMU || Lecture 25b of CS Theory ToolkitInformation Complexity || @ CMU || Lecture 24c of CS Theory ToolkitA problem re the k-Consistency Algorithm for CSPs  || @ CMU || Recitation 11 of CS Theory ToolkitMax-st-Flow is an LP || @ CMU || Lecture 18a of CS Theory Toolkit#48/100: |v⟩ and −|v⟩ are indistinguishable || Quantum Computer Programming in 100 Easy LessonsAlgorithms for Bounded Treewidth || @ CMU || Lecture 22(c) of CS Theory ToolkitSemidefinite relaxation problems || @ CMU || Recitation 10 of CS Theory ToolkitThe Math Behind Quantum Algorithms (in Scratch!)
Ryan ODonnell |

#87/100: Finding "L" from the clues || Quantum Computer Programming in 100 Easy Lessons

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER