*[Erläuterungen zu Abschnitt 2](https://git.rwth-aachen.de/modulangebot/modulangebotsverwaltung/blob/master/Anleitungen_Hilfen/2_Modulveranstaltungen.md)*
*[Erläuterungen zu Abschnitt 3](../Anleitungen_Hilfen/3_Leistungen.md)*
**(!) Teilnahmevoraussetzungen (DE)**
Keine.
**(!) Teilnahmevoraussetzungen (EN)**
None.
**(!) Prüfungsbedingungen (DE)**
Klausur oder mündliche Prüfung (100 %). Voraussetzung für die Zulassung zur Modulprüfung ist das Bestehen von Hausaufgaben.
**(!) Prüfungsbedingungen (EN)**
Written exam or oral examination (100 %). Students must pass written homework to be admitted to the module examination.
### 4. Informationen für das Modulhandbuch
*[Erläuterungen zu Abschnitt 4](../Anleitungen_Hilfen/4_Infos_Modulhandbuch.md)*
**(!) Empfohlene Voraussetzungen (DE)**
Linear Algebra; Quantum Information/Computing Fundamentals
**(!) Empfohlene Voraussetzungen (EN)**
Linear Algebra; Quantum Information/Computing Fundamentals
**(!) Lernziele (DE)**
Knowledge
After successful completion of the module students know:
* basics and limitations variational quantum algorithms on near-term (noisy) quantum computers as well as quantum annealers
* how to map applications to near-term (noisy) quantum computers
* basic concepts of quantum compilation
Skills
After successful completion of the module, students will be able to:
* implement quantum algorithms on real quantum computing devices
* assess the computational capabilities of near-term (noisy) quantum computers
* represent and manipulate quantum circuits with the diagrammatic calculus (ZX-calculus)
Competencies
Based on the knowledge and skills acquired in the module, students will be able to:
* orient themselves in field of near-term (noisy) quantum computation
* perform research on application focused quantum algorithms for near-term quantum computers
* perform research on quantum compilation for early quantum computers
**(!) Lernziele (EN)**
Knowledge
After successful completion of the module students know:
* basics and limitations variational quantum algorithms on near-term (noisy) quantum computers as well as quantum annealers
* how to map applications to near-term (noisy) quantum computers
* basic concepts of quantum compilation
Skills
After successful completion of the module, students will be able to:
* implement quantum algorithms on real quantum computing devices
* assess the computational capabilities of near-term (noisy) quantum computers
* represent and manipulate quantum circuits with the diagrammatic calculus (ZX-calculus)
Competencies
Based on the knowledge and skills acquired in the module, students will be able to:
* orient themselves in field of near-term (noisy) quantum computation
* perform research on application focused quantum algorithms for near-term quantum computers
* perform research on quantum compilation for early quantum computers
**(!) Inhalt (DE)**
This lecture is an interdisciplinary (computer science, physics, ; mathematics) introduction to modern algorithmic challenges as they occur in the usage of near-term quantum computing hardware. After reviewing the basics of quantum computation and algorithms we will cover the limitation of current quantum computing hardware from a computer ; scientist’s point of view. Next, we will discuss algorithms for near-term quantum computers, before we turn to quantum compilation, i.e. algorithms for the optimal mapping of quantum algorithms to real quantum computers. Finally, we will cover the basics of quantum error correction and mitigation. This lecture is an interdisciplinary (physics, computer science, mathematics) introduction quantum algorithms for near-term quantum computing hardware. After reviewing the basics of quantum computation and algorithms we will cover the limitation of current quantum computing hardware. Next, we will discuss algorithms for near-term quantum computers, which is the main focus of the lecture. Finally, we turn to quantum compilation, i.e. algorithms for the optimal mapping of quantum algorithms to real quantum computers, as well as quantum error mitigation and correction.
**(!) Inhalt (EN)**
This lecture is an interdisciplinary (computer science, physics, ; mathematics) introduction to modern algorithmic challenges as they occur in the usage of near-term quantum computing hardware. After reviewing the basics of quantum computation and algorithms we will cover the limitation of current quantum computing hardware from a computer ; scientist’s point of view. Next, we will discuss algorithms for near-term quantum computers, before we turn to quantum compilation, i.e. algorithms for the optimal mapping of quantum algorithms to real quantum computers. Finally, we will cover the basics of quantum error correction and mitigation. This lecture is an interdisciplinary (physics, computer science, mathematics) introduction quantum algorithms for near-term quantum computing hardware. After reviewing the basics of quantum computation and algorithms we will cover the limitation of current quantum computing hardware. Next, we will discuss algorithms for near-term quantum computers, which is the main focus of the lecture. Finally, we turn to quantum compilation, i.e. algorithms for the optimal mapping of quantum algorithms to real quantum computers, as well as quantum error mitigation and correction.
**(!) Literatur**
...
### 5a. SPOen, in denen das Modul verankert werden soll
*[Erläuterungen zu Abschnitt 5a/5b](../Anleitungen_Hilfen/5_Studiengänge.md)*
