Abstract
Based on the quantum-assisted genetic algorithm (QAGA) [11] and related approaches we introduce several modifications of QAGA to search for more promising solvers on (at least) graph coloring problems, knapsack problems, Boolean satisfiability problems, and an equal combination of these three. We empirically test the efficiency of these algorithmic changes on a purely classical version of the algorithm (simulated-annealing-assisted genetic algorithm, SAGA) and verify the benefit of selected modifications when using quantum annealing hardware. Our results point towards an inherent benefit of a simpler and more flexible algorithm design.
Dokumententyp: | Konferenzbeitrag (Paper) |
---|---|
Fakultät: | Mathematik, Informatik und Statistik > Informatik |
Themengebiete: | 000 Informatik, Informationswissenschaft, allgemeine Werke > 004 Informatik |
Ort: | New York |
Sprache: | Englisch |
Dokumenten ID: | 109992 |
Datum der Veröffentlichung auf Open Access LMU: | 22. Mrz. 2024, 07:50 |
Letzte Änderungen: | 22. Mrz. 2024, 07:50 |