9600-0016/02 – Introduction to Quantum Computing (IQC)

Gurantor departmentIT4InnovationsCredits4
Subject guarantorprof. RNDr. Marek Lampart, Ph.D.Subject version guarantorprof. RNDr. Marek Lampart, Ph.D.
Study levelundergraduate or graduateRequirementOptional
Study languageEnglish
Year of introduction2021/2022Year of cancellation
Intended for the facultiesEKF, HGF, USP, FEI, FBI, FS, FAST, FMTIntended for study typesFollow-up Master, Master
Instruction secured by
LoginNameTuitorTeacher giving lectures
LAM05 prof. RNDr. Marek Lampart, Ph.D.
TOM064 Ing. Jiří Tomčala
Extent of instruction for forms of study
Form of studyWay of compl.Extent
Full-time Credit and Examination 2+2
Part-time Credit and Examination 10+10

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

Project work


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:

1. MERMIN, N. D. Quantum Computer Science: An Introduction. Cambridge University Press, 2007. ISBN-13: 978-0521876582, ISBN-10: 0521876583. 2. NIELSEN, M. A.; CHUANG, I. L. Quantum Computation and Quantum Information. Cambridge University Press, 2010. ISBN-13: 978-1107002173, ISBN-10: 9781107002173.

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.

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.


Other requirements

No other requirements.


Subject has no prerequisities.


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

Full-time form (validity from: 2020/2021 Summer semester)
Task nameType of taskMax. number of points
(act. for subtasks)
Min. number of points
Credit and Examination Credit and Examination 100 (100) 51
        Credit Credit 40 (40) 20
                Test 1 Written test 10  0
                Test 2 Written test 10  0
                Project Project 20  0
        Examination Examination 60  11
Mandatory attendence parzicipation: Conditions for obtaining credit: Performing two tests - max. 20 points. Elaboration and defense of individual work - max. 20 points. The maximum number of points that can be obtained in the exercises is 40 points. The minimum number of points to obtain credit is 20 points. Written and oral exam.

Show history

Occurrence in study plans

Academic yearProgrammeField of studySpec.ZaměřeníFormStudy language Tut. centreYearWSType of duty
2021/2022 (N0716A060002) Automotive Electronic Systems P English Ostrava Optional study plan
2021/2022 (N0714A060007) Applied Electronics P English Ostrava Optional study plan

Occurrence in special blocks

Block nameAcademic yearForm of studyStudy language YearWSType of blockBlock owner