Quantum-inspired search algorithms for optimizing complex systems
DOI:
https://doi.org/10.65126/jocosir.v1i4.30Keywords:
Complex System Optimization, Genetic Algorithms, Objective Function, Quantum-Inspired OptimizationAbstract
This research explores the application of a Quantum-Inspired Genetic Algorithm (QIGA) to optimize complex systems, utilizing a numerical experiment with a focus on the objective function... The QIGA integrates quantum-inspired principles, including crossover, entanglement, and evolution, to strike a balance between exploration and exploitation within the solution space. A 100-generation experiment with a population size of 50 reveals the algorithm's adaptability and gradual convergence towards optimal solutions. The linear combination crossover, guided by quantum principles, enhances diversity, while entanglement and evolution operations introduce correlations between quantum states. The results underscore the algorithm's potential, prompting discussions on parameter tuning, comparisons with classical algorithms, and considerations for transitioning to real quantum hardware. The findings contribute to the understanding of quantum-inspired optimization and pave the way for further research in quantum computing applications for complex system optimization.
References
K. Cao, S. Hu, Y. Shi, A. W. Colombo, S. Karnouskos, and X. Li, “A survey on edge and edge-cloud computing assisted cyber-physical systems,” IEEE Trans. Ind. Informatics, vol. 17, no. 11, pp. 7806–7819, 2021.
A. Darwish, A. E. Hassanien, and S. Das, “A survey of swarm and evolutionary computing approaches for deep learning,” Artif. Intell. Rev., vol. 53, pp. 1767–1812, 2020.
J. Végh, “Revising the classic computing paradigm and its technological implementations,” in Informatics, MDPI, 2021, p. 71.
E. National Academies of Sciences and Medicine, “Quantum computing: progress and prospects,” 2019.
P. Nimbe, B. A. Weyori, and A. F. Adekoya, “Models in quantum computing: a systematic review,” Quantum Inf. Process., vol. 20, no. 2, p. 80, 2021.
L. Marchetti et al., “Quantum computing algorithms: getting closer to critical problems in computational biology,” Brief. Bioinform., vol. 23, no. 6, p. bbac437, 2022.
M. Dupont, N. Didier, M. J. Hodson, J. E. Moore, and M. J. Reagor, “Entanglement perspective on the quantum approximate optimization algorithm,” Phys. Rev. A, vol. 106, no. 2, p. 22423, 2022.
C. Outeiral, M. Strahm, J. Shi, G. M. Morris, S. C. Benjamin, and C. M. Deane, “The prospects of quantum computing in computational molecular biology,” Wiley Interdiscip. Rev. Comput. Mol. Sci., vol. 11, no. 1, p. e1481, 2021.
A. Ajagekar and F. You, “Quantum computing for energy systems optimization: Challenges and opportunities,” Energy, vol. 179, pp. 76–89, 2019.
M. Karimi-Mamaghan, M. Mohammadi, P. Meyer, A. M. Karimi-Mamaghan, and E.-G. Talbi, “Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: A state-of-the-art,” Eur. J. Oper. Res., vol. 296, no. 2, pp. 393–422, 2022.
Q. Wang and C. Tang, “Deep reinforcement learning for transportation network combinatorial optimization: A survey,” Knowledge-Based Syst., vol. 233, p. 107526, 2021.
T. L. Lei, “Large scale geospatial data conflation: A feature matching framework based on optimization and divide-and-conquer,” Comput. Environ. Urban Syst., vol. 87, p. 101618, 2021.
A. K. Jaiswal, “Investigation of quantum-inspired modelling in interactive search based on information foraging theory,” 2023.
M. CHERRADI and A. EL HADDADI, “Grover’s Algorithm for Data Lake Optimization Queries,” Int. J. Adv. Comput. Sci. Appl., vol. 13, no. 8, 2022.
P. Shrivastava, K. K. Soni, and A. Rasool, “Evolution of Quantum Computing Based on Grover’s Search Algorithm,” in 2019 10th International Conference on Computing, Communication and Networking Technologies (ICCCNT), IEEE, 2019, pp. 1–6.
C. Pati, “Search using Grover’s Algorithm,” 2023.
X.-S. Yang, “Nature-inspired optimization algorithms: Challenges and open problems,” J. Comput. Sci., vol. 46, p. 101104, 2020.
P. Hauke, H. G. Katzgraber, W. Lechner, H. Nishimori, and W. D. Oliver, “Perspectives of quantum annealing: Methods and implementations,” Reports Prog. Phys., vol. 83, no. 5, p. 54401, 2020.
M. Li et al., “Incremental potential contact: intersection-and inversion-free, large-deformation dynamics.,” ACM Trans. Graph., vol. 39, no. 4, p. 49, 2020.
P. P. Angara, U. Stege, H. A. Müller, and M. Bozzo-Rey, “Hybrid quantum-classical problem solving in the NISQ era,” in Proceedings of the 30th Annual International Conference on Computer Science and Software Engineering, 2020, pp. 247–252.
K. Fujii, K. Mizuta, H. Ueda, K. Mitarai, W. Mizukami, and Y. O. Nakagawa, “Deep Variational Quantum Eigensolver: a divide-and-conquer method for solving a larger problem with smaller size quantum computers,” PRX Quantum, vol. 3, no. 1, p. 10346, 2022.
L. Fan and Z. Han, “Hybrid quantum-classical computing for future network optimization,” IEEE Netw., vol. 36, no. 5, pp. 72–76, 2022.
X. Fu et al., “Quingo: A programming framework for heterogeneous quantum-classical computing with nisq features,” ACM Trans. Quantum Comput., vol. 2, no. 4, pp. 1–37, 2021.
Y. Shi et al., “Resource-efficient quantum computing by breaking abstractions,” Proc. IEEE, vol. 108, no. 8, pp. 1353–1370, 2020.
Z. Xin-gang, L. Ji, M. Jin, and Z. Ying, “An improved quantum particle swarm optimization algorithm for environmental economic dispatch,” Expert Syst. Appl., vol. 152, p. 113370, 2020.
F. S. Gharehchopogh, “Quantum-inspired metaheuristic algorithms: comprehensive survey and classification,” Artif. Intell. Rev., vol. 56, no. 6, pp. 5479–5543, 2023.
A. Sadeghi Hesar and M. Houshmand, “A memetic quantum-inspired genetic algorithm based on tabu search,” Evol. Intell., pp. 1–17, 2023.
S. Sengupta, S. Basak, and R. A. Peters, “Particle Swarm Optimization: A survey of historical and recent developments with hybridization perspectives,” Mach. Learn. Knowl. Extr., vol. 1, no. 1, pp. 157–191, 2018.
H. M. H. Saad, R. K. Chakrabortty, S. Elsayed, and M. J. Ryan, “Quantum-inspired genetic algorithm for resource-constrained project-scheduling,” IEEE Access, vol. 9, pp. 38488–38502, 2021.
A. Ajagekar, K. Al Hamoud, and F. You, “Hybrid classical-quantum optimization techniques for solving mixed-integer programming problems in production scheduling,” IEEE Trans. Quantum Eng., vol. 3, pp. 1–16, 2022.
K. K. Soni and A. Rasool, “Quantum Computation Based Grover’s Search Algorithm and its Variations,” Recent Patents Eng., vol. 15, no. 4, pp. 45–54, 2021.
E. Osaba et al., “A tutorial on the design, experimentation and application of metaheuristic algorithms to real-world optimization problems,” Swarm Evol. Comput., vol. 64, p. 100888, 2021.
J. Lang, S. Zielinski, and S. Feld, “Strategic portfolio optimization using simulated, digital, and quantum annealing,” Appl. Sci., vol. 12, no. 23, p. 12288, 2022.
E. K. Grant, “Benchmarks and Controls for Optimization with Quantum Annealing,” 2020.
M. Cerezo et al., “Variational quantum algorithms,” Nat. Rev. Phys., vol. 3, no. 9, pp. 625–644, 2021.
A. P. Adelomou, E. G. Ribe, and X. V. Cardona, “Using the Parameterized Quantum Circuit combined with Variational-Quantum-Eigensolver (VQE) to create an Intelligent social workers’ schedule problem solver,” arXiv Prepr. arXiv2010.05863, 2020.
A. Ajagekar, T. Humble, and F. You, “Quantum computing based hybrid solution strategies for large-scale discrete-continuous optimization problems,” Comput. Chem. Eng., vol. 132, p. 106630, 2020.
N. J. Guerrero, “Solving Combinatorial Optimization Problems using the Quantum Approximation Optimization Algorithm,” 2020.
S. Khairy, R. Shaydulin, L. Cincio, Y. Alexeev, and P. Balaprakash, “Learning to optimize variational quantum circuits to solve combinatorial problems,” in Proceedings of the AAAI conference on artificial intelligence, 2020, pp. 2367–2375.
W. Zhang, H. He, and S. Zhang, “A novel multi-stage hybrid model with enhanced multi-population niche genetic algorithm: An application in credit scoring,” Expert Syst. Appl., vol. 121, pp. 221–232, 2019.
S. Jerbi, L. M. Trenkwalder, H. P. Nautrup, H. J. Briegel, and V. Dunjko, “Quantum enhancements for deep reinforcement learning in large spaces,” PRX Quantum, vol. 2, no. 1, p. 10328, 2021.
M. H. Ullah, R. Eskandarpour, H. Zheng, and A. Khodaei, “Quantum computing for smart grid applications,” IET Gener. Transm. Distrib., vol. 16, no. 21, pp. 4239–4257, 2022.
G. Verdon, J. Pye, and M. Broughton, “A universal training algorithm for quantum deep learning,” arXiv Prepr. arXiv1806.09729, 2018.
N. Moll et al., “Quantum optimization using variational algorithms on near-term quantum devices,” Quantum Sci. Technol., vol. 3, no. 3, p. 30503, 2018.
R. D. M. Simões, P. Huber, N. Meier, N. Smailov, R. M. Füchslin, and K. Stockinger, “Experimental evaluation of quantum machine learning algorithms,” IEEE Access, vol. 11, pp. 6197–6208, 2023.
K. Egon, J. ROSINSKI, and L. KARL, “Quantum Machine Learning: The Confluence of Quantum Computing and AI,” 2023.
A. Saxena, J. Mancilla, I. Montalban, and C. Pere, Financial Modeling Using Quantum Computing: Design and manage quantum machine learning solutions for financial analysis and decision making. Packt Publishing Ltd, 2023.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 Saxena Smailov Egon, Angara Han Mizuta, Hamoud Osaba
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
