Intruduction to Quantum Computing

Lecture and tutorial classes in the winter term

Quantum algorithms can solve computational problems efficiently that have a prohibitive runtime on traditional computers. Such problems include, for instance, factoring of integer numbers or energy estimation problems from quantum chemistry. This course provides an introduction to the topic. An emphasize will be put on conceptual and mathematical aspects.

Contents

• Information theoretic introduction to quantum mechanics
• The quantum teleportation protocol
• Basic quantum algorithms
• Grover's search algorithm
• The quantum Fourier transform and Shor’s algorithm for integer factoring
• The unitary circuit model of quantum computation (qubits, quantum gates and readout) and the complexity class BQP