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

IEEE Latin American Conference on Computational Intelligence (LA-CCI)

A Propose of Genetic Operators for Quantum Algorithms with Real Representation

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

Published Nov 2, 2021• 2 citations
Publisher

Abstract

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.

DOI
10.1109/la-cci48322.2021.9769847

Related papers

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

Amgad M. Mohammed, Nancy El-Hefnawy, Mahmoud M. El-Sherbiny +1 more

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.

International Conference on Informatics and Systems•Jan 1, 2012•24 citations

On Comparison of Some Representations for the Evolution of Quantum Operators

Michal Bidlo, Petr Žufan

This paper presents a comparative study regarding the evolutionary design of quantum operators in the form of unitary matrices. Three different techniques allowing the generation of unitary matrices are investigated whose parameters are tuned by means of evolutionary algorithms. Such problem may be considered as a numerical optimisation task because the unitary matrices are represented by complex numbers with real-valued coefficients. Specifically, Genetic Algorithm and Evolution Strategy are applied, each in four different setups, and evaluated on three case studies: the 2-qubit Controlled-NOT gate, 3-qubit entanglement operator and 4-qubit detector of an element with the maximum amplitude. The evolutionary algorithms in combination with the given representation techniques are evaluated in order to determine the abilities of various experimental setups to solve the given tasks. The main contribution is the utilisation of QR decomposition, a technique for generating unitary matrices from theoretically any sequence of complex numbers, that has been applied for the first time in this paper for the evolution of quantum operators. It will be demonstrated that the QR decomposition exhibits a good performance especially in solving more complex quantum operators in comparison with other representations.

IEEE Symposium Series on Computational Intelligence (SSCI)•Dec 1, 2020•2 citations

Hybrid quantum genetic algorithms and performance analysis

Ling Wang

Quantum algorithm (QA) with updating of quantum gates and catastrophe of population is compared with quantum genetic algorithm (QGA) by including crossover and mutation for quantum bits. Furthermore, a framework of hybrid quantum GA is proposed which combines the quantum based search and classic genetic search, and hybrid QGA with binary encoding (BQGA) and hybrid QGA with real encoding (RQGA) are presented. Numerical simulation on typical problems show that the performances of RQGA are the best among all testing algorithms and it is much robust on parameters and initial conditions.

Kongzhi yu juece•Jan 1, 2005•14 citations

A Random search and Greedy selection based Genetic Quantum Algorithm for combinatorial optimization

R. S. Pavithr, Gursaran

Genetic Quantum Algorithm (GQA) is an evolutionary algorithm in the class of quantum inspired evolutionary algorithms inspired by the principles of quantum computing such as Q-bits, super position, quantum gates, interference and coherence. GQA adopts Q-bit representation and applies quantum rotation gate (QR gate) as genetic operator. The performance of the quantum inspired evolutionary algorithms largely depends upon the effectiveness of quantum gates applied as the genetic operator. Researchers have attempted to improve the performance of quantum inspired evolutionary algorithms by designing various quantum evolutionary operators using different strategies. In this paper, an effort is made to study the impact of Random search based QR gate strategy in GQA, and subsequently a Random search and greedy selection based Genetic Quantum Algorithm (RSGS-GQA) is proposed. The performance of RSGS-GQA algorithm is compared with the standard quantum inspired evolutionary algorithms (QIEA) on knapsack problem. The results indicate that, the RSGS-GQA algorithm performs better than the standard QIEA variants in terms of the quality of the solution and convergence.

IEEE Congress on Evolutionary Computation (CEC)•Jun 1, 2013•4 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

The Impact Of Quantum Computing In Evolutionary Algorithms

Djalila Belkebir, Abdelhai Lati, Malak Belkebir

