Syllabus
As I am teaching this course for the first time, the syllabus is subject to change. Below is its rough summary though I expect that we will not be able to cover all the listed topics.
| Class | Topic | Concepts |
|---|---|---|
| 1 | Classical Probability Theory | Parametrization of ignorance, stochastic matrices, probability in physics, probability in computation |
| 2-3 | Quantum Probability Amplitudes | Classical vs quantum correlation, Unitary matrices, Particles or waves, Observer effect, Delayed choice experiment, Bomb defusing |
| 4-6 | Quantum operations | Quantum gates and measurements on single qubit, Quantum Zeno effect, Bloch sphere representation, distinguishability of quantum states |
| 7 | Entanglement | Multi-qubit states, classical vs quantum correlation, no-cloning theorem |
| 8 | Mixed states | Density matrices |
| 9 | Quantum Key Distribution | BB84 protocol |
| 10 | Teleportation & Superdense coding | State teleportation, superdense coding |
| 11-16 | Quantum Algorithms | Algorithms of Deutsch–Jozsa, Bernstein–Vazirani, Simon, Shor, Fourier Transform, Grover’s search |
| 17-21 | Noisy Quantum Memories | Error correction, Linear Binary Codes, Stabilizer Codes and stabilizer formalism, Syndrome measurement, Syndrome decoding, Repetition code, CSS code, Toric code |
| 22 | Practical loss tolerant codes | Graph states, tree code |
| 23-24 | Hardware implementation of quantum memories and computation | Matter-based qubits: trapped-ions, neutral atoms, defects in diamond, quantum dots, superconducting qubits, |
| 24-25 | Hardware implementation of quantum communication | Photonic qubits, communication over optical fiber and free space, remote entanglement generation, quantum repeaters |
| 26 | Side topics | Schroedinger’s equation |