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: Wednesday, 15:45-17:15 in 1090|334 (kleine Physik)
The lecture will be omitted on Wednesday, Dec. 17 and Wednesday, Jan. 7.
The course outline might change, depending on the students attending the lecture.
- Dirac notations and basic linear algebra for quantum computing
- One- and two-qubit states. Deutsch's algorithm
- The no-cloning theorem, quantum teleportation and superdense coding
- The quantum circuit model and universal quantum computation
- Reversible classical circuits and the Deutsch-Jozsa algorithm
- The recursive and nonrecursive Bernstein-Vazirani algorithm
- Simon's algorithm
- Quantum Fourier transform
- Shor's algorithm for integer factoring
- Grover's searching algorithm
- Quantum error correction
- Boolean polynomials associated with quantum circuits
- Circuit unitary matrix and the number of roots of Boolean polynomials
- Computer algebra aspects