Algorithms in Quantum Theory
Module EI71047
This module handbook serves to describe contents, learning outcome, methods and examination type as well as linking to current dates for courses and module examination in the respective sections.
Basic Information
EI71047 is a semester module in English language at Master’s level which is offered in summer semester.
This module description is valid from SS 2019 to SS 2020.
| Total workload | Contact hours | Credits (ECTS) |
|---|---|---|
| 150 h | 60 h | 5 CP |
Content, Learning Outcome and Preconditions
Content
Introduction:
Quantum states, channels and measurements
Quantum circuits
Quantum communication:
Entanglement (states and channels) and channel/state duality
Teleportation and Entanglement swapping
Twirls and symmtric states
Entanglement distillation
Quantum Repeater
Quantum computations:
Deutsch-Jozsa
Simon's and Shor's algorithm
Quantum error correction:
Stabilizer codes
Shor code
CSS codes
Surface codes
Color codes
Advanced topics:
Universal gates sets
Solovej-Kitaev Thm
Quantum states, channels and measurements
Quantum circuits
Quantum communication:
Entanglement (states and channels) and channel/state duality
Teleportation and Entanglement swapping
Twirls and symmtric states
Entanglement distillation
Quantum Repeater
Quantum computations:
Deutsch-Jozsa
Simon's and Shor's algorithm
Quantum error correction:
Stabilizer codes
Shor code
CSS codes
Surface codes
Color codes
Advanced topics:
Universal gates sets
Solovej-Kitaev Thm
Learning Outcome
At the end of the module, students are able to understand, apply, evaluate, and create advanced algorithms in quantum theory. In particular, the students learn among others the following algorithms: Deutsch-Jozsa algorithm,
Simon's Algorithm, Shor's Algorithm, and QKD. After the course the students can describe the algorithms and describe the advantages and disadvantages.
Simon's Algorithm, Shor's Algorithm, and QKD. After the course the students can describe the algorithms and describe the advantages and disadvantages.
Preconditions
- Basic Course on Information Theory
- Basic Knowledge in Linear Algebra
- Basic Knowledge in Probability Theory
- Basic Knowledge in Linear Algebra
- Basic Knowledge in Probability Theory
Courses, Learning and Teaching Methods and Literature
Learning and Teaching Methods
In addition to the individual methods of the students, consolidated knowledge is aspired by repeated lessons in exercises and tutorials. The teaching method in the lectures is teacher-centred instruction and in the exercises work instruction (tasks compute).
Media
The following kinds of media are used:
- Presentations.
- Exercises.
- Presentations.
- Exercises.
Literature
The course does not follow a specific book, as it is primarily based on research articles that will be provided in the class.
Module Exam
Description of exams and course work
By answering questions during a written exam (90 min) the students proof their ability to recall the theory behind algorithm in quantum theory. In particular it is checked if the students are able to describe and apply for example the following algorithms: Deutsch-Jozsa algorithm, Simon's Algorithm, Shor's Algorithm, and QKD. Furthermore, the advantages and disadvantages of non-classical algorithms should be described.
Exam Repetition
There is a possibility to take the exam in the following semester.