Principles of Quantum Computers
Code  Completion  Credits  Range 

D02PKP  ZK  2P+0C 
 Lecturer:
 Aurél Gábris, Martin Štefaňák (guarantor), Václav Potoček
 Tutor:
 Supervisor:
 Department of Physics
 Synopsis:

The lecture covers some deeper details of the inner principles of quantum computers and algorithms therefor. The students are expected to have a prior knowledge of the basics of quantum logic and methods of quantum computation.
 Requirements:
 Syllabus of lectures:

1.Overview of quantum computing: quantum binary logic, quantum registers and gates, basic quantum algorithms
2.Analysis of the connecting principles of known algorithms: amplitude amplification, quantum Fourier transform
3.Quantum speedup, most important quantum complexity classes
4.Theory of quantum information: qubits, entanglement bits, entanglement distillation, further entanglement measures, entanglement witnesses
5.Quantum computation errors and preventing them, error correction, decoherencefree subspaces
6.DiVincenzo’s criteria for constructing a quantum computer; classical simulability
7.Physical implementation of quantum computers: ion traps, optical lattices, superconducting circuits, NMR, NV centers
8.Photonic implementations and optical networks, polarization, path and time encoding of information
9.Alternative quantum computation avenues: oneway computation, adiabatic and topological quantum computers, continuous variables
 Syllabus of tutorials:
 Study Objective:
 Study materials:

Key references:
[1] M.A. Nielsen, I.L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press, New York (2011).
[2] S.M. Barnett, Quantum Information. Oxford University Press, Oxford (2009).
Recommended references:
[3] D. Bruß, G. Leuchs (eds.), Quantum Information. WileyVCH, Weinheim (2019).
 Note:
 Timetable for winter semester 2020/2021:
 Timetable is not available yet
 Timetable for summer semester 2020/2021:
 Timetable is not available yet
 The course is a part of the following study plans: