Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Conference on Informatics and Systems

Quantum crossover based quantum genetic algorithm for solving non-linear programming

Amgad M. Mohammed, Nancy El-Hefnawy, Mahmoud M. El-Sherbiny, Mohiy Mohammed Hadhoud

Published Jan 1, 2012• 24 citations
OpenAlex

Abstract

Quantum computing proved good results and performance when applied to solving optimization problems. This paper proposes a quantum crossover-based quantum genetic algorithm (QXQGA) for solving non-linear programming. Due to the significant role of mutation function on the QXQGA's quality, a number of quantum crossover and quantum mutation operators are presented for improving the capabilities of searching, overcoming premature convergence, and keeping diversity of population. For calibrating the QXQGA, the quantum crossover and mutation operators are evaluated using relative percentage deviation for selecting the best combination. In addition, a set of non-linear problems is used as benchmark functions to illustrate the effectiveness of optimizing the complexities with different dimensions, and the performance of the proposed QXQGA algorithm is compared with the quantum inspired evolutionary algorithm to demonstrate its superiority.

Related papers

A Propose of Genetic Operators for Quantum Algorithms with Real Representation

Eduardo Dessupoio Moreira Dias, Marley M. B. R. Vellasco

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.

IEEE Latin American Conference on Computational Intelligence (LA-CCI)•Nov 2, 2021•2 citations

Genetic quantum algorithm and its application to combinatorial optimization problem

Kuk-Hyun Han, Jong-Hwan Kim

This paper proposes a novel evolutionary computing method called a genetic quantum algorithm (GQA). GQA is based on the concept and principles of quantum computing such as qubits and superposition of states. Instead of binary, numeric, or symbolic representation, by adopting qubit chromosome as a representation GQA can represent a linear superposition of solutions due to its probabilistic representation. As genetic operators, quantum gates are employed for the search of the best solution. Rapid convergence and good global search capability characterize the performance of GQA. The effectiveness and the applicability of GQA are demonstrated by experimental results on the knapsack problem, which is a well-known combinatorial optimization problem. The results show that GQA is superior to other genetic algorithms using penalty functions, repair methods and decoders.

IEEE Congress on Evolutionary Computation (CEC)•Nov 7, 2002•679 citations

A Gate-Based Quantum Genetic Algorithm for Real-Valued Global Optimization

Leandro C. Souza, Laurent E. Dardenne, Renato Portugal

We propose a gate-based Quantum Genetic Algorithm (QGA) for real-valued global optimization. In this model, individuals are represented by quantum circuits whose measurement outcomes are decoded into real-valued vectors through binary discretization. Evolutionary operators act directly on circuit structures, allowing mutation and crossover to explore the space of gate-based encodings. Both fixed-depth and variable-depth variants are introduced, enabling either uniform circuit complexity or adaptive structural evolution. Fitness is evaluated through quantum sampling, using the mean decoded output of measurement outcomes as the argument of the objective function. To isolate the impact of quantum resources, we compare gate sets with and without the Hadamard gate, showing that superposition consistently improves convergence and robustness across benchmark functions such as the Rastrigin function. Furthermore, we demonstrate that introducing pairwise inter-individual entanglement in the population accelerates early convergence, revealing that quantum correlations among individuals provide an additional optimization advantage. Together, these results show that both superposition and entanglement enhance the search dynamics of evolutionary quantum algorithms, establishing gate-based QGAs as a promising framework for quantum-enhanced global optimization.

quant-pharXiv:2511.05254•Nov 10, 2025•0 citations

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, 2026•0 citations

A Novel Improved Quantum Genetic Algorithm for Combinatorial Optimization Problems

Xihua Zou

Based on quantum genetic algorithm(QGA),a novel improved quantum genetic algorithm(NIQGA)to solve combinatorial optimization problem is proposed.To make full use of interference and entanglement characteristics of quantum state,dynamic step length in adjustment of angle of quantum gate,quantum crossover operation and quantum mutation operation are introduced,therefore high efficiency for optimization is achieved.Two typical combinatorial optimization problems—0/1 knapsack problem and route selection problem,are adopted to confirm the performance of NIQGA.Experimental results show that compared with GA and QGA,NIQGA is characterized by fast convergence rate and excellent capability on global optimization,especially better performance for combinatorial optimization problem with less correlation of genes.

