 document

Driebergen, Tim (author)The minimum vertex cover problem (MinVertexCover) is an important optimization problem in graph theory, with applications in numerous fields outside of mathematics. As MinVertexCover is an NPhard problem, there currently exists no efficient algorithm to find an optimal solution on arbitrary graphs. We consider quantum optimization algorithms,...master thesis 2023
 document

Fillerup, Chai (author)Quantum communication has been shown to be vastly superior to classical communication in many problems. However no general statements exist which tells us how much better quantum communication is to its classical counterpart. In this thesis it was studied the minimum amount of classical bits required to exactly simulate a quantum communication...bachelor thesis 2022
 document

Eelkema, Dominic (author)This thesis explores the convergence of the mixing method, an iter ative algorithm for solving diagonally constrained semidefinite programs. In this paper we first give an exposition of the convergence proof for the mixing method based on the proof by Wang, Chang, and Kolter , where we restructure some parts of the proof and provide extra de...master thesis 2022
 document

Polshchykova, Zoya (author)In this thesis, gate set tomography (GST) has been conducted on the nitrogen vacancy center (NV). Gate set tomography is a protocol for characterization of logic operations (gates) on quantum computing processors. The NV’s electron served as a qubit. The quantum circuits were run both experimentally as well as on an NVsimulator. GST is...bachelor thesis 2022
 document

Oudejans, Benjamin (author)As quantum computers are developing, they are beginning to become useful for practical applications, for example in the field of quantum metrology. In this work, a variational quantum algorithm is used to find an optimal probe state for measuring parameters in a noisy environment. This is achieved by optimizing a cost on a quantum computer,...bachelor thesis 2021
 document

Goverse, Vincent (author)In this thesis, we start with giving a mathematical description of bipartite quantum correlations and how they are built up in the Tensor model. This is needed because we want to recover the state and the operators when only the bipartite quantum correlation is known. In the literature, there are seesaw algorithms to...bachelor thesis 2021
 document

de Vries, Olaf (author)In this work, ClebschGordan coefficients are studied from both a quantum mechanical and a mathematical perspective. In quantum mechanics, ClebschGordan coefficients arise when two quantum systems with a certain angular momentum are combined and the total angular momentum is to be found. We start by discussing the relevant postulates of quantum...bachelor thesis 2021
 document

Leijenhorst, Nando (author)In this thesis, we give a primaldual interior point method specialized to clustered lowrank semidefinite programs. We introduce multivariate polynomial matrix programs, and we reduce these to clustered lowrank semidefinite programs. This extends the work of SimmonsDuffin [J. High Energ. Phys. 1506, no. 174 (2015)] from...master thesis 2021
 document

Schalkers, Merel (author)Large faulttolerant universal gate quantum computers will provide a major speedup to a variety of common computational problems. While such computers are years away, we currently have noisy intermediatescale quantum (NISQ) computers at our disposal. In this project we present two quantum machine learning approaches that can be used to find...master thesis 2021
 document

Vollebergh, M.A.J. (author)The construction of cyclic railway timetables is an important task for Netherlands Railways (NS).This construction can be formulated as a Periodic Event Scheduling Problem (PESP). The most powerful technique for solving cyclic railway timetabling problems is constraint programming, especially via SAT solvers when PESP instances are encoded as...master thesis 2020
 document

Bosma, Jan (author)The first part of this thesis provides a mathematical description for bipartite quantum correlations, aiming to analyze the geometry of several sets of correlations. We explain why quantum entanglement can be used to simulate shared randomness: C<sub>loc</sub>(Γ) ⊆ C<sub>q</sub><sup>d</sup>(Γ) for a sufficiently large d. The known bound for this...bachelor thesis 2020
 document

Kalicharan, K. (author)In de grafentheorie is het maximale snede probleem een bekend NPhard probleem. Hiervoor is door Goemans en Williamson [GW95] een 0.878benaderingsalgoritme gevonden gebaseerd op semidefiniet programmeren. Later zijn dezelfde technieken gebruikt om een benadering te vinden voor de oplossing van een algemener probleem genaamd het kleine...bachelor thesis 2014