#82/100: The Hadamard Test || Quantum Computer Programming in 100 Easy Lessons @RyanODonnellTeaching
#82/100: The Hadamard Test || Quantum Computer Programming in 100 Easy Lessons  @RyanODonnellTeaching
Uploaded August 2024 | Updated November 2026, 2 days ago
In this lesson we state the Hadamard Test, which lets you estimate how much a unitary rotates a state.

Lesson 82 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.
#82/100: The Hadamard Test || Quantum Computer Programming in 100 Easy LessonsSolving the Max-Cut SDP || @ CMU || Lecture 19c of CS Theory ToolkitIntro to Cryptography || @ CMU || Lecture 25a of CS Theory Toolkit#64/100: Rotation Estimation with additive error || Quantum Computer Programming in 100 Easy Lessons#79/100: Quantum win probability of CHSH is 85% | Quantum Computer Programming in 100 Easy LessonsAsymptotically Good Codes || @ CMU || Lecture 11e of CS Theory ToolkitLearning With Errors (LWE) and Public Key Encryption || @ CMU || Lecture 25d of CS Theory ToolkitFinite fields and Grover rotations || @ CMU || Recitation 6 of CS Theory ToolkitCheegers Inequality || @ CMU || Lecture 15d of CS Theory Toolkit#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 Recovery
Ryan ODonnell |

#82/100: The Hadamard Test || Quantum Computer Programming in 100 Easy Lessons

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER