#48/100: |v⟩ and −|v⟩ are indistinguishable || Quantum Computer Programming in 100 Easy Lessons @RyanODonnellTeaching
#48/100: |v⟩ and −|v⟩ are indistinguishable || Quantum Computer Programming in 100 Easy Lessons  @RyanODonnellTeaching
Uploaded July 2024 | Updated November 2026, 1 day ago
Here we illustrated that "global phase (sign) doesn't matter".

Lesson 48 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.
#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!)Quantum Monte Carlo: Mean Estimation when you have the source codeMin-st-Cut is the dual LP of Max-st-Flow || @ CMU || Lecture 18d of CS Theory ToolkitRounding LP Solutions: Min-Vertex-Cover || @ CMU || Lecture 18c of CS Theory ToolkitLearning About Quantum States 2:  Quantum Dice, and Measurements#17/100: Unnormalized states || Quantum Computer Programming in 100 Easy Lessons#85/100: We need to find the length of a cycle || Quantum Computer Programming in 100 Easy Lessonsk-wise Independent Generators || @ CMU || Lecture 12c of CS Theory Toolkit#1/100: Toggling qubits || Quantum Computer Programming in 100 Easy Lessons
Ryan ODonnell |

#48/100: |v⟩ and −|v⟩ are indistinguishable || Quantum Computer Programming in 100 Easy Lessons

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER