Purpose Following earlier claims that quantum‐inspired evolutionary algorithm (QIEA) may offer advantages in high‐dimensional environments, the purpose of this paper is to test a real‐valued QIEA on a series of benchmark functions of varying dimensionality in order to examine its scalability within both static and dynamic environments. Design/methodology/approach This paper compares the performance of both the QIEA and the canonical genetic algorithm (GA) on a series of test benchmark functions. Findings The results show that the QIEA obtains highly competitive results when benchmarked against the GA within static environments, while substantially outperforming both binary and real‐valued representation of the GA in terms of running time. Within dynamic environments, the QIEA outperforms GA in terms of stability and run time. Originality/value This paper suggests that QIEA has utility for real‐world high‐dimensional problems, particularly within dynamic environments, such as that found in real‐time financial trading.
Purpose Following earlier claims that quantum‐inspired evolutionary algorithm (QIEA) may offer advantages in high‐dimensional environments, the purpose of this paper is to test a real‐valued QIEA on a series of benchmark functions of varying dimensionality in order to examine its scalability within both static and dynamic environments. Design/methodology/approach This paper compares the performance of both the QIEA and the canonical genetic algorithm (GA) on a series of test benchmark functions. Findings The results show that the QIEA obtains highly competitive results when benchmarked against the GA within static environments, while substantially outperforming both binary and real‐valued representation of the GA in terms of running time. Within dynamic environments, the QIEA outperforms GA in terms of stability and run time. Originality/value This paper suggests that QIEA has utility for real‐world high‐dimensional problems, particularly within dynamic environments, such as that found in real‐time financial trading.
This paper presents a novel approach to complex optimization problems by integrating quantum-inspired concepts within an evolutionary algorithm framework. Traditional evolutionary algorithms, such as Genetic Algorithms and Differential Evolution, can struggle with high-dimensional and complex search spaces, often exhibiting slow convergence rates. We hypothesize that principles derived from quantum mechanics, specifically superposition and entanglement, can provide a more effective mechanism for exploring these spaces. Our proposed Quantum-Inspired Evolutionary Algorithm (QIEA) incorporates operators designed to mimic quantum interference and entanglement, allowing for a more nuanced and potentially faster exploration of the solution landscape. The core claim is that these quantum-inspired mechanisms can significantly enhance the efficiency of evolutionary optimization. The paper details the algorithm's design, including the implementation of interference and entanglement operators, and discusses its potential advantages and challenges. Experimental results (though not presented through dedicated experimental sections) demonstrate the algorithm's ability to outperform standard evolutionary algorithms on a range of benchmark problems.
Quantum-Inspired Evolutionary Algorithms (QIEAs) represent a novel fusion of quantum computing principles and classical evolutionary strategies, offering a powerful approach to solving complex optimization problems. This chapter provides a comprehensive overview, detailing foundational concepts, implementation techniques, and potential applications of QIEAs. By leveraging quantum phenomena such as superposition and entanglement, QIEAs enhance the exploitation and exploration capabilities of traditional evolutionary algorithms (EAs), thus enabling an efficient search of vast solution spaces. The study examines key components of QIEA, including quantum encoding, rotation gates, and entanglement operations, and compares its performance with classical EAs. By analyzing real-life examples of combinatorial optimization problems (COPs) such as the minimum spanning tree (MST), traveling salesman problem (TSP), and graph coloring, the chapter demonstrates QIEA’s superior efficiency and solution quality. Despite implementation challenges, QIEA shows promise in various domains, including machine learning, finance, healthcare, telecommunications, and e-commerce. Future research directions are outlined, emphasizing the need for simplified quantum-inspired operators, hybrid quantum-classical systems, and interdisciplinary collaboration. This chapter highlights the transformative potential of QIEA, setting the stage for further advancements and applications in optimization and computational efficiency.
We investigate two modified Quantum Evolutionary methods for solving real value problems. The Quantum Inspired Evolutionary Algorithms (QIEA) were originally used for solving binary encoded problems and their signature features follow superposition of multiple states on a quantum bit and a rotation gate. In order to apply this paradigm to real value problems, we propose two quantum methods Half Significant Bit (HSB) and Stepwise Real QEA (SRQEA), developed using binary and real encoding respectively, while keeping close to the original quantum computing metaphor. We evaluate our approaches against sets of multimodal mathematical test functions and real world problems, using five performance metrics and include comparisons to published results. We report the issues encountered while implementing some of the published real QIEA techniques. Our methods focus on introducing and implementing new rotation gate operators used for evolution, including a novel mechanism for preventing premature convergence in the binary algorithm. The applied performance metrics show superior results for our quantum methods on most of the test problems (especially for the more complex and challenging ones), demonstrating faster convergence and accuracy.
In this paper, a generalization of the original Quantum-Inspired Evolutionary Algorithm (QIEA): the Generalized Quantum-Inspired Evolutionary Algorithm (GQIEA) is proposed. Like QIEA, GQIEA is also based on the quantum computing principle of superposition of states, but extending it not only to be used for binary values {0, 1}, but for any finite set of values {1, n}. GQIEA, as any other quantum inspired evolutionary algorithm, defines an own quantum individual, an evaluation function and population operators. As in QIEA, GQIEA also defines a generalized Q-gate operator, which is a variation operator to drive the individuals toward better solutions. To demonstrate its effectiveness and applicability, the proposal will be applied to the Knapsack Problem (KP), a classic combinatorial optimization problem. Results show that GQIEA has a good performance even with a small population.
In the literature, there are many Quantum Inspired Evolutionary Algorithms (QIEA) that proved good performance and results when applied to solving a myriad of problems. However, the real quantum representation increases precision for numerical optimisation problems and reduces the memory storage need, alternatively to the binary representation. On the other hand, evolutionary algorithms' performance mainly depends on the crossover and mutation operators, reaching equilibrium between the explorative and exploitative features of evolutionary algorithms. This paper proposes new quantum genetic operators for real quantum representation, instead of the 1/5 rule present in AEIQ-R, to improve the performance of the quantum genetic algorithm with real representation. Three crossover and two mutation operators are proposed and tested to optimise four functions with different dimensions. Friedman's test indicated a significant difference between the combinations, and that combination composed of quantum arithmetic crossover and quantum creep mutation have the best performance.
The increasing complexity of artificial intelligence (AI) has created a need for effective optimisation of highdimensional, nonlinear, and computationally expensive problems. Quantum-inspired optimisation provides an alternative approach by employing quantum-inspired representations and search mechanisms within classical computing systems. This review examines major approaches, including Quantum-Inspired Evolutionary Algorithms (QIEA), Quantum-Inspired Genetic Algorithms (QIGA), Quantum-Inspired Particle Swarm Optimisation (QIPSO), quantum annealing-related approaches, and hybrid methods. Their applications in machine learning, feature selection, hyperparameter optimisation, reinforcement learning, healthcare, finance, cybersecurity, robotics, and smart manufacturing are reviewed. Particular emphasis is placed on solution quality, convergence behaviour, computational cost, scalability, robustness, and reproducibility. The review identifies inconsistent benchmarking, parameter sensitivity, computational overhead, and limited reproducibility as major challenges. The findings indicate that quantum-inspired optimisation should not be considered universally superior to classical optimisation, as its effectiveness depends on problem structure and evaluation conditions. Future research should focus on scalable, hybrid, explainable, and reproducible optimisation frameworks for realistic large-scale AI applications.