### LTAT.04.004

## Quantum Seminar

- Tuesdays 14:15-16:45

- Ãœlikooli 17 ("Paabel"), room 218

This is the *master's seminar on quantum computer science*.
The topics come from two areas:

- Supervised by Dominique Unruh:
**Quantum cryptography** - Supervised by Dirk Oliver Theis:
**Quantum computing**

### Schedule

### Quantum Cryptography Topics

Please contact Prof. Unruh: `unruh`

at ut dot ee.

### Quantum Computing Topics

*As this seminar is for 1st year master's students -- who have not yet taken any courses on quantum computer science -- the topics in this area*

**do not require Quantum knowledge**.*(To start learning quantum computer science, take MTAT.05.008 in this (fall) semester.)*

The Quantum Algorithm Zoo lists ~30 algorithmic problems for which a known quantum algorithm runs exponentially faster than the best known classical algorithms. (There's an additional ~30 algorithms with polynomial or varying speedup.)

In the Quantum Computing Branch of the seminar, we want to discuss each one of these algorithmic *problems* (not the quantum algorithms -- that would require serious quantum background). A typical presentation will take 20 minutes and consist of the following

- A clear description of the algorithmic problem (input, output, etc).
- A short sketch of the best classical algorithm solving the problem (if possible).
- A comparison of the classical/quantum running times.
- A few buzzwords as to the "magic quantum ingredient" which is used.

As the presentations are very short (20 minutes), every student has to give 2 of them to receive credits for the course.

The algorithmic problems are handed out on a "call dibs" basis: The first person who sends an email with the name of the task (as given in the Quantum Algorithm Zoo) wins the topic. A continually updated list of problems is in QC topics (sidebar). An email address to call dibs will be made available here shortly.