Informatica logo


Login Register

  1. Home
  2. To appear
  3. Quantum Genetic Algorithm with Dynamic E ...

Informatica

Information Submit your article For Referees Help ATTENTION!
  • Article info
  • Full article
  • Related articles
  • More
    Article info Full article Related articles

Quantum Genetic Algorithm with Dynamic Encoding Scheme
Jun Suk Kim   Man-Je Kim   Chang Wook Ahn  

Authors

 
Placeholder
https://doi.org/10.15388/26-INFOR639
Pub. online: 6 August 2026      Type: Research Article      Open accessOpen Access

Received
1 January 2026
Accepted
1 July 2026
Published
6 August 2026

Abstract

The field of Quantum Genetic Algorithm (QGA) has seen extensive efforts to develop reasonable algorithmic designs mainly due to its potential as well as the intrinsic difficulty to reproduce the necessary processes with the limited amount of quantum resources available, although it still remains one of rather theoretical concepts of approach to achieving quantum optimization. In this paper, we propose a dynamic encoding scheme that combines quantum adaptive search with iterative approximation of the search region. The method reuses the same quantum index register while updating the classical coordinate mapping associated with its basis states, thereby increasing local coordinate resolution without globally refining the entire continuous domain. Through noiseless statevector simulations on benchmark functions, we compare the proposed method with selected QGA variants in terms of final optimization accuracy and simulated qubit usage. The results show improved optimization performance under similar maximum qubit constraints, establishing a simulation-level resource advantage.

References

 
Abraham, H., AduOffei, Agarwal, R., et al. (2019). Qiskit: An Open-source Framework for Quantum Computing. https://doi.org/10.5281/zenodo.2562110.
 
Acampora, G., Schiattarella, R., Vitiello, A. (2022). Using quantum amplitude amplification in genetic algorithms. Expert Systems with Applications, 209, 118203. https://doi.org/10.1016/j.eswa.2022.118203.
 
Ackley, D.H. (1987). A Connectionist Machine for Genetic Hillclimbing. PhD dissertation, University of Michigan, Ann Arbor, MI.
 
Ardelean, S., Udrescu, M. (2024). Hybrid quantum search with genetic algorithm optimization. PeerJ Computer Science, 10, e2210. https://doi.org/10.7717/peerj-cs.2210.
 
Baritompa, W.P., Bulger, D.W., Wood, G.R. (2005). Grover’s quantum algorithm applied to global optimization. SIAM Journal on Optimization, 15(4), 1170–1184. https://doi.org/10.1137/040605072.
 
Chiesa, M., Maioli, G., Colombo, G.I., Piacentini, L. (2020). GARS: Genetic Algorithm for the identification of a robust subset of features in high-dimensional datasets. BMC Bioinformatics, 21(51). https://doi.org/10.1186/s12859-020-3400-6.
 
Dürr, C., Hoyer, P. (1996). A Quantum Algorithm for Finding the Minimum. CoRR, arXiv:quant-ph/9607014.
 
Farhi, E., Goldstone, J., Gutmann, S. (2014). A Quantum Approximate Optimization Algorithm. arXiv: Quantum Physics. https://api.semanticscholar.org/CorpusID:118149905.
 
Giri, P.R., Korepin, V.E. (2017). A review on Quantum Search Algorithms. Quantum Information Processing, 16(12), 1–36. https://doi.org/10.1007/s11128-017-1768-7.
 
Goldberg, D.E. (1988). Genetic Algorithms in Search, Optimization and Machine Learning, 13 ed. Addison-Wesley Professional.
 
Grover, L.K. (1996). A fast Quantum Mechanical Algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, STOC ‘96. Association for Computing Machinery, New York, NY, USA, pp. 212–219. https://doi.org/10.1145/237814.237866.
 
Han, K.-H., Kim, J.-H. (2002). Quantum-inspired evolutionary algorithm for a class of combinatorial optimization. IEEE Transactions on Evolutionary Computation, 6(6), 580–593. https://doi.org/10.1109/TEVC.2002.804320.
 
Hoffmeister, F., Bäck, T. (1991). Genetic Algorithms and evolution strategies: similarities and differences. In: Schwefel, H.-P., Männer, R. (Eds.), Parallel Problem Solving from Nature. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 455–469.
 
Lahoz-Beltra, R. (2023). The Conquest of Quantum Genetic Algorithms: The Adventure to Cross the Valley of Death. https://arxiv.org/abs/2401.08631.
 
Malossini, A., Blanzieri, E., Calarco, T. (2008). Quantum Genetic Optimization. IEEE Transactions on Evolutionary Computation, 12(2), 231–241. https://doi.org/10.1109/TEVC.2007.905006.
 
McClean, J., Boixo, S., Smelyanskiy, V., Babbush, R., Neven, H. (2018). Barren Plateaus in quantum neural network training landscapes. Nature Communications, 9, 4812. https://www.nature.com/articles/s41467-018-07090-4.
 
Naser, M.Z., Al-Bashiti, M.K., Tapeh, A.T.G., Naser, A., Kodur, V., Hawileh, R., Abdalla, J., Khodadadi, N., Gandomi, A.H., Eslamlou, A.D. (2025). A review of benchmark and test functions for global optimization algorithms and metaheuristics. Wiley Interdisciplinary Reviews: Computational Statistics, 17(2), 70028. https://doi.org/10.1002/wics.70028.
 
Nielsen, M.A., Chuang, I.L. (2004). Quantum Computation and Quantum Information 1st ed. Cambridge University Press.
 
Picheny, V., Wagner, T., Ginsbourger, D. (2013). A benchmark of kriging-based infill criteria for noisy optimization. Structural and Multidisciplinary Optimization, 48, 607–626. https://doi.org/10.1007/s00158-013-0919-4.
 
Preskill, J. (2018). Quantum Computing in the NISQ era and beyond. Quantum, 2, 79. https://doi.org/10.22331/q-2018-08-06-79.
 
Rosenbrock, H.H. (1960). An automatic method for finding the greatest or least value of a function. The Computer Journal, 3(3), 175–184. https://doi.org/10.1093/comjnl/3.3.175.
 
SaiToh, A., Rahimi, R., Nakahara, M. (2014). A quantum genetic algorithm with quantum crossover and mutation operations. Quantum Information Processing, 13, 737–755.
 
Sofge, D.A. (2008). Prospective algorithms for quantum evolutionary computation. In: Proceedings of the Second Quantum Interaction Symposium (QI-2008). College Publications, Oxford, UK, pp. 26–28.
 
Sun, Y., Xiong, H. (2014). Function optimization based on quantum genetic algorithm. Research Journal of Applied Sciences, Engineering and Technology, 7, 144–149. https://doi.org/10.19026/rjaset.7.231.
 
Tanabe, R., Ishibuchi, H. (2020). A review of evolutionary multimodal multiobjective optimization. IEEE Transactions on Evolutionary Computation, 24(1), 193–200. https://doi.org/10.1109/TEVC.2019.2909744.
 
Udrescu, M., Prodan, L., Vlăduţiu, M. (2006). Implementing quantum genetic algorithms: a solution based on grover’s algorithm. In: Proceedings of the 3rd Conference on Computing Frontiers, CF ’06. Association for Computing Machinery, New York, NY, USA, pp. 71–82. https://doi.org/10.1145/1128022.1128034.
 
Yanofsky, N.S., Mannucci, M.A. (2008). Quantum Computing for Computer Scientists, 1st ed. Cambridge University Press.
 
Zhang, G. (2011). Quantum-inspired evolutionary algorithms: a survey and empirical study. Journal of Heuristics, 17(3), 303–351. https://doi.org/10.1007/s10732-010-9136-0.

Biographies

Kim Jun Suk
junsuk89@gmail.com

J.S. Kim received his bachelor’s degree in Physics from University of Illinois in Urbana-Champaign, USA, in 2016 and received his master’s and doctoral degrees in quantum computing from Gwangju Institute of Science and Technology (GIST), Republic of Korea, in 2019 and 2025, respectively. He is currently working as a post-doctoral researcher in the Department of AI and the Institute for AI in GIST. His main topics of research are quantum heuristic optimization, quantum reinforcement learning, and quantum AI.

Kim Man-Je
jaykim0104@jnu.ac.kr

M.-J. Kim is an associate professor in the Department of AI at Chonnam National University, Republic of Korea. He received the PhD degree from the Artificial Intelligence Graduate School, Gwangju Institute of Science and Technology (GIST), Republic of Korea in 2023. His research interests span game artificial intelligence, reinforcement learning, human-computer interaction, and machine learning. Kim is recognized for his work on evolutionary reinforcement learning algorithms and AI systems that integrate human-centric decision-making frameworks.

Ahn Chang Wook
cwan@gist.ac.kr

C.W. Ahn is a professor in the Department of AI at Gwangju Institute of Science and Technology (GIST), Republic of Korea. He received a PhD degree from the Department of Information and Communications at GIST in 2005. From 2005 to 2007, he worked in Samsung Advanced Institute of Technology, Korea. From 2007 to 2008, he was a research professor at GIST. From 2008 to 2016, he was an assistant/associate professor at the Department of Computer Engineering, Sungkyunkwan University (SKKU), Republic of Korea. His research interests include genetic algorithms/programming, multi-objective optimization, neural networks, and quantum machine learning.


Full article Related articles PDF XML
Full article Related articles PDF XML

Copyright
© 2026 Vilnius University
by logo by logo
Open access article under the CC BY license.

Keywords
Quantum Algorithm optimization Genetic Algorithm

Metrics
since January 2020
98

Article info
views

34

Full article
views

36

PDF
downloads

21

XML
downloads

Export citation

Copy and paste formatted citation
Placeholder

Download citation in file


Share


RSS

INFORMATICA

  • Online ISSN: 1822-8844
  • Print ISSN: 0868-4952
  • Copyright © 2023 Vilnius University

About

  • About journal

For contributors

  • OA Policy
  • Submit your article
  • Instructions for Referees
    •  

    •  

Contact us

  • Institute of Data Science and Digital Technologies
  • Vilnius University

    Akademijos St. 4

    08412 Vilnius, Lithuania

    Phone: (+370 5) 2109 338

    E-mail: informatica@mii.vu.lt

    https://informatica.vu.lt/journal/INFORMATICA
Powered by PubliMill  •  Privacy policy