Introduction to Quantum Computing with Applications of Computer Algebra Methods

Lecture held by Prof. Vladimir Gerdt.

Exercise dates will be arranged at the next meeting.

Lecture announcement


Lecture: Wednesday, 15:45-17:15 in 1090|334 (kleine Physik)

The lecture will be omitted on Wednesday, Dec. 17 and Wednesday, Jan. 7.

Course Outline

The course outline might change, depending on the students attending the lecture.

  1. Introduction
  2. Dirac notations and basic linear algebra for quantum computing
  3. One- and two-qubit states. Deutsch's algorithm
  4. The no-cloning theorem, quantum teleportation and superdense coding
  5. The quantum circuit model and universal quantum computation
  6. Reversible classical circuits and the Deutsch-Jozsa algorithm
  7. The recursive and nonrecursive Bernstein-Vazirani algorithm
  8. Simon's algorithm
  9. Quantum Fourier transform
  10. Shor's algorithm for integer factoring
  11. Grover's searching algorithm
  12. Quantum error correction
  13. Boolean polynomials associated with quantum circuits
  14. Circuit unitary matrix and the number of roots of Boolean polynomials
  15. Computer algebra aspects