Quantum Information
Introduction
Quantum Cryptography
Classical: use binary bits.
Quantum: Encode information through superpositions, entaglement, and wavefunction collapse (measurement).
No-cloning Theorem
No guarantee to make an exact replica of an arbitrary quantum state.
Example Encryption Scheme (Bennett and Brassard in 1984)
Using single photons, over 48km of Optical Fiber and 1.6km of free space (shown in 2000).
Alice:
Bob:
Assume Eve is inserted in the middle with another polarizer.
If Alice and Bob rotates their polarizers by 45 degrees,
Simple scheme would be that Alice and Bob exchange ahead of time which bits should be recorded and which are junk.
Aside
- Shor’s Algorithm
Post Quantum Cryptography
- Lattice, CRYSTALS-KYBER, CRYSTALS-DILITHIUM
Quantum Computing
Classical: input bits
QM: input qubits
Question: How is this clock any different from the clock in a classical black box.
Hadamard gate:
Bloch Sphere Represenatation.
2-qubit states.
Quantum Teleportation
Transfer of a quantum state.
Bell states
Also called entangled states or EPR pairs.
Using a nonlinear crystal crystal so that:
Suppose we have Alice and Bob.
Alice recieves
Exchange EPR pair,
EPR
The product of EPR gave rose to multiple interpretations: Copenhagen (Spearheaded by Bohr), Hidden Variables (John Bell 1964, testable inequality, no hidden variables), Subjective Theories.
Subjective Theories
- E.P. Wigner: Wavefunction collapse happens at human brain
- Everett: Multiverse - Each measurement creates universes of all possible universes, but we only exist in one of them (Where does the energy required come from, is this equivalent to hidden variables)