Content

Preliminary Topics

By exploiting quantum mechanical phenomena, quantum computers achieve a previously unattainable speed-up in the solution of certain problems for classic computers. Quantum computers work with qubits; in contrast to classical bits, which are either 0 or 1, the qubits are quantum states that can be in a state of superposition. That means, until the measurement, they are simultaneously to a certain part 0 and to a certain part 1. By measurement, one gets  depending on the parts, to which the qubit is in the respective state  randomly a „classical“ 0 or a 1.

The goal of this seminar is that participating students understand the basics of quantum computers as well as certain parts of quantum mechanics relevant for quantum computers and to know, how quantum algorithms can be used to solve cryptographic problems more efficiently.

Previous knowledge of quantum computers is not required; however, we expect previous knowledge in linear algebra. The seminar will be held in English.

Outline

The seminar includes 4 (mandatory) lectures/ exercises to introduce the basics of quantum computation.

To pass this module a talk about the assigned topic over 35 minutes is to be held. After the talk there will be questions and discussions for 10 minutes. All talks have to be held in English.When giving your talk you can freely decide if you want to use beamer slides or the whiteboard.

You need to hand in a written report of about 10 pages. Preparing a handout for your fellow students is optional.

Registration

To participate register in the corresponding ILIAS-course.