- Gendiar, Andrej: Quantum mechanics in terms of the matrix product states(Kvantová mechanika v jazyku tenzorových súčinových stavov)—Supervisor: Gendiar, Andrej, Mgr., PhD.Goals:
Properties of tensor-network states are investigated by the entanglement entropy in quantum spin models.Annotation:
The tensor-product states (TPS) are frequently used in modern physics in order to obtain energies and eigenstates of quantum models. The typical systems to be studied are spin models whose Hamiltonians describe magnetism at zero temperature. By means of the tensor-product states, a quantum wave function (eigenstate) is approximated. The wave function contains both the physical degrees of the freedom, describing the Hilbert space, and the auxiliary (non-physical) degrees of the freedom, whose size controls range of the correlations, i.e., the accuracy. Many-body interacting spin systems are to be characterized by the TPS at the phase transition be means of the quantum entanglement. Since it is a non-trivial task, being non-analytically solvable, numerical approaches can be used, in particular, an arbitrary programming language can be freely applied, e.g., Python, MatLab, C++, etc.
- Gendiar, Andrej: Physical properties of magnetism by tensor networks(Fyzikálne vlastnosti magnetzimu v jazyku tenzorových sietí)—Supervisor: Gendiar, Andrej, Mgr., PhD.Goals:
Theoretical and numerical analysis of quantum ground states by the state-of-the-art methods of mathematical physics.Annotation:
The tensor networks describes a specific mathematical approach in quantum mechanics, which enables to calculate (approximate) quantum ground states accurately. First, a matrix-product state method is explained, followed by its application to such quantum spin systems, whose Hamiltonians can describe magnetic properties of materials, magnetic spin orderings, including quantum phase transitions. An arbitrary programming language can be used for the study, e.g., Python, MatLab, C++. etc.
- Gendiar, Andrej: Phase-transition analysis in asymptotic regime on non-Euclidean geometries(Analýza fázových prechodov v asymptotickom režime v neeklidovkých geometriách)—Supervisor: Gendiar, Andrej, Mgr., PhD.Goals:
The aim is to classify phase transitions on non-Euclidean geometries by means of correlations and the von Neumann entanglement entropy.Annotation:
Non-Euclidean geometry exhibits a non-zero Gaussian curvature. An iterative numerical algorithm is to be proposed by renormalization-group methods for curved networks with negative curvatures. These networks mimic interaction structure of spin models, which describe physical systems in terms of Hamiltonians. Since such systems are not exactly solvable, numerical techniques need to be employed, so that an arbitrary programming language can be used, e.g., Python, MatLab, C++. etc. As the outcome, the specification of various universality classes of the spin models is to be given, including the elucidation of the mechanism, which breaks long-order correlations at phase transition on the negatively curved geometries. Single- and two-particle correlations, including entanglement entropy are to be calculated.
- Nagaj, Daniel: The Adiabatic Theorem in Physics and Computation(The Adiabatic Theorem in Physics and Computation)—Supervisor: Nagaj, Daniel, Mgr., PhD.Contact: daniel.nagajsavbaskAnnotation:
The adiabatic theorem tells us that evolving an eigenstate with a weakly time-dependent Hamiltonian results in a state near an instantaneous eigenstate, if some conditions are met. In this diploma thesis, we will first analyze these conditions in some depth. Second, we will look for computational applications of such processes, and their generalizations (quantum annealing). We will focus on stoquastic Hamiltonians, in particular those related to continuous-time quantum walks.
- Ziman, Mário: Programming quantum computer(Programujeme kvantový počítač)
- Ziman, Mário: Quantum dynamics from incomplete data(Kvantová dynamika z neúplných dát)
- Ziman, Mário: Quantum algorithms with noisy gates(Kvantové algoritmy so zašumenými hradlami)