Proefschrift
Applications of quantum annealing in combinatorial optimization
Quantum annealing belongs to a family of quantum optimization algorithms designed to solve combinatorial optimization problems using programmable quantum hardware. In this thesis, various methods are developed and tested to understand how to formulate combinatorial optimization problems for quantum annealing.
- Auteur
- Yarkoni, S.
- Datum
- 20 december 2022
- Links
- Thesis in Leiden Repository
Use of both purely quantum approaches as well as hybrid quantum-classical algorithms are investigated using state-of-the-art quantum hardware. How the developed methods affect the performance of quantum hardware in practice is tested using both real-world and canonical academic problems.