Quantum Information and Computation (2024-25)
Foundations of quantum information and quantum computing.
Overview
An introduction to the foundations of quantum information and quantum computing: qubits and their mathematics, the postulates of quantum mechanics, entanglement, quantum gates and circuits, and the major quantum algorithms.
Assessment
- Midterm exam
- Quiz
- Major exam
Lecture outline
- Course overview.
- Introduction.
- Bounded-error complexity classes: analysis of classical algorithms for the umpire problem, separation of complexity classes between classical and quantum algorithms — a teaser.
- Introduction to quantum computers, qubits and comparison with classical counterparts.
- More on quantum computers, qubits, and quantum gates.
- Mathematics of qubits: superposition, basis, observables, eigenvalues, postulates.
- Global vs relative phases, Bloch sphere for a single qubit, measurements.
- What is a wavefunction? Wave-particle duality; clearing misconceptions on the physical meaning of wavefunctions, superposition, and probabilistic vs deterministic nature.
- Stern-Gerlach experiment, measurements revisited, interpretations of QM, local hidden variable theory.
- Stern-Gerlach experiment (continued), measurement and projection operators.
- Multi-qubit states, tensor product spaces, entangled & separable states.
- Wavefunction vs state, entangled vs separable, measurement of two qubits, probabilities, physical interpretation of the multi-qubit wavefunction.
- Tensor product of vector spaces, direct sum decomposition, multi-qubit measurements.
- Multi-qubit measurements (continued), quantum key distribution (Ekert ‘91).
- Projection operators (single and multi-particle), projective measurements.
- Hermitian operators as observables, eigenspace decomposition, measurement of Hermitian operators.
- Tensor product of Hermitian operators, measurement of multi-qubit observables.
- Three-qubit states, entanglement, measurement, projectors.
- GHZM experiment (arXiv:2011.12671).
- GHZM experiment (continued), quantum teleportation.
- Quantum teleportation (continued), quantum circuits, quantum gates.
- Superdense coding, no-cloning theorem.
- Logic gates and their reversible implementations, universality of classical logic gates.
- Proof of reversibility, quantum oracles, proof of unitarity of the oracle.
- Quantum gates, Toffoli gate, quantum circuits.
- Quantum universality of gates, Solovay-Kitaev theorem, Gottesman-Knill theorem.
- Phase oracle, interference of amplitudes, parallelism.
- Deutsch’s algorithm, Deutsch-Jozsa algorithm.
- Bernstein-Vazirani algorithm.
- Quiz.
- Bernstein-Vazirani: parallelism or not? The algorithm of choice.
- Simon’s algorithm (period-finding).
- Fourier transform.
- Fast Fourier transform.
- Quantum Fourier transform circuit.
- Quantum phase estimation.
- Quantum order-finding algorithm.
- Shor’s algorithm, Grover’s search algorithm.