Dianzi xuebao•Jan 1, 2007•15 citations

A genetic algorithm based on quantum chromosome

Shuyuan Yang, Min Wang, Licheng Jiao

In this paper, we propose a novel genetic algorithm based on the quantum chromosome - QGA. We adopt quantum chromosome to represent a linear superposition of solutions, after the observation that simulates the quantum collapse. The algorithm has better diversity than its counterpart. In addition, the quantum evolutionary operator - quantum mutation is constructed, which is used to speed up the convergence. Rapid convergence and global search capacity characterize the performance of QGA. The paper also gives some simulation experiments to prove its superiority over the classical genetic algorithm.

International Conference on Signal Processing•Jun 28, 2005•20 citations
Quantum computing proved good results and performance when applied to solving optimization problems. This paper proposes a quantum crossover-based quantum genetic algorithm (QXQGA) for solving non-linear programming. Due to the significant role of mutation function on the QXQGA's quality, a number of quantum crossover and quantum mutation operators are presented for improving the capabilities of searching, overcoming premature convergence, and keeping diversity of population. For calibrating the QXQGA, the quantum crossover and mutation operators are evaluated using relative percentage deviation for selecting the best combination. In addition, a set of non-linear problems is used as benchmark functions to illustrate the effectiveness of optimizing the complexities with different dimensions, and the performance of the proposed QXQGA algorithm is compared with the quantum inspired evolutionary algorithm to demonstrate its superiority.
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.
This paper proposes a novel evolutionary computing method called a genetic quantum algorithm (GQA). GQA is based on the concept and principles of quantum computing such as qubits and superposition of states. Instead of binary, numeric, or symbolic representation, by adopting qubit chromosome as a representation GQA can represent a linear superposition of solutions due to its probabilistic representation. As genetic operators, quantum gates are employed for the search of the best solution. Rapid convergence and good global search capability characterize the performance of GQA. The effectiveness and the applicability of GQA are demonstrated by experimental results on the knapsack problem, which is a well-known combinatorial optimization problem. The results show that GQA is superior to other genetic algorithms using penalty functions, repair methods and decoders.
We propose a gate-based Quantum Genetic Algorithm (QGA) for real-valued global optimization. In this model, individuals are represented by quantum circuits whose measurement outcomes are decoded into real-valued vectors through binary discretization. Evolutionary operators act directly on circuit structures, allowing mutation and crossover to explore the space of gate-based encodings. Both fixed-depth and variable-depth variants are introduced, enabling either uniform circuit complexity or adaptive structural evolution. Fitness is evaluated through quantum sampling, using the mean decoded output of measurement outcomes as the argument of the objective function. To isolate the impact of quantum resources, we compare gate sets with and without the Hadamard gate, showing that superposition consistently improves convergence and robustness across benchmark functions such as the Rastrigin function. Furthermore, we demonstrate that introducing pairwise inter-individual entanglement in the population accelerates early convergence, revealing that quantum correlations among individuals provide an additional optimization advantage. Together, these results show that both superposition and entanglement enhance the search dynamics of evolutionary quantum algorithms, establishing gate-based QGAs as a promising framework for quantum-enhanced global optimization.
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. ---
Based on quantum genetic algorithm(QGA),a novel improved quantum genetic algorithm(NIQGA)to solve combinatorial optimization problem is proposed.To make full use of interference and entanglement characteristics of quantum state,dynamic step length in adjustment of angle of quantum gate,quantum crossover operation and quantum mutation operation are introduced,therefore high efficiency for optimization is achieved.Two typical combinatorial optimization problems—0/1 knapsack problem and route selection problem,are adopted to confirm the performance of NIQGA.Experimental results show that compared with GA and QGA,NIQGA is characterized by fast convergence rate and excellent capability on global optimization,especially better performance for combinatorial optimization problem with less correlation of genes.
In this paper, we propose a novel genetic algorithm based on the quantum chromosome - QGA. We adopt quantum chromosome to represent a linear superposition of solutions, after the observation that simulates the quantum collapse. The algorithm has better diversity than its counterpart. In addition, the quantum evolutionary operator - quantum mutation is constructed, which is used to speed up the convergence. Rapid convergence and global search capacity characterize the performance of QGA. The paper also gives some simulation experiments to prove its superiority over the classical genetic algorithm.