# Quantum Information and Computation

## General information

- Guillaume Aubrun (Lyon 1), Andre Chailloux (Inria Paris), Omar Fawzi (ENS Lyon)

This course will give the student the basics of quantum information science, as well as some selected research topics in particular on quantum algorithms and on the mathematics of quantum states. For the introductory part we plan to cover:
- Modeling quantum systems
- Quantum circuits, superdense coding, quantum teleportation
- Examples of quantum speedup: Deutsch-Josza's and Simon's problem
- Shor's factoring algorithm
- Grover's search algorithm

And the more advanced topics:
- Quantum query algorithms and complexity (e.g., collision-finding, lower bound methods)
- Geometry of the set of separable (not entangled) states (e.g, entanglement measures, properties of random states)

Prerequisites: Familiarity with linear algebra and probability will be assumed. Prior exposure to quantum information or complexity theory is a plus, but is not assumed.
### Resources