Journal of Engineering in Industrial Research

h-index: 18     i10-index: 25

Quantum Computing Algorithms for Addressing Intricate Optimization Challenges

Document Type : Original Research Article

Author

Hamid Reza Hanif

Department of Mathematics and Computer Science, Iran University of Science and Technology, Tehran, Iran

https://doi.org/10.48309/jeires.2025.504983.1159
Abstract
Quantum computing and artificial intelligence are two advanced and emerging areas of science and technology, each of which has the potential to bring about massive changes in various industries. Combining these two technologies could lead to significant innovations. Quantum computing uses the principles of quantum physics to perform computational operations, which helps to achieve faster solutions to complex problems. Artificial intelligence uses its algorithms to build and improve intelligent systems capable of designing, thinking, and making decisions. Combining these two technologies will lead to greater power in solving complex problems and improving the efficiency of artificial intelligence systems. Although quantum computing has great potential, it is still in the early stages of development and faces many technical challenges. These include the stability of qubits, quantum errors, and the need for extremely cold environments for quantum systems to operate. As research in both fields’ advances, the interaction of quantum computing and artificial intelligence is expected to lead to significant results and create a huge transformation in various industries, including medicine, finance, logistics, and information technology. In quantum artificial intelligence, quantum computing power is used to optimize this problem. For example, a quantum algorithm known as a “quantum search algorithm” can process the search space in parallel and quickly converge to an optimal solution. Suppose we have a quantum network that can put qubits into different states at the same time. This property allows us to explore all possible paths in parallel. Then, using quantum algorithms such as Grover’s Algorithm, we can reach the optimal path faster than classical algorithms.

Keywords

Algorithm
Artificial intelligence
‎Quantum computing
Optimization.‎

Subjects

OPEN ACCESS

©2025 The author(s). This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit: http://creativecommons.org/licenses/by/4.0/

