| Course title | Introduction to Quantum Computing |
|---|---|
| Course code | KMI/PGSQC |
| Organizational form of instruction | Lecture |
| Level of course | Doctoral |
| Year of study | not specified |
| Semester | Winter and summer |
| Number of ECTS credits | 12 |
| Language of instruction | Czech, English |
| Status of course | unspecified |
| Form of instruction | Face-to-face |
| Work placements | This is not an internship |
| Recommended optional programme components | None |
| Lecturer(s) |
|---|
|
| Course content |
|
1. Short survey of quantum mechanics: quantum bit, complex Hilbert space and its operators 2. Quantum circuit - 1st part: quantum NOT, CNOT, CCNOT, Fredkin gate, Toffol gate, quantum registers, quantum gates, quantum network, quantum program 3. Quantum circuit - 2nd part: teleportation circuit, Bell states generation, universal gates 4. Quantum algorithms - 1st part: quantum parallelism, Deutsch's problem, Deutsch - Josza problem 5. Quantum algorithms - 2nd part: quantum Fourier transformation, Shor's algorithm for quantum factorization, eigenvalue problem, discrete logarithm 6. Quantum algorithms - 3rd part: Govers search algorithm and its modification 7. Quantum Turing machine, difference between quantum Turing machine and probabilistic Turing machine 8. Quantum computational complexity, quantum communication complexity 9. Introduction to quantum information theory 10. Quantum error-correcting codes - 1st part: Shor code, three quantum bit-flip code, three quantum bit phase-flip code, their quantum circuits, differences between classical and quantum codes in errors 11. Quantum error-correcting codes - 2nd part: review classical (non-quantum) error-correcting codes, stabilizer codes, Pauli group, CSS codes, corresponding quantum circuits 12. Quantum codes - 3rd part: detect and correct properties of quantum codes, difference between classical and quantum codes, quantum analogy to classical bounds for example Hamming bound
|
| Learning activities and teaching methods |
Dialogic Lecture (Discussion, Dialog, Brainstorming)
|
| Learning outcomes |
|
Introduction to quantum computing. Gaining knowledge of how specific properties of micro-world can be exploited for computing purposes.
On successful completion of this module, students should be able to know and understand the syllabus topics and be able to use the acquired knowledge in solving problems. |
| Prerequisites |
|
Graduate-level knowledge of quantum theory and linear algebra.
|
| Assessment methods and criteria |
|
Oral exam, Student performance
Sufficient knowledge of the syllabus topics. |
| Recommended literature |
|
| Study plans that include the course |
| Faculty | Study plan (Version) | Category of Branch/Specialization | Recommended semester |
|---|