Journal of Computer Science and Research (JoCoSiR)

Quantum-inspired search algorithms for optimizing complex systems

Saxena Smailov Egon, Angara Han Mizuta, Hamoud Osaba

Published Nov 30, 2023• 0 citations

Abstract

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.

DOI: 10.65126/jocosir.v1i4.30

Related papers

Quantum-Inspired Genetic Algorithm for Complex Optimization Problems

Jincheng Zhang

This paper explores the application of a quantum-inspired genetic algorithm (QIGA) for solving complex optimization problems. Traditional genetic algorithms (GAs) can struggle with the intricacies of high-dimensional and non-linear problems, often encountering issues with premature convergence and local optima. This research proposes a novel approach where a standard GA is modified to incorporate principles inspired by quantum mechanics, specifically utilizing quantum-inspired concepts such as superposition and interference, to enhance the exploration and exploitation phases. The core claim is that QIGA can effectively tackle complex optimization scenarios. The mechanism involves mapping the original problem into the fitness function of the GA, and subsequently using the QIGA to perform the optimization. The results demonstrate the potential of this hybrid approach to improve solution quality and speed, particularly in problems with challenging characteristics. The research highlights a promising direction for combining classical optimization techniques with quantum-inspired ideas, offering a new tool for tackling computationally intensive optimization tasks. ---

Sep 3, 20260 citations

Quantum-Inspired Optimization Design Based on Quantum Genetic Algorithm

Jincheng Zhang

This paper presents a novel approach to optimization design leveraging the principles of quantum mechanics, specifically superposition and entanglement, through a Quantum Genetic Algorithm (QGA). Traditional Genetic Algorithms (GAs) face challenges in complex, high-dimensional optimization problems due to the exponential growth of the search space. The QGA aims to mitigate these limitations by encoding genetic information into quantum states and utilizing quantum operations for selection, crossover, and mutation. This approach theoretically utilizes quantum superposition to explore multiple solution possibilities simultaneously and quantum entanglement to correlate solutions, potentially leading to faster convergence and improved optimization performance. The paper outlines the theoretical framework, the algorithmic steps of the QGA, and discusses potential applications. The primary contribution is the conceptual framework and the proposed method, recognizing the nascent stage of QGA research and presenting a novel exploration of its potential.

Aug 31, 20260 citations

EAQGA: A Quantum-Enhanced Genetic Algorithm with Novel Entanglement-Aware Crossovers

Mohammad Kashfi Haghighi, Matthieu Fortin-Deschênes, Christophe Père +1 more

Genetic algorithms are highly effective optimization techniques for many computationally challenging problems, including combinatorial optimization tasks like portfolio optimization. Quantum computing has also shown potential in addressing these complex challenges. Combining these approaches, quantum genetic algorithms leverage the principles of superposition and entanglement to enhance the performance of classical genetic algorithms. In this work, we propose a novel quantum genetic algorithm introducing an innovative crossover strategy to generate quantum circuits from a binary solution. We incorporate a heuristic method to encode entanglement patterns from parent solutions into circuits for the next generation. Our algorithm advances quantum genetic algorithms by utilizing a limited number of entanglements, enabling efficient exploration of optimal solutions without significantly increasing circuit depth, making it suitable for near-term applications. We test this approach on a portfolio optimization problem using an IBM 127 qubits Eagle processor (ibm_quebec) and simulators. Compared to state-of-the-art algorithms, our results show that the proposed method improves fitness values by 33.6% over classical genetic algorithm and 37.2% over quantum-inspired genetic algorithm, using the same iteration counts and population sizes with real quantum hardware employing 100 qubits. These findings highlight the potential of current quantum computers to address real-world utility-scale combinatorial optimization problems.

arXiv:2504.17923Apr 24, 20250 citations

Quantum-Inspired Genetic Algorithms for Large-Scale Optimization

Andrei Popescu

Large-scale optimization (LSO) problems—those with hundreds to thousands of decision variables—are prevalent in engineering design, logistics, telecommunications, and machine learning hyperparameter search. Classical evolutionary algorithms often struggle in this regime due to premature convergence and prohibitive search costs. This manuscript presents a Quantum-Inspired Genetic Algorithm (QIGA) that transfers three ideas from quantum computation into a purely classical algorithm: (i) Q-bit angle encoding that maintains a compact, uncertainty-aware distribution over decision values, (ii) rotation-gate adaptation that updates search probabilities toward promising regions while preserving exploration, and (iii) quantum observation that draws diverse candidate solutions from the encoded amplitudes at each generation. We further couple the core QIGA with (a) an island-model decomposition for ultra-high dimensionality, (b) surrogate-assisted local refinement for exploitation at low cost, and (c) a feasibility-aware penalty for constraints. We evaluate the approach on five canonical continuous benchmarks in 1,000 dimensions (Sphere, Rosenbrock, Rastrigin, Ackley, Griewank) under a fixed computational budget. Across 30 independent runs per function, QIGA achieves lower final objective values and higher success rates than classical GA, PSO, and DE baselines. A non-parametric Wilcoxon signed-rank test indicates statistically significant improvements for QIGA (adjusted p < 0.01) on all functions. We analyze the algorithm’s scaling behavior, the role of angle-space step control, and the contribution of island-level diversity. The results suggest that quantum-inspired probability evolution provides a robust inductive bias for LSO by decoupling representation capacity from point estimates and by enabling distribution-aware search moves. We conclude with practical guidelines for tuning and discuss extensions to constrained and mixed-variable problems.

International Journal of Advanced Research in Computer Science and EngineeringApr 4, 20260 citations

Quantum-Inspired Genetic Algorithms for Complex Optimization Problems

Jincheng Zhang

This paper investigates the application of quantum-inspired concepts within a genetic algorithm framework to address complex optimization challenges. Traditional genetic algorithms often struggle with slow convergence rates when dealing with intricate problem landscapes. We propose a novel approach that incorporates superposition and entanglement, mimicking key principles from quantum mechanics, into the genetic algorithm's operator design. The core idea is to leverage the ability of quantum systems to explore multiple possibilities simultaneously, thereby accelerating the search for optimal solutions. The algorithm's performance is evaluated against established genetic algorithms on a series of benchmark problems. The results demonstrate the potential of this quantum-inspired approach to significantly improve convergence speed and overall efficiency in tackling complex optimization tasks. Specifically, we analyze the impact of these operators on population diversity and the algorithm's ability to escape local optima. The paper concludes with a discussion of future research directions and potential applications of this hybrid algorithm.

Sep 2, 20260 citations

Quantum-Inspired Genetic Algorithms for Optimization

Jincheng Zhang

This paper explores the integration of quantum mechanical principles into genetic algorithms (GAs) to enhance their optimization capabilities. Traditional GAs operate based on classical probabilistic models, while this research proposes a novel approach that leverages concepts like superposition and tunneling to improve selection and crossover processes. The core idea is to mimic quantum phenomena within the GA framework, potentially leading to faster convergence and improved solutions for complex optimization problems. We detail the implementation of these quantum-inspired operators and present a theoretical framework for their application. The evaluation focuses on demonstrating the potential benefits of this hybrid approach through a series of simulated scenarios. The results suggest that incorporating quantum-inspired techniques can significantly improve the efficiency of the GA, particularly in situations with high dimensionality and intricate search spaces. This work represents a significant step toward bridging the gap between classical and quantum optimization paradigms.

Aug 28, 20260 citations