Intruduction to Quantum Computing

For a few computational problems, quantum algorithms are exponentially faster than the best classical algorithms we know; factoring large integers is the standard example. A second application area where quantum computers can offer a large advantage is the simulation of quantum physics, which is relveant to quantum chemistry and material science. 

This course is our entry point to the field, with the emphasis on conceptual and mathematical aspects. After the course you can read and write quantum circuits, analyse the core algorithms of the field yourself, understand complexity classes such as BQP, and judge claims about quantum advantage.

Prerequisites

The only strict requirement is good knowledge of linear algebra over the complex numbers (vector spaces, inner products, matrices, eigenvalues, unitary and Hermitian operators, diagonalization). 

Helpful but not strictly required: 

  • Basic probability theory (finite sample spaces): probability vectors, random variables, expectation values.
  • Basic algorithms and complexity: what an algorithm is, asymptotic Landau notation (Big-O).
  • No prior quantum physics is required. Quantum mechanics is introduced from an information-theoretic point of view inside the course.
  • Some familiarity with elementary number theory helps for the part on Shor's algorithm, but is not assumed. 

Outline

  • 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

Organisation

  • Term: winter term
  • Format: lecture with accompanying lecture hall exercise and weekly problem sheets
  • Registration on StudIP

 

Materials

Lecture notes for this course are in preparation and will be published on our Lecture notes page.

Course material during the term is distributed via Stud.IP.