Modifying the quantum-assisted genetic algorithm

Thomas Gabor, Michael Lachner, Nico Kraus, Christoph Roch, Jonas Stein, Daniel Ratke, Claudia Linnhoff-Popien

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.
BibTeX
@inproceedings{gabor2022modifying,
  author = {Thomas Gabor and Michael Lachner and Nico Kraus and Christoph Roch and Jonas Stein and Daniel Ratke and Claudia Linnhoff-Popien},
  title = {{Modifying the quantum-assisted genetic algorithm}},
  booktitle = {GECCO Companion},
  year = {2022},
  doi = {10.1145/3520304.3534034},
}

Loading related content...

Figure