9600-0016/01 – Introduction to Quantum Computing (IQC)
| Gurantor department | IT4Innovations | Credits | 4 |
| Subject guarantor | prof. RNDr. Marek Lampart, Ph.D. | Subject version guarantor | prof. RNDr. Marek Lampart, Ph.D. |
| Study level | undergraduate or graduate | Requirement | Optional |
| Year | | Semester | summer |
| | Study language | Czech |
| Year of introduction | 2021/2022 | Year of cancellation | |
| Intended for the faculties | FBI, HGF, EKF, FAST, FEI, FMT, USP, FS | Intended for study types | Master, Follow-up Master |
Subject aims expressed by acquired skills and competences
The aim of the course is to master the basic concept of quantum computing without knowledge of quantum physics and to master the basic tasks associated with register programming.
Teaching methods
Lectures
Tutorials
Project work
Summary
This is a basic course in quantum computing, which deals with the basic elements of quantum computational theory without assuming knowledge of quantum physics. The introduction to quantum theory from the point of view of computer science begins with an explanation of the most necessary concepts in order to demonstrate several elementary examples of quantum acceleration, as well as basic applications: Shor's factorization and Grover's search algorithm and error correction. Theoretical knowledge is then demonstrated practically on a quantum computer (simulator) - Atos myQLM or IBM Qiskit.
The course is intended for students of the 1st and 2nd year of master's studies at VŠB-TU Ostrava and the necessary prerequisite is knowledge of linear algebra.
Compulsory literature:
Recommended literature:
1. BENENTI, G.; CASATI, G.; ROSSINI, D.; STRINI, G. Principles of Quantum Computation and Information - A Comprehensive Textbook. World Scientific, 2018.
2. STRUBELL, E. An Introduction to Quantum Algorithms. COS498 - Chawathe, 2011.
3. ABHIJITH, J.; ADEDOYIN, A.; AMBROSIANO, J.; ANISIMOV, P.; BÄRTSCHI, A.; CASPER, W.; CHENNUPATI, G.; COFFRIN, C.; DJIDJEV, H.; GUNTER, D.; KARRA, S. ; LEMONS, N.; LIN, S.; MALYZHENKOV, A.; MASCARENAS, D.; MNISZEWSKI, S.; NADIGA, B.; O’MALLEY, D.; OYEN, D.; PAKIN, S.; PRASAD, L.; ROBERTS, R.; ROMERO, P.; SANTHI, N.; SINITSYN, N.; SWART, P. J.; WENDELBERGER, J. G.; YOON, B.; ZAMORA, R.; ZHU, W.; EIDENBENZ, S.; COLES, P. J.; VUFFRAY, M.; LOKHOV, A. Y. Quantum Algorithm Implementations for Beginners. Los Alamos National Laboratory USA, 2018.
Additional study materials
Way of continuous check of knowledge in the course of semester
Test on the basics of quantum computational theory - max. 10 points.
Test on the topic of classical quantum algorithms - max. 10 points.
Individual work on the topic of quantum algorithm implementation - max. 20 points.
E-learning
Other requirements
No other requirements.
Prerequisities
Subject has no prerequisities.
Co-requisities
Subject has no co-requisities.
Subject syllabus:
Lectures:
1. Basic properties of qubit, Bloch sphere
2. Qubits and their states, Dirac notation
3. Reversible qubit operations, qubit measurements
4. Entanglement
5. Deutsch–Jozsa algorithm, Bernstein-Vazirani algorithm
6. Simon's Algorithm
7. Grover's searching algorithm
8. Quantum Fourier transform, Shor's factorization algorithm
9. RSA decoding
10. Simplified example of quantum error correction
11. Error diagnostics, error correcting codes
12. Quantum cryptography and a simple example of chaining
Exercises:
1. Installation of a quantum simulator and connection to a quantum computer (QLM, Qiskit).
2. - 3. Tensor algebra and its interpretation of qubit.
4. - 12. Practical implementation of algorithms discussed in the lecture.
Projects:
Individual work on the implementation of a quantum algorithm on selected quantum simulator or computer.
Conditions for subject completion
Occurrence in study plans
Occurrence in special blocks
Assessment of instruction