Genetic algorithms are widely used for solving optimization problems. As the search space of the problem is augmented, the probability of falling into local minima will be augmented as well. Previous works showed that the adjusted phase (i.e. required modification per generation), may enhance badly the optimality reaching. Moreover, the search for suitable probabilities on crossover and mutation results in huge computational complexity. Recent developments in quantum technology have shown that quantum computers can provide a dramatic advantage over classical computers. This paper will be oriented toward computer scientists interested in the quantum genetic algorithm (QGA). Therefore, we will present a discussion, of the pros, and cons of classical GA. We survey the “state of the art” of the most known techniques for evolving evolutionary algorithms and quantum computing. We intend in this work to help researchers and application developers in gaining insights into the power of quantum computing mechanisms. This science can inherently treat the balance between exploration and exploitation of the search space. This property is due to the use of Q-bits. The orientation toward the best solution is due to the use of Q-gates.

International Conference on Decision Aid Sciences and Applications (DASA)•Sep 16, 2023•2 citations
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.
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.
This paper presents a comparative study regarding the evolutionary design of quantum operators in the form of unitary matrices. Three different techniques allowing the generation of unitary matrices are investigated whose parameters are tuned by means of evolutionary algorithms. Such problem may be considered as a numerical optimisation task because the unitary matrices are represented by complex numbers with real-valued coefficients. Specifically, Genetic Algorithm and Evolution Strategy are applied, each in four different setups, and evaluated on three case studies: the 2-qubit Controlled-NOT gate, 3-qubit entanglement operator and 4-qubit detector of an element with the maximum amplitude. The evolutionary algorithms in combination with the given representation techniques are evaluated in order to determine the abilities of various experimental setups to solve the given tasks. The main contribution is the utilisation of QR decomposition, a technique for generating unitary matrices from theoretically any sequence of complex numbers, that has been applied for the first time in this paper for the evolution of quantum operators. It will be demonstrated that the QR decomposition exhibits a good performance especially in solving more complex quantum operators in comparison with other representations.
Quantum algorithm (QA) with updating of quantum gates and catastrophe of population is compared with quantum genetic algorithm (QGA) by including crossover and mutation for quantum bits. Furthermore, a framework of hybrid quantum GA is proposed which combines the quantum based search and classic genetic search, and hybrid QGA with binary encoding (BQGA) and hybrid QGA with real encoding (RQGA) are presented. Numerical simulation on typical problems show that the performances of RQGA are the best among all testing algorithms and it is much robust on parameters and initial conditions.
Genetic Quantum Algorithm (GQA) is an evolutionary algorithm in the class of quantum inspired evolutionary algorithms inspired by the principles of quantum computing such as Q-bits, super position, quantum gates, interference and coherence. GQA adopts Q-bit representation and applies quantum rotation gate (QR gate) as genetic operator. The performance of the quantum inspired evolutionary algorithms largely depends upon the effectiveness of quantum gates applied as the genetic operator. Researchers have attempted to improve the performance of quantum inspired evolutionary algorithms by designing various quantum evolutionary operators using different strategies. In this paper, an effort is made to study the impact of Random search based QR gate strategy in GQA, and subsequently a Random search and greedy selection based Genetic Quantum Algorithm (RSGS-GQA) is proposed. The performance of RSGS-GQA algorithm is compared with the standard quantum inspired evolutionary algorithms (QIEA) on knapsack problem. The results indicate that, the RSGS-GQA algorithm performs better than the standard QIEA variants in terms of the quality of the solution and convergence.
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.
Genetic algorithms are widely used for solving optimization problems. As the search space of the problem is augmented, the probability of falling into local minima will be augmented as well. Previous works showed that the adjusted phase (i.e. required modification per generation), may enhance badly the optimality reaching. Moreover, the search for suitable probabilities on crossover and mutation results in huge computational complexity. Recent developments in quantum technology have shown that quantum computers can provide a dramatic advantage over classical computers. This paper will be oriented toward computer scientists interested in the quantum genetic algorithm (QGA). Therefore, we will present a discussion, of the pros, and cons of classical GA. We survey the “state of the art” of the most known techniques for evolving evolutionary algorithms and quantum computing. We intend in this work to help researchers and application developers in gaining insights into the power of quantum computing mechanisms. This science can inherently treat the balance between exploration and exploitation of the search space. This property is due to the use of Q-bits. The orientation toward the best solution is due to the use of Q-gates.