1. komponenta

Lecture type	Total
Lectures	45

* Load is given in academic hour (1 academic hour = 45 minutes)

COURSE AIMS AND OBJECTIVES:
To train students for:
- designing quantum algorithms which using quantum phenomena such as superposition and quantum entanglement solve given problems more efficiently than classical algorithms.

COURSE DESCRIPTION AND SYLLABUS:

1. Introduction to quantum mechanics. Basic terms. Quantum superposition. Quantum entanglement. EPR paradox. Bell's theorem.
2. Mathematical model of quantum computing. Mathematical model of quantum computation. Qubit and complex vector spaces. Quantum gates and quantum registers. Theorem on the impossibility of cloning quantum states.
3. Quantum algorithms. Deutsch's algorithm. Shore's factorization algorithm (quantum Fourier transform). Grover's search algorithm. Quantum error correction.

1. Quantum Computation and Quantum Information, M. A. Nielsen, I. L. Chuang.
2. Lectures on Quantum Computation, Quantum Error Correcting Codes and Information Theory (http://www.cse.iitk.ac.in/users/ppk/notes/krp.pdf), K. R. Parthasarathy.
3. Basic concepts in quantum computation (https://arxiv.org/pdf/quant-ph/0011013.pdf), A. Ekert, P. Hayden and H. Inamori.
4. Kvantno računanje, sveučilišni udžbenik (https://web.math.pmf.unizg.hr/~mkazal/reprints/skripta_kvantno.pdf), M. Kazalicki.

Ostali izborni predmeti - Regular study - Computer Science and Mathematics
Vezani kolegiji B - Regular study - Computer Science and Mathematics

Ostali izborni predmeti - Regular study - Computer Science and Mathematics
Vezani kolegiji B - Regular study - Computer Science and Mathematics