Completed
What about eavesdropping?
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Quantum Computation and Information Security
Automatically move to the next video in the Classroom when playback concludes
- 1 Intro
- 2 Secure Communication
- 3 RSA encryption Ron Rivest, Adi Shamir, and Leonard Adleman - Choose two prime numbers and multiply
- 4 How hard is factoring?
- 5 Thought experiment: Schrodinger's Cat
- 6 1 hour later, the cat is 50% dead
- 7 50% alive, 50% dead
- 8 Introducing the quantum bit (qubit)
- 9 A Qubit is in a complex state, with infinite possibilities
- 10 Building a Qubit
- 11 Aside on cryptography • Alice and Bob want to communicate
- 12 Polarizing Light
- 13 Represent Bits as Polarized Light
- 14 Measuring Photons
- 15 Quantum Key Distribution
- 16 What about eavesdropping?
- 17 Key Validation
- 18 Classical computers can be built from NAND gates only
- 19 Quantum Computers can be built from CNOT gates and single-qubit operators
- 20 Experimental demonstration of 2 qubits
- 21 Factoring N=15: Construct a function
- 22 Factoring N=15: Find the period
- 23 Factoring N=15: Apply QFT
- 24 Factor 15: Find the factors
- 25 How fast is Shor's algorithm?
- 26 Summary
