Completed
— Example: superdense coding
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Purifications and Fidelity in Quantum Information and Computation - Lesson 12
Automatically move to the next video in the Classroom when playback concludes
- 1 — Introduction
- 2 — Overview
- 3 — Purifications
- 4 — Existence of purifications
- 5 — Schmidt decompositions
- 6 — Unitary equivalence of purifications
- 7 — Example: superdense coding
- 8 — Cryptographic implications
- 9 — HJW theorem
- 10 — Definition of fidelity
- 11 — Properties of fidelity
- 12 — Gentle measurement lemma
- 13 — Uhlmann’s theorem
- 14 — Conclusion
