Office: 671 Soda, 642-0572

Lectures:

This course is an introduction to quantum computation, as well as an exploration of the frontiers of research in the field. Topics include:

- The strange properties of quantum correlations exhibited in simple entanglement assisted games such as the EPR games, and their use in generating certifiably random bits.

- Connections between semidefinite programs and quantum computation: QIP = PSPACE and the quantum adversary bounds.

- Quantum interactive proof systems, and their use in proposed schemes for testing quantum mechanics.

- Post-quantum cryptography: the construction of very efficient classical lattice cryptosystems that are believed to be secure against quantum computers.

- The class of quantum states that can be described succinctly. This is the key to classical algorithms for simulating "easy" quantum systems.

Announcements | Homeworks | Notes |

- Computation by teleportation
- Certified random number generation
- Area Law
- Interactive proofs for quantum computations
- Solving linear equations
- Quantum resistant classical cryptosystems
- Classical simulation of Stabilizer circuits
- Computational complexity of linear optics