- 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 NP-hard problem, there currently exists no efficient algorithm to find an optimal solution on arbitrary graphs. We consider quantum optimization algorithms,...master thesis 2023
- document
-
Donkers, Huub (author)As the technology of quantum computers improves, the need to evaluate their performance also becomes an important tool for indexing and comparing of quantum performance. Current benchmarking proposals either focus on gate-level evaluation, are centered around a single performance metric, or only evaluate in-house quantum computers. This gives...master thesis 2022
- document
-
de Zoete, J (author)The aerospace engineering industry is continuously striving for faster methods to solve and optimize engineering and research problems with a higher degree of accuracy. It is therefore relevant to investigate possibilities that are expected to accelerate computational speed, such as quantum computing. For this reason, the objective of this...master thesis 2021
- document
-
Bus, J.C.P. (author)The Quantum Approximate Optimization Algorithm (QAOA) is one of the promising near-term algorithms designed to find approximate solutions for combinatorial optimization problems. The algorithm prepares a parametrized state that is aimed to maximize the expectation value of the objective function of the problem. The circuit for QAOA consists of p...bachelor thesis 2020