Improve the Quantum Approximate Optimization Algorithm with Genetic Algorithm
Pages 655 - 662
Abstract
The Quantum Approximate Optimization Algorithm (QAOA) is a variational quantum optimization technique used for solving combinatorial optimization problems. However, in constrained binary optimization, QAOA’s reliance on equal initial probabilities for all solutions can lead to suboptimal outcomes. To enhance the performance of QAOA in this context, we propose a novel approach that combines QAOA with genetic algorithms. In this hybrid approach, the results obtained from QAOA serve as the initial population for a genetic algorithm. We apply this methodology to address the k-heaviest subgraph problem, a critical challenge in quantum computing research. Our experiments, conducted on benchmark datasets, demonstrate a significant improvement in solution quality.
References
[1]
Giovanni Acampora, Angela Chiatto, and Autilia Vitiello. 2023. Genetic algorithms as classical optimizer for the Quantum Approximate Optimization Algorithm. Applied Soft Computing 142 (2023), 110296.
[2]
Panagiotis Kl Barkoutsos, Giacomo Nannicini, Anton Robert, Ivano Tavernelli, and Stefan Woerner. 2020. Improving variational quantum optimization using CVaR. Quantum 4 (2020), 256.
[3]
Joao Basso, David Gamarnik, Song Mei, and Leo Zhou. 2022. Performance and limitations of the QAOA at constant levels on large sparse hypergraphs and spin glass models. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 335–343.
[4]
Alain Billionnet. 2005. Different formulations for solving the heaviest k-subgraph problem. INFOR: Information Systems and Operational Research 43, 3 (2005), 171–186.
[5]
Lennart Bittel and Martin Kliesch. 2021. Training variational quantum algorithms is np-hard. Physical review letters 127, 12 (2021), 120502.
[6]
Sebastian Brandhofer, Daniel Braun, Vanessa Dehn, Gerhard Hellstern, Matthias Hüls, Yanjun Ji, Ilia Polian, Amandeep Singh Bhatia, and Thomas Wellens. 2022. Benchmarking the performance of portfolio optimization with QAOA. Quantum Information Processing 22, 1 (2022), 25.
[7]
J Brooke, David Bitko, Rosenbaum, and Gabriel Aeppli. 1999. Quantum annealing of a disordered magnet. Science 284, 5415 (1999), 779–781.
[8]
Cristian S Calude, Michael J Dinneen, and Richard Hua. 2020. Quantum solutions for densest k-subgraph problems. Journal of Membrane Computing 2 (2020), 26–41.
[9]
Constantin Dalyac, Loïc Henriet, Emmanuel Jeandel, Wolfgang Lechner, Simon Perdrix, Marc Porcheron, and Margarita Veshchezerova. 2021. Qualifying quantum approaches for hard industrial optimization problems. A case study in the field of smart-charging of electric vehicles. EPJ Quantum Technology 8, 1 (2021), 12.
[10]
Edward Farhi, Jeffrey Goldstone, and Sam Gutmann. 2014. A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028 (2014).
[11]
Rebekah Herrman, James Ostrowski, Travis S Humble, and George Siopsis. 2021. Lower bounds on circuit depth of the quantum approximate optimization algorithm. Quantum Information Processing 20 (2021), 1–17.
[12]
Rebekah Herrman, Lorna Treffert, James Ostrowski, Phillip C Lotshaw, Travis S Humble, and George Siopsis. 2021. Impact of graph structures for QAOA on MaxCut. Quantum Information Processing 20, 9 (2021), 289.
[13]
Nishant Jain, Brian Coyle, Elham Kashefi, and Niraj Kumar. 2022. Graph neural network initialisation of quantum approximate optimisation. Quantum 6 (2022), 861.
[14]
Tadashi Kadowaki and Hidetoshi Nishimori. 1998. Quantum annealing in the transverse Ising model. Physical Review E 58, 5 (1998), 5355.
[15]
Jean B Lasserre. 2016. A MAX-CUT formulation of 0/1 programs. Operations Research Letters 44, 2 (2016), 158–164.
[16]
Matthaios Letsios, Oana Denisa Balalau, Maximilien Danisch, Emmanuel Orsini, and Mauro Sozio. 2016. Finding heaviest k-subgraphs and events in social media. In 2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW). IEEE, 113–120.
[17]
Cleve Moler and Charles Van Loan. 2003. Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later. SIAM review 45, 1 (2003), 3–49.
[18]
Satoshi Morita and Hidetoshi Nishimori. 2006. Convergence theorems for quantum annealing. Journal of Physics A: Mathematical and General 39, 45 (2006), 13903.
[19]
Stefan H Sack and Maksym Serbyn. 2021. Quantum annealing initialization of the quantum approximate optimization algorithm. quantum 5 (2021), 491.
[20]
Harkirat Singh, Mukesh Kumar, and Preeti Aggarwal. 2019. Approximation of heaviest k-subgraph problem by size reduction of input graph. In Proceedings of 2nd International Conference on Communication, Computing and Networking: ICCCN 2018, NITTTR Chandigarh, India. Springer, 599–605.
[21]
Son Ta Anh and Nguyen Ha Huy Phuc. 2023. Solving Feature Selection Problem by Quantum Optimization Algorithm (accepted). In The 2nd International Conference on Intelligence of Things 2023 (ICITconf’2023). Ho Chi Minh City, Vietnam.
[22]
Zoltán Tasnádi and Noémi Gaskó. 2022. An Ant Colony Optimisation Approach to the Densest k-Subgraph Problem. In 2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). IEEE, 208–211.
[23]
Reuben Tate and Swati Gupta. 2021. CI-QuBe. https://github.com/swati1729/CI-QuBe. GitHub repository (2021).
Index Terms
- Improve the Quantum Approximate Optimization Algorithm with Genetic Algorithm
Recommendations
Hybrid Taguchi-genetic algorithm for global numerical optimization
In this paper, a hybrid Taguchi-genetic algorithm (HTGA) is proposed to solve global numerical optimization problems with continuous variables. The HTGA combines the traditional genetic algorithm (TGA), which has a powerful global exploration capability,...
An improved genetic algorithm with conditional genetic operators and its application to set-covering problem
The genetic algorithm (GA) is a popular, biologically inspired optimization method. However, in the GA there is no rule of thumb to design the GA operators and select GA parameters. Instead, trial-and-error has to be applied. In this paper we present an ...
Bacterial foraging optimisation algorithm, particle swarm optimisation and genetic algorithm: a comparative study
Nature inspired meta-heuristic algorithms have been widely used in order to find efficient solutions for optimisation problems, and granted results have been achieved. Particle swarm optimisation PSO algorithm is one of the most utilised algorithms in ...
Comments
Information & Contributors
Information
Published In
December 2023
1058 pages
ISBN:9798400708916
DOI:10.1145/3628797
Copyright © 2023 ACM.
Publication rights licensed to ACM. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of a national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 07 December 2023
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
SOICT 2023
SOICT 2023: The 12th International Symposium on Information and Communication Technology
December 7 - 8, 2023
Ho Chi Minh, Vietnam
Acceptance Rates
Overall Acceptance Rate 147 of 318 submissions, 46%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 49Total Downloads
- Downloads (Last 12 months)28
- Downloads (Last 6 weeks)4
Reflects downloads up to 01 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format