[1]. M. Mattesi, L. Asproni, C. Mattia, S. Tufano, G. Ranieri, D. Caputo, D. Corbelletto, Diversifying investments and maximizing sharpe ratio: A novel quadratic unconstrained binary optimization formulation, Quantum Reports, 2024, 6, 244-262. [Crossref], [Google Scholar], [Publisher]
[2]. V. Marchioli, M. Boggio, D. Volpe, L. Massotti, C. Novara, Scheduling of satellite constellation operations in EO missions using Quantum Optimization, International Conference on Optimization, Learning Algorithms and Applications, 2024, 227-242. [Crossref], [Google Scholar], [Publisher]
[3]. D. Volpe, G.A. Cirillo, R. Fantini, A. Boella, G. Mondo, M. Graziano, G. Turvani, Quantum-compliant users scheduling optimization in joint transmission mobile access networks, Quantum Information Processing, 2024, 23, 262. [Crossref], [Google Scholar], [Publisher]
[4]. J. Blenninger, D. Bucher, G. Cortiana, K. Ghosh, N. Mohseni, J. Nüßlein, C. O’Meara, D. Porawski, B. Wimmer, Q-GRID: Quantum Optimization for the Future Energy Grid, KI-Künstliche Intelligenz, 2024, 1-11. [Crossref], [Google Scholar], [Publisher]
[5]. S. Kirkpatrick, C.D. Gelatt Jr, M.P. Vecchi, Optimization by simulated annealing, science, 1983, 220, 671-680. [Crossref], [Google Scholar], [Publisher]
[6]. F. Barahona, On the computational complexity of Ising spin glass models, Journal of Physics A: Mathematical and General, 1982, 15, 3241. [Crossref], [Google Scholar], [Publisher]
[7]. M. Ayodele, R. Allmendinger, M. López-Ibáñez, M. Parizy, Multi-objective QUBO solver: Bi-objective quadratic assignment problem, Proceedings of the Genetic and Evolutionary Computation Conference, 2022, 467-475. [Crossref], [Google Scholar], [Publisher]
[8]. D. Dobrynin, A. Renaudineau, M. Hizzani, D. Strukov, M. Mohseni, J.P. Strachan, Energy landscapes of combinatorial optimization in Ising machines, Physical Review E, 2024, 110, 045308. [Crossref], [Google Scholar], [Publisher]
[9]. P. Documentation, Pyqubo documentation-getting started, Accessed: December, 2023, 15. [Google Scholar], [Publisher]
[10]. A. Moraglio, S. Georgescu, P. Sadowski, AutoQubo: Data-driven automatic QUBO generation, Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2022, 2232-2239. [Crossref], [Google Scholar], [Publisher]
[11]. J. Pauckert, M. Ayodele, M.D. García, S. Georgescu, M. Parizy, Autoqubo v2: Towards efficient and effective qubo formulations for ising machines, Proceedings of the Companion Conference on Genetic and Evolutionary Computation, 2023, 227-230. [Crossref], [Google Scholar], [Publisher]
[12]. P.M. Xavier, P. Ripper, T. Andrade, J.D. Garcia, N. Maculan, D.E.B. Neira, Qubo. jl: A julia ecosystem for quadratic unconstrained binary optimization, ARXIV PREPRINT ARXIV:2307.02577, 2023. [Crossref], [Google Scholar], [Publisher]
[13]. D. Volpe, G. Orlandi, G. Turvani, Improving the solving of optimization problems: A comprehensive review of quantum approaches, Quantum Reports, 2025, 7, 3. [Crossref], [Google Scholar], [Publisher]
[14]. D. Volpe, N. Quetschlich, M. Graziano, G. Turvani, R. Wille, A predictive approach for selecting the best quantum solver for an optimization problem, 2024 IEEE International Conference on Quantum Computing and Engineering (QCE), IEEE, 2024, 1014-1025. [Crossref], [Google Scholar], [Publisher]
[15]. R. Wille, L. Berent, T. Forster, J. Kunasaikaran, K. Mato, T. Peham, N. Quetschlich, D. Rovara, A. Sander, L. Schmid, The mqt handbook: A summary of design automation tools and software for quantum computing, 2024 IEEE International Conference on Quantum Software (QSW), IEEE, 2024, 1-8. [Crossref], [Google Scholar], [Publisher]
[16]. D. Rovara, N. Quetschlich, R. Wille, A framework to formulate pathfinding problems for quantum computing, ARXIV PREPRINT ARXIV:2404.10820, 2024. [Crossref], [Google Scholar], [Publisher]
[17]. E. Lobe, Quark: Quantum application reformulation kernel, 2023. [Crossref], [Google Scholar], [Publisher]
[18]. G. Orlandi, D. Volpe, M. Graziano, G. Turvani, Qoolchain: A QUBO preprocessing toolchain for enhancing quantum optimization, Advanced Quantum Technologies, 2024, 2400384. [Crossref], [Google Scholar], [Publisher]
[19]. D. Volpe, G.A. Cirillo, M. Zamboni, G. Turvani, Integration of simulated quantum annealing in parallel tempering and population annealing for heterogeneous-profile QUBO exploration, IEEE Access, 2023, 11, 30390-30441. [Crossref], [Google Scholar], [Publisher]
[20]. E.F. Combarro, S. González-Castillo, A. Di Meglio, A practical guide to quantum machine learning and quantum optimization: Hands-on approach to modern quantum algorithms, Packt Publishing Ltd, 2023. [Google Scholar], [Publisher]
[21]. F. Safari, H. Safari, Synthesis of graphene oxide nano carriers containing alcoholic extracts of turmeric, Sedum, and rosemary in order to treat breast cancer in dogs, Eurasian Journal of Chemical, Medicinal and Petroleum Research ,2022, 1, 4. [Google Scholar], [Publisher]
[22]. K. Blekos, D. Brand, A. Ceschini, C.-H. Chou, R.-H. Li, K. Pandya, A. Summer, A review on quantum approximate optimization algorithm and its variants, Physics Reports, 2024, 1068, 1-66. [Crossref], [Google Scholar], [Publisher]
[23]. M. Fernández-Pendás, E.F. Combarro, S. Vallecorsa, J. Ranilla, I.F. Rúa, A study of the performance of classical minimizers in the quantum approximate optimization algorithm, Journal of Computational and Applied Mathematics, 2022, 404, 113388. [Crossref], [Google Scholar], [Publisher]
[24]. A. Pellow-Jarman, S. McFarthing, I. Sinayskiy, D.K. Park, A. Pillay, F. Petruccione, The effect of classical optimizers and Ansatz depth on QAOA performance in noisy devices, Scientific Reports, 2024, 14, 16011. [Crossref], [Google Scholar], [Publisher]
[25]. J. Stein, F. Chamanian, M. Zorn, J. Nüßlein, S. Zielinski, M. Kölle, C. Linnhoff-Popien, Evidence that PUBO outperforms QUBO when solving continuous optimization problems with the QAOA, Proceedings of the Companion Conference on Genetic and Evolutionary Computation, 2023, 2254-2262. [Crossref], [Google Scholar], [Publisher]
[26]. J. Tilly, H. Chen, S. Cao, D. Picozzi, K. Setia, Y. Li, E. Grant, L. Wossnig, I. Rungger, G.H. Booth, The variational quantum eigensolver: a review of methods and best practices, Physics Reports, 2022, 986, 1-128. [Crossref], [Google Scholar], [Publisher]
[27]. Z. Holmes, K. Sharma, M. Cerezo, P.J. Coles, Connecting ansatz expressibility to gradient magnitudes and barren plateaus, PRX Quantum, 2022, 3, 010313. [Crossref], [Google Scholar], [Publisher]
[28]. A. Gilliam, S. Woerner, C. Gonciulea, Grover adaptive search for constrained polynomial binary optimization, Quantum, 2021, 5, 428. [Crossref], [Google Scholar], [Publisher]
[29]. L. Giuffrida, D. Volpe, G.A. Cirillo, M. Zamboni, G. Turvani, Engineering grover adaptive search: Exploring the degrees of freedom for efficient qubo solving, IEEE Journal on Emerging and Selected Topics in Circuits and Systems, 2022, 12, 614-623. [Crossref], [Google Scholar], [Publisher]
[30]. H. Ominato, T. Ohyama, K. Yamaguchi, Grover Adaptive Search with Fewer Queries, IEEE Access, 2024. [Crossref], [Google Scholar], [Publisher]
[31]. Y. Sano, K. Mitarai, N. Yamamoto, N. Ishikawa, Accelerating grover adaptive search: Qubit and gate count reduction strategies with higher-order formulations, IEEE Transactions on Quantum Engineering, 2024. [Crossref], [Google Scholar], [Publisher]
[32]. A. Gilliam, C. Venci, S. Muralidharan, V. Dorum, E. May, R. Narasimhan, C. Gonciulea, Foundational patterns for efficient quantum computing, ARXIV PREPRINT ARXIV:1907.11513, 2019. [Crossref], [Google Scholar], [Publisher]
[33]. M. Kim, S. Kasi, P.A. Lott, D. Venturelli, J. Kaewell, K. Jamieson, Heuristic quantum optimization for 6G wireless communications, IEEE Network, 2021, 35, 8-15. [Crossref], [Google Scholar], [Publisher]
[34]. V. Puram, D. Kang, K. George, J.P. Thomas, Algorithm to build quantum circuit from classical description of DFSM, 2022 IEEE International Conference on Quantum Computing and Engineering (QCE), IEEE, 2022, 745-748. [Crossref], [Google Scholar], [Publisher]
[35]. D. Pastorello, E. Blanzieri, A quantum binary classifier based on cosine similarity, 2021 IEEE International Conference on Quantum Computing and Engineering (QCE), IEEE, 2021, 477-478. [Crossref], [Google Scholar], [Publisher]
[36]. A. Adedoyin, J. Ambrosiano, P. Anisimov, W. Casper, G. Chennupati, C. Coffrin, H. Djidjev, D. Gunter, S. Karra, N. Lemons, Quantum algorithm implementations for beginners, ARXIV PREPRINT ARXIV:1804.03719, 2018. [Crossref], [Google Scholar], [Publisher]
[37]. R. Iten, R. Moyard, T. Metger, D. Sutter, S. Woerner, Exact and practical pattern matching for quantum circuit optimization, ACM Transactions on Quantum Computing, 2022, 3, 1-41. [Crossref], [Google Scholar], [Publisher]
[38]. J. Nüßlein, L. Sünkel, J. Stein, T. Rohe, D. Schuman, C. Linnhoff-Popien, S. Feld, Reducing QAOA circuit depth by factoring out semi-symmetries, ARXIV PREPRINT ARXIV:2411.08824, 2024. [Crossref], [Google Scholar], [Publisher]
[39]. K. Zhang, P. Rao, K. Yu, H. Lim, V. Korepin, Implementation of efficient quantum search algorithms on NISQ computers, Quantum Information Processing, 2021, 20, 1-27. [Crossref], [Google Scholar], [Publisher]
[40]. C. Collins, D. Dennehy, K. Conboy, P. Mikalef, Artificial intelligence in information systems research: A systematic literature review and research agenda, International Journal of Information Management, 2021, 60, 102383. [Crossref], [Google Scholar], [Publisher]
[41]. T. Fösel, M.Y. Niu, F. Marquardt, L. Li, Quantum circuit optimization with deep reinforcement learning, ARXIV PREPRINT ARXIV:2103.07585, 2021. [Crossref], [Google Scholar], [Publisher]
[42]. M. Ostaszewski, L.M. Trenkwalder, W. Masarczyk, E. Scerri, V. Dunjko, Reinforcement learning for optimization of variational quantum circuit architectures, Advances in Neural Information Processing Systems, 2021, 34, 18182-18194. [Google Scholar], [Publisher]
[43]. L. Moro, M.G. Paris, M. Restelli, E. Prati, Quantum compiling by deep reinforcement learning, Communications Physics, 2021, 4, 178. [Crossref], [Google Scholar], [Publisher]
[44]. T. Salehi, M. Zomorodi, P. Plawiak, M. Abbaszade, V. Salari, An optimizing method for performance and resource utilization in quantum machine learning circuits, Scientific Reports, 2022, 12, 16949. [Crossref], [Google Scholar], [Publisher]
[45]. J. Riu, J. Nogué, G. Vilaplana, A. Garcia-Saez, M.P. Estarellas, Reinforcement learning based quantum circuit optimization via ZX-calculus, ARXIV PREPRINT ARXIV:2312.11597, 2023. [Crossref], [Google Scholar], [Publisher]
[46]. S.A. Stein, B. Baheri, D. Chen, Y. Mao, Q. Guan, A. Li, B. Fang, S. Xu, Qugan: A quantum state fidelity based generative adversarial network, 2021 IEEE International Conference on Quantum Computing and Engineering (QCE), IEEE, 2021, 71-81. [Crossref], [Google Scholar], [Publisher]
[47]. A.M. Krol, A. Sarkar, I. Ashraf, Z. Al-Ars, K. Bertels, Efficient decomposition of unitary matrices in quantum circuit compilers, Applied Sciences, 2022, 12, 759. [Crossref], [Google Scholar], [Publisher]
[48]. J. Pointing, O. Padon, Z. Jia, H. Ma, A. Hirth, J. Palsberg, A. Aiken, Quanto: Optimizing quantum circuits with automatic generation of circuit identities, Quantum Science and Technology, 2024, 9, 045009. [Crossref], [Google Scholar], [Publisher]
[49]. M. Xu, Z. Li, O. Padon, S. Lin, J. Pointing, A. Hirth, H. Ma, J. Palsberg, A. Aiken, U.A. Acar, Quartz: superoptimization of quantum circuits, Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2022, 625-640. [Crossref], [Google Scholar], [Publisher]
[50]. S. Zhang, K. Huang, L. Li, Depth-optimized quantum circuit synthesis for diagonal unitary operators with asymptotically optimal gate count, Physical Review A, 2024, 109, 042601. [Crossref], [Google Scholar], [Publisher]
[51]. G. Cavallaro, M. Riedel, T. Lippert, K. Michielsen, Hybrid quantum-classical workflows in modular supercomputing architectures with the julich unified infrastructure for quantum computing, IGARSS 2022-2022 IEEE International Geoscience and Remote Sensing Symposium, IEEE, 2022, 4149-4152. [Crossref], [Google Scholar], [Publisher]
[52]. J.P. Stenger, N.T. Bronn, D.J. Egger, D. Pekker, Simulating the dynamics of braiding of Majorana zero modes using an IBM quantum computer, Physical Review Research, 2021, 3, 033171. [Crossref], [Google Scholar], [Publisher]
[53]. S. Katoch, S.S. Chauhan, V. Kumar, A review on genetic algorithm: Past, present, and future, Multimedia Tools and Applications, 2021, 80, 8091-8126. [Crossref], [Google Scholar], [Publisher]
[54]. L. Sünkel, D. Martyniuk, D. Mattern, J. Jung, A. Paschke, Ga4qco: Genetic algorithm for quantum circuit optimization, ARXIV PREPRINT ARXIV:2302.01303, 2023. [Crossref], [Google Scholar], [Publisher]
[55]. L. Wei, Z. Ma, Y. Cheng, Q. Liu, Genetic algorithm-based quantum circuits optimization for quantum computing simulation, 2021 12th International Conference on Information, Intelligence, Systems & Applications (IISA), IEEE, 2021, 1-8. [Crossref], [Google Scholar], [Publisher]
[56]. J. Kusyk, S.M. Saeed, M.U. Uyar, Survey on quantum circuit compilation for noisy intermediate-scale quantum computers: Artificial intelligence to heuristics, IEEE Transactions on Quantum Engineering, 2021, 2, 1-16. [Crossref], [Google Scholar], [Publisher]
[57]. H. Fan, C. Guo, W. Luk, Optimizing quantum circuit placement via machine learning, Proceedings of the 59th ACM/IEEE Design Automation Conference, 2022, 19-24. [Crossref], [Google Scholar], [Publisher]
[58]. A. Paler, L. Sasu, A.-C. Florea, R. Andonie, Machine learning optimization of quantum circuit layouts, ACM Transactions on Quantum Computing, 2023, 4, 1-25. [Crossref], [Google Scholar], [Publisher]
[59]. D. Kremer, V. Villar, H. Paik, I. Duran, I. Faro, J. Cruz-Benito, Practical and efficient quantum circuit synthesis and transpiling with reinforcement learning, Arxiv Preprint Arxiv:2405.13196, 2024. [Crossref], [Google Scholar], [Publisher]
[60]. J. Liu, L. Bello, H. Zhou, Relaxed peephole optimization: A novel compiler optimization for quantum circuits,  2021, IEEE/ACM International Symposium on Code Generation and Optimization (CGO), IEEE, 2021, pp. 301-314. [Crossref], [Google Scholar], [Publisher]
[61]. T. Jones, S.C. Benjamin, Robust quantum compilation and circuit optimisation via energy minimisation, Quantum, 2022, 6, 628. [Crossref], [Google Scholar], [Publisher]
 
Journal of Engineering in Industrial Research
Volume 6, Issue 1
Winter 2025
Pages 70-87

  • Receive Date 06 February 2025
  • Revise Date 21 February 2025
  • Accept Date 12 March 2025

Home

A-Z Journals

Indexing and Abstracting

Editorial Board

Guide for Authors

Submit Manuscript

Contact Us