Principles of Quantum Computers

Garant předmětu:

Martin Štefaňák

Lecturer:

Aurél Gábor Gábris, Václav Potoček, Martin Štefaňák

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, decoherence-free 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: one-way 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. Wiley-VCH, Weinheim (2019).

Note:

Time-table for winter semester 2023/2024:

Time-table is not available yet

Time-table for summer semester 2023/2024:

Time-table is not available yet

The course is a part of the following study plans: