After successful completion of the course, students are able to explain the basic concepts and techniques of quantum computing and use the necessary tools from physics and mathematics. Essential register operations as the basis of a quantum assembler are clear. Basic algorithms and their representations are understood. Fundamental properties of quantum information such as teleportation, superdense coding or no-cloning are recognized. The meaning of entangled states and quantum parallelism are clear. Also the limitations of NISQ machines and the basics of quantum error correction are understood.

• Quantum phenomena
• Eigenvalues and Eigenspaces
• Hilbert spaces
• Linear mappings and operators
• Tensor products
• Spectral theorem
• Quantum bit and quantum register
• 1-Qbit operators and quantum register operators
• Universal operator sets
• Overview Tools
• Algorithms of Deutsch-Josza, Shor, Grover
• Complexity
• Observables and measurements
• teleportation, superdense coding, no-cloning
• Insights into quantum cryptography
• Quantum error correction
• NISQ

During the exercises, the contents of the lecture 194.128 Quantum Informatics 1 (Leymann/Barzen) will be practiced and consolidated by means of practical examples.
The basics for implementing, simulating and executing quantum algorithms are covered in programming exercises.

Attendance at the virtual kickoff on October 6, 2023 is mandatory.
https://unistuttgart.webex.com/unistuttgart/j.php?MTID=mfaf62649545fcebc0389f92c3f36774f

ECTS Breakdown:
3 ECTS = 75 hours

30 hrs preparation
10 hrs exercises
35 hrs homework

Oral exam as part of the course

Linear Algebra