Teaching

We cover theoretical computer science courses, mostly on quantum computation. All courses are taught in English and consist in lectures, tutorial classes, and solving problem sheets.

Winter term

Introduction to quantum computing
A first course on quantum algorithms. Highlights are the quantum teleportation protocol and Shor's polynomial-time factoring algorithm. No prior quantum physics required; it can already be attended in the third semester after linear algebra.

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. 

 

 

 

Quantum mechanics
A standard course on quantum mechanics, from the founding experiments and the Schrödinger equation to spin systems, the postulates and composite systems. The main highlight is the full solution of the hydrogen atom.

Quantum mechanics

A standard course on quantum mechanics, from the founding experiments and the Schrödinger equation to spin systems, the postulates and composite systems. The main highlight is the full solution of the hydrogen atom.

 

Prerequisites

The strict requirements are analysis (differential and integral calculus, ordinary and partial differential equations, Fourier transform) and linear algebra over the complex numbers (vector spaces, inner products, eigenvalue problems, Hermitian and unitary operators, diagonalization).

Helpful but not required:

  • Basic classical mechanics and electrodynamics: waves, energy, angular momentum.
  • Introductory knowledge to quantum computing 

 

Outline

  • Overview of experiments (double-slit experiment, black-body radiation, photoelectric effect, Stern-Gerlach)
  • Wave equations and dispersion relations
  • Schrödinger equation and paradigmatic example systems (wave packets, tunnelling effect, harmonic oscillator)
  • Position and momentum representation, Heisenberg uncertainty relation
  • Hydrogen atom and angular momentum
  • Spin systems
  • Postulates of quantum mechanics (pure states)
  • Composite quantum systems
  • Outlook to quantum many-body systems (molecules and solids)

 

Organisation

  • Term: winter term
  • Format: lecture with accompanying problem sheets and lecture hall exercises
  • 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.

Seminar on theoretical computer science
A seminar on topics in theoretical computer science, with participants presenting and discussing selected results.

Seminars

We offer two seminars each year in which participants read, present and discuss scientific work. Both are a good preparation for a thesis with us.

For questions about either seminar or wishes for seminar topics, please write to martin.kliesch(at)tuhh.de.

 

Winter term:
Seminar on theoretical computer science and mathematics 

A seminar on topics in theoretical computer science and mathematics, with participants presenting and discussing selected results. 

  • Prerequisites: a course on computability and complexity theory or a comparable background. 

 

Summer term:
Seminar on quantum computing

A reading and presentation seminar in which participants work through current papers and classic results in quantum information and computation.

  • Prerequisites: an introductory course on quantum computing or a comparable background.
  • Topics offered via Stud.IP

 

 

 

 

Summer term

Computability and complexity theory
What can be computed at all, and at what cost? We cover the main concepts aimed at answering this question: Turing machines, decidability, P and NP, NP-completeness, randomised and space-bounded computation.

Computability and Complexity Theory

What can be computed at all, and at what cost?

We cover the main concepts aimed at answering this question: Turing machines, decidability, P and NP, NP-completeness, randomised and space-bounded computation.

Prerequisites

The only strict requirement is to be confortable with basic logic and mathematical proofs. 

Helpful but not strictly required:

  • Formal languages and automata (regular languages, DFAs, NFAs, context-free grammars, PDAs)
  • Basic discrete mathematics (sets, relations, functions, graphs, induction)
  • Basic algorithms and asymptotic Landau notation (Big-O).
  • Elementary probability theory for probabilistic computation. 

 

Outline

  • Turing machines as basic model of computation
  • Turing machine variants and their equivalence (multi-tape TMs, non-deterministic TMs, enumerators)
  • The Church-Turing thesis
  • Encodings of objects such as Turing machine
  • Decidability of acceptance, emptiness and equivalence problems for DFAs, CFGs, LBAs and TMs
  • Diagonal arguments for non-existance proofs
  • Mapping reducibility
  • The computation history method and the Post correspondence problem
  • Time complexity, model dependence, the class P, example graph problems in P
  • The class NP (two definitions and their equivalence)
  • Karp reductions and NP-completeness
  • NP-complete problems: SAT, 3SAT, Hamiltonian path, k-clique
  • The Cook-Levin theorem
  • Probabilistic Turing machines and the class BPP
  • Read-once branching programs (ROBPs)
  • Arithmetization; checking equivalence of ROBPs is in BPP
  • Space complexity and the basic space classes
  • True quantified Boolean formulae are PSPACE-complete
  • NPSPACE and the proof idea of Savitch's theorem
  • Generalized geography is PSPACE-complete

 

Organisation

  • Term: summer term
  • Format: lecture with accompanying problem sheets (checked by written quizzes) and  tutorial classes
  • Registration on StudIP

 

Materials

Our own lecture notes for this course (`CCnotes.pdf`) are available on our Lecture notes page.

Large parts of the course follow the textbook M. Sipser, *Introduction to the Theory of Computation*.

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

 

 

 

Advanced quantum computing
The theory behind fault-tolerant quantum computers: universal gate sets, noise models, error correction codes and fault tolerance, and quantum algorithms for simulating physical systems.

Advanced Quantum computing

The theory behind fault-tolerant quantum computers: quantum channels, universal sets of quantum gates, stabilizer quantum error correction codes, the threshold theorem, Hamiltonian simulation algorithms, and the quantum signal processing framework for quantum algorithms.

Prerequisites

The only strict requirement is an introductory course on quantum computing or quantum information (qubits, quantum gates, the circuit model, basic quantum algorithms); our Introduction to quantum computing) covers this. That includes a good understanding of linear algebra (complex vector spaces with inner product, their tensor product, spectral decomposition). Also a basic understanding of probability theory is assumed. 

Helpful but not strictly required:

  • Elementary group theory (finite groups, subgroups, cosets) and finite fields. 

 

Outline

  • Postulates of quantum mechanics in terms of density operators, completely positive trace-preserving (CPT) maps, and POVMs
  • Quantum gates, universality, and the Solovay-Kitaev theorem
  • The Clifford group and the Gottesman-Knill theorem
  • Basic noise models
  • Stabilizer quantum error-correcting codes and examples
  • Transversal gate sets and the Eastin-Knill theorem
  • The threshold theorem and the basic ideas of fault-tolerant quantum computation
  • Hamiltonian simulation: what quantum computers are really good at
  • Quantum signal processing

 

Organisation

 

  • Term: summer term
  • Format: lecture with accompanying problem sheets and lecture hall exercises.
  • Registration on Stud.IP

 

Materials

Our own lecture notes for this course (`AQC_lecture.pdf`) are available on our our  Lecture notes page.

Course material during the term is distributed via StudIP.

 

The topics of this course connect directly to our research; several thesis and student project topics build on it.

 

Seminar on quantum computing
A reading and presentation seminar in which participants work through current papers and classic results in quantum information and computation.

Seminars

We offer two seminars each year in which participants read, present and discuss scientific work. Both are a good preparation for a thesis with us.

For questions about either seminar or wishes for seminar topics, please write to martin.kliesch(at)tuhh.de.

 

Winter term:
Seminar on theoretical computer science and mathematics 

A seminar on topics in theoretical computer science and mathematics, with participants presenting and discussing selected results. 

  • Prerequisites: a course on computability and complexity theory or a comparable background. 

 

Summer term:
Seminar on quantum computing

A reading and presentation seminar in which participants work through current papers and classic results in quantum information and computation.

  • Prerequisites: an introductory course on quantum computing or a comparable background.
  • Topics offered via Stud.IP

 

 

 

 

Theses and student projects

Theses and student projects
We supervise Bachelor and Master theses as well as TUHH-student projects across our research areas. Topics can be adapted to your background and interests.

Information for Theses and Projects Supervision

If you are interested in writing your project or thesis with us you are welcome to submit your application:

  1. Choose a topic of your interest. You can do this by browsing the areas of expertise and current research projects of our team members.
  2. You should have basic prior knowledge of the topic. For instance, as a first check, for a topic with 'quantum' in the title you should have successfully attended at least one course that has 'quantum' in the title.
  3. Send an email to martin.kliesch(at)tuhh(dot)de with the subject Supervision - [Project | BA | MA]. Please include the following documentation/information upon contact:
    • Transcript of your records (latest version).
    • An updated CV.
    • A brief description of your topic of interest (3 - 5 lines).
    • The name of a team member who could supervise your topic.
  4. Based on our current workload and supervision capacity, a team member will schedule an appointment with you to further discuss your supervision request.

Also, check "info sheet (BSc, MSc)/TUHH_info.pdf" for more information.

 

There are various topics for theses in several research areas currently covered by the group. Here is an outline of example topics:
 

  • Designing quantum dynamcis and Hamiltonian engineering
  • Classical simulation of quantum systems
  • Quantum noise estimation & quantum computer readout
    • Quantum tomography
    • Randomized benchmarking
    • Shadow estimation
  • Quantum error correction
  • Aspects of machine learning
  • Using tensor networks to solve differential equations

 

 

 

 

 

 

 

 

 

Lecture notes

Lecture notes
Our own lecture notes on Advanced Quantum Computing, Computability and Complexity Theory, Quantum system characterization and Statistical Mechanics are available as PDF downloads.

Advanced Quantum Computing

Quantum channels, universality and the Solovay-Kitaev theorem, the stabilizer formalism, quantum error correction, fault tolerance, Hamiltonian simulation and quantum signal processing.
For students who have already taken an introductory course on quantum computing and want the theory behind fault-tolerant machines.

Computability and Complexity Theory

Limitations of classical computation as covered in Siper's book: 
Turing machines, decidability and undecidability, reductions and diagonalization, time and space complexity, P, NP, NP-completeness, BPP and PSPACE. For anyone who needs a rigorous classical foundation before studying quantum complexity. 

Quantum system characterization

How to find out what a quantum device actually does: tomography, randomized benchmarking, shadow estimation and related methods, with their statistical guarantees.
For advanced students and researchers interested in, e.g., the theory of quantum noise estimation.

Statistical Mechanics

The statistical description of many-particle systems: ensembles, entropy, partition functions and thermal states.
For students who want the physics background that quantum many-body theory and quantum thermodynamics build on.

In preparation

Notes for Quantum mechanics and Introduction to quantum computing will be added later.

Use and licensing

We provide these notes for personal study by students and other interested readers.

The notes are work in progress and certainly still contain mistakes.
If you find an error, or a passage that is hard to follow, please write to martin.kliesch(at)tuhh.de.

Questions

If you have questions about our courses, or a wish for a course on a related topic, please write to martin.kliesch(at)tuhh.de.