FI:I066 Quantum systems - Course Information

I066 Quantum systems for information processing

Extent and Intensity

2/0. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: k (colloquium). Other types of completion: z (credit).

Teacher(s)

prof. RNDr. Jozef Gruska, DrSc. (lecturer)

Guaranteed by

prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Jozef Gruska, DrSc.

Prerequisites (in Czech)

I005 Formal Languages and Automata I && I012 Complexity && M011 Statistics I

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

• Informatics (programme FI, B-IN)
• Informatics (programme FI, M-IN)
• Upper Secondary School Teacher Training in Informatics (programme FI, M-IN)
• Upper Secondary School Teacher Training in Informatics (programme FI, M-SS)
• Information Technology (programme FI, B-IN)

Course objectives

Úvod. (Srovnání pravděpodobnostních a kvantových výpočtů, Základní principy kvantové mechaniky. Základy teorie Hilbertových prostorů. Reverzibilní výpočty.)
Elementy. (Kvantové bity a registry. Kvantové entanglement. Kvantová hradla a obvody.)
Algoritmy. (Příklady kvantových algoritmů pro jednoduché ``promise'' problémy. Shorovy a Groverovy algoritmy. Metody konstrukce kvantových algoritmů. Metody dokazování dolních odhadů.)
Automaty. (Konečné kvantové automaty. Turingovy kvantové počítače. Kvantové celulární automaty.)
Složitost. (Kvantová výpočetní a komunikační složitost.)

Syllabus

• Introduction (Comparison of randomized and quantum computing,Basic principles of quantum mechanics, basics of Hilbert spaces, reversible computations)
• Elements (Qubits, quantum registers, quantum entanglement, quantum gates and circuits)
• Algorithms (Examples of quantum algorithms for simple promise problems, Shor's and Grover's algorithms, methodologies to design quantum algorithms, lower bounds methods)
• Automata (quantum finite auromata, quantum Turing machines, quantum cellular automata)
• Complexity (Quantum computational and communicational complexity)

Literature

• Gruska Jozef. Quantum computing. McGraw-Hill, 1999, 450 s, ISBN 0-07-709503-0

Language of instruction

Czech

Further Comments

The course is taught once in two years.
The course is taught: every week.

• Enrolment Statistics (Autumn 2000, recent)
  
• Permalink: https://is.muni.cz/course/fi/autumn2000/I066