#92/100: Recapping Factoring technical details || Quantum Computer Programming in 100 Easy Lessons @RyanODonnellTeaching
#92/100: Recapping Factoring technical details || Quantum Computer Programming in 100 Easy Lessons  @RyanODonnellTeaching
Uploaded September 2024 | Updated November 2026, 3 hours ago
We recap the technical details so far for the quantum Factoring algorithm, in preparation for wrapping up the whole algorithm.

Lesson 92 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.
#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#75/100: The key property of |EPR〉|| Quantum Computer Programming in 100 Easy Lessons#43/100: Fun with filters || Quantum Computer Programming in 100 Easy LessonsDeterministic Communication Complexity || @ CMU || Lecture 23b of CS Theory Toolkit#27/100: Loading ±1 truth tables into the state || Quantum Computer Programming in 100 Easy LessonsConstraint Satisfaction Problems || @ CMU || Lecture 20b of CS Theory Toolkit
Ryan ODonnell |

#92/100: Recapping Factoring technical details || Quantum Computer Programming in 100 Easy Lessons

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER