research-article

Modifying the quantum-assisted genetic algorithm

Authors:

Michael Lachner,

Christoph Roch,

Claudia Linnhoff-PopienAuthors Info & Claims

GECCO '22: Proceedings of the Genetic and Evolutionary Computation Conference Companion

Pages 2205 - 2213

https://doi.org/10.1145/3520304.3534034

Published: 19 July 2022 Publication History

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.

References

[1]

Tameem Albash and Daniel A Lidar. 2018. Adiabatic Quantum Computation. Reviews of Modern Physics 90, 1 (2018), 015002.

[2]

Vladimír Černỳ. 1985. Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. Journal of optimization theory and applications 45, 1 (1985), 41--51.

Digital Library

[3]

D-Wave Systems Inc. 2017. White Paper: Reverse Quantum Annealing for Local Refinement of Solutions. Technical Report. D-Wave Systems Inc., Burnaby, British Columbia, Canada. https://www.dwavesys.com/media/5hsjmvom/14-1018aa_reverse_quantum_annealing_for_local_refinement_of_solutions.pdf

[4]

Alexander Fowler. 2017. Improved QUBO formulations for D-Wave quantum computing. Ph.D. Dissertation. University of Auckland.

[5]

Fred Glover, Gary Kochenberger, and Yu Du. 2018. A tutorial on formulating and using QUBO models. arXiv preprint arXiv:1811.11538 (2018).

[6]

John H. Holland. 1992. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. The MIT Press.

[7]

Holger H Hoos and Thomas Stützle. 2000. SATLIB: An online resource for research on SAT. Sat 2000 (2000), 283--292. https://www.cs.ubc.ca/~hoos/SATLIB/benchm.html

[8]

Jérôme Houdayer. 2001. A cluster Monte Carlo algorithm for 2-dimensional spin glasses. The European Physical Journal B-Condensed Matter and Complex Systems 22, 4 (2001), 479--484.

[9]

D-Wave Systems Inc. 2021. dwave-neal. https://github.com/dwavesystems/dwave-neal.

[10]

Tadashi Kadowaki and Hidetoshi Nishimori. 1998. Quantum annealing in the transverse Ising model. Phys. Rev. E 58 (1998), 5355--5363. Issue 5.

[11]

James King, M. Mohseni, William Bernoudy, Alexandre Fréchette, Hossein Sadeghi, Sergei Isakov, Hartmut Neven, and Mohammad Amin. 2019. Quantum-Assisted Genetic Algorithm.

[12]

S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. 1983. Optimization by Simulated Annealing. Science 220, 4598 (1983), 671--680. arXiv:https://www.science.org/doi/pdf/10.1126/science.220.4598.671

[13]

Rafael Lahoz-Beltra. 2016. Quantum genetic algorithms for computer scientists. Computers 5, 4 (2016), 24.

[14]

Andrew Lucas. 2014. Ising formulations of many NP problems. Frontiers in Physics 2 (2014).

[15]

Catherine C. McGeoch. 2014. Adiabatic Quantum Computation and Quantum Annealing: Theory and Practice. Synthesis Lectures on Quantum Computing 5, 2 (2014), 1--93.

[16]

Sajad Mousavi, Fatemeh Afghah, Jonathan D Ashdown, and Kurt Turck. 2019. Use of a quantum genetic algorithm for coalition formation in large-scale UAV networks. Ad Hoc Networks 87 (2019), 26--36.

Digital Library

[17]

Tao Ning, Hua Jin, Xudong Song, and Bo Li. 2018. An improved quantum genetic algorithm based on MAGTD for dynamic FJSP. Journal of Ambient Intelligence and Humanized Computing 9, 4 (2018), 931--940.

[18]

Rodolfo A. Quintero and Luis F. Zuluaga. 2021. Characterizing and Benchmarking QUBO Reformulations of the Knapsack Problem. Technical Report. Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA, USA.

Cited By

Zielinski SZorn MGabor TFeld SLinnhoff-Popien CLi XHandl J(2024)Using an Evolutionary Algorithm to Create (MAX)-3SAT QUBOsProceedings of the Genetic and Evolutionary Computation Conference Companion10.1145/3638530.3664153(1984-1992)Online publication date: 14-Jul-2024
https://dl.acm.org/doi/10.1145/3638530.3664153
Unterauer ABucher DKnoll MEconomides CLachner MGermain TKessel MHajdinovic SStein JLi XHandl J(2024)Solving the Turbine Balancing Problem using Quantum AnnealingProceedings of the Genetic and Evolutionary Computation Conference Companion10.1145/3638530.3664107(1972-1978)Online publication date: 14-Jul-2024
https://dl.acm.org/doi/10.1145/3638530.3664107
Ye XLi JWang P(2024)Multi-Scale Quantum Harmonic Oscillator Behaved Algorithm with Three-Stage Perturbation for High-Dimensional Expensive Problems2024 IEEE International Conference on Systems, Man, and Cybernetics (SMC)10.1109/SMC54092.2024.10831673(4187-4192)Online publication date: 6-Oct-2024
https://doi.org/10.1109/SMC54092.2024.10831673
Show More Cited By

Index Terms

Modifying the quantum-assisted genetic algorithm
1. Mathematics of computing
  1. Probability and statistics
    1. Probabilistic algorithms
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
    2. Mathematical optimization
      1. Discrete optimization
  2. Models of computation
    1. Probabilistic computation
    2. Quantum computation theory
      1. Quantum information theory

Recommendations

Hybrid genetic algorithm based on quantum computing for numerical optimization and parameter estimation

Quantum computing is applied to genetic algorithm (GA) to develop a class of quantum-inspired genetic algorithm (QGA) characterized by certain principles of quantum mechanisms for numerical optimization. Furthermore, a framework of hybrid QGA, named ...
A quantum genetic algorithm with quantum crossover and mutation operations

In the context of evolutionary quantum computing in the literal meaning, a quantum crossover operation has not been introduced so far. Here, we introduce a novel quantum genetic algorithm that has a quantum crossover procedure performing crossovers ...
Non-commuting two-local Hamiltonians for quantum error suppression

Physical constraints make it challenging to implement and control many-body interactions. For this reason, designing quantum information processes with Hamiltonians consisting of only one- and two-local terms is a worthwhile challenge. Enabling error ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

GECCO '22: Proceedings of the Genetic and Evolutionary Computation Conference Companion

July 2022

2395 pages

ISBN:9781450392686

DOI:10.1145/3520304

Editor:
Jonathan E. Fieldsend
University of Exeter
,
General Chair:
Markus Wagner
The University of Adelaide

Copyright © 2022 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 July 2022

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

GECCO '22

Sponsor:

SIGEVO

GECCO '22: Genetic and Evolutionary Computation Conference

July 9 - 13, 2022

Massachusetts, Boston

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
135
Total Downloads

Downloads (Last 12 months)18
Downloads (Last 6 weeks)1

Reflects downloads up to 08 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Zielinski SZorn MGabor TFeld SLinnhoff-Popien CLi XHandl J(2024)Using an Evolutionary Algorithm to Create (MAX)-3SAT QUBOsProceedings of the Genetic and Evolutionary Computation Conference Companion10.1145/3638530.3664153(1984-1992)Online publication date: 14-Jul-2024
https://dl.acm.org/doi/10.1145/3638530.3664153
Unterauer ABucher DKnoll MEconomides CLachner MGermain TKessel MHajdinovic SStein JLi XHandl J(2024)Solving the Turbine Balancing Problem using Quantum AnnealingProceedings of the Genetic and Evolutionary Computation Conference Companion10.1145/3638530.3664107(1972-1978)Online publication date: 14-Jul-2024
https://dl.acm.org/doi/10.1145/3638530.3664107
Ye XLi JWang P(2024)Multi-Scale Quantum Harmonic Oscillator Behaved Algorithm with Three-Stage Perturbation for High-Dimensional Expensive Problems2024 IEEE International Conference on Systems, Man, and Cybernetics (SMC)10.1109/SMC54092.2024.10831673(4187-4192)Online publication date: 6-Oct-2024
https://doi.org/10.1109/SMC54092.2024.10831673
Liu FCheng X(2023)A spatial layout method based on feature encoding and GA-BiLSTMProceedings of the 2023 International Conference on Robotics, Control and Vision Engineering10.1145/3608143.3608155(65-70)Online publication date: 21-Jul-2023
https://dl.acm.org/doi/10.1145/3608143.3608155
Gabor TZielinski SHenghuber SLinnhoff-Popien CSilva SPaquete L(2023)A Relative Approach to Comparative Performance Analysis for Quantum OptimizationProceedings of the Companion Conference on Genetic and Evolutionary Computation10.1145/3583133.3596371(2211-2215)Online publication date: 15-Jul-2023
https://dl.acm.org/doi/10.1145/3583133.3596371

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten