Circular Image

D. de Laat

5 records found

The branch-and-bound algorithm is used by solvers to efficiently find the optimal solution of discrete optimisation problems. It does so by sequentially partitioning parts of the search space based on the solution to the linear relaxation of the problem. This sequential decision- ...
In 2022, Golse and Paul defined a pseudometric for quantum optimal transport that extends the classical Wasserstein distance. They proved that the pseudometric satisfies the triangle inequality in certain cases. This thesis reviews their proof in the case where the middle point i ...
Normalizing flows are a probabilistic method to estimate the underlying density of data samples. The method is flow based and non-parametric, with the aim of being flexible, but still computationally manageable. This report aims to explain the process of normalizing flows by the ...
We will study the Clebsch-Gordan coefficients of the modular double of the quantum group Uq(sl(2, R)). This will be done by studying and taking a good look at how B. Ponsot and J. Teschner showed how to compute the Clebsch-Gordan coefficients [1]. Moreover, we will also take an i ...

In this thesis we will for a quantum Markov semi-group (Φt)t≥0 on a finite von Neumann algebra N with a trace τ , investigate the property of the semi-group being gradient-Sp for some p ∈ [1, ∞]. This property was introduced in [12] (see also [9]) and has bee ...