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 Congress on Evolutionary Computation (CEC)

Quantum Mating Operator: A New Approach to Evolve Chromosomes in Genetic Algorithms

Giovanni Acampora, Roberto Schiattarella, Autilia Vitiello

Published Jul 18, 2022• 7 citations
Publisher

Abstract

Genetic Algorithms (GAs) are optimization methods that search near-optimal solutions by applying well-known operations such as selection, crossover and mutation. In particular, crossover and mutation are aimed at creating new solutions from selected parents with the goal of discovering better and better solutions in the search space. In literature, several approaches have been defined to create new solutions from the mating pool to try to improve the performance of genetic optimization. In this paper, the literature is enriched by introducing a new mating operator that harnesses the stochastic nature of quantum computation to evolve individuals in a classical genetic workflow. This new approach, named Quantum Mating Operator, acts as a multi-parent operator that identifies alleles' frequency patterns from a collection of individuals selected by means of conventional selection operators, and encodes them through a quantum state. This state is successively mutated and measured to generate a new classical chromosome. As shown by experimental results, GAs equipped with the proposed operator outperform those equipped with traditional crossover and mutation operators when used to solve well-known benchmark functions.

DOI
10.1109/cec55065.2022.9870425

Related papers

Solving the Ising Problem by Noisy Quantum Genetic Algorithms

Giovanni Acampora, Giulio Minolfi, Roberto Schiattarella

Quantum Genetic Algorithms (QGAs) are emerging as a new class of algorithms that exploit the peculiarities of quantum computers to outperform classical evolutionary approaches in solving complex optimization problems. Despite the theoretical promises, their applicability has been strongly affected by the limitation of current noise-prone quantum hardware. It has only recently been demonstrated that acceptable levels of quantum noise can enhance the exploration capability of QGA in constrained optimization problems. The research corroborates the initial findings, providing further evidence of the efficacy of these algorithms by successfully resolving the NP-hard Ising Problem through the utilization of a QGA equipped with a quantum mating operator. The experimental results show that noisy simulations of QGA are capable of identifying better solutions than genetic algorithms that are equipped with state-of-the-art classical mating operators.

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

Quantum Entanglement Genetic Algorithm

Jincheng Zhang

This paper proposes a novel approach to optimization problems by integrating quantum entanglement with the Genetic Algorithm (GA). The core idea is to leverage the inherent parallelism and enhanced information transfer capabilities of quantum entanglement to significantly improve the search performance of the GA. We represent genetic algorithm chromosomes as quantum states and employ quantum entanglement to facilitate rapid information exchange and crossover operations across multiple qubits. This mechanism allows for parallel exploration of the search space, mitigating the limitations of traditional GA's tendency towards local optima. The theoretical framework and the underlying principles are presented, demonstrating the potential for the Quantum Entanglement Genetic Algorithm (QGA) to accelerate the solution of complex optimization problems. The algorithm's effectiveness is discussed through a mathematical formulation, focusing on the key components of the QGA and its advantages over conventional GA. The ultimate goal is to demonstrate a robust and efficient method for tackling challenging optimization tasks.

•Sep 7, 2026•0 citations

A Genetic Quantum Annealing Algorithm

Steven Adam Abel, Luca A. Nutricati, Michael Spannowsky

A genetic algorithm (GA) is a search-based optimization technique based on the principles of Genetics and Natural Selection. We present an algorithm which enhances the classical GA with input from quantum annealers. As in a classical GA, the algorithm works by breeding a population of possible solutions based on their fitness. However, the population of individuals is defined by the continuous couplings on the quantum annealer, which then give rise via quantum annealing to the set of corresponding phenotypes that represent attempted solutions. This introduces a form of directed mutation into the algorithm that can enhance its performance in various ways. Two crucial enhancements come from the continuous couplings having strengths that are inherited from the fitness of the parents (so-called nepotism) and from the annealer couplings allowing the entire population to be influenced by the fittest individuals (so-called quantum-polyandry). We find our algorithm to be significantly more powerful on several simple problems than a classical GA.

arXiv:2209.07455•Sep 15, 2022•3 citations

On the Effect of Quantum Noise in Quantum Genetic Algorithms

Giovanni Acampora, Roberto Schiattarella

In recent years, quantum computing is finding strong application in the development of new evolutionary algorithms. This is mainly due to the intrinsic parallelism induced by this new computational paradigm, which fits well with the structure of population-based optimization algorithms. However, the pioneering nature of quantum hardware makes quantum computations still suffer from noise that affects their accuracy and precision. This study aims to analyze the effect of this noise on quantum genetic algorithms and to quantify how much this can destroy or enhance the guided search of these algorithms in the search space. In detail, the proposed paper introduces a systematic study that assess the effects of quantum noise in a genetic algorithm equipped with a quantum recombination operator, formally known as the Quantum Mating Operator, when applied to solving a well-known optimization problem such as the 01 knapsack.

IEEE Congress on Evolutionary Computation (CEC)•Jul 1, 2023•4 citations

Quantum-Enhanced Genetic Algorithms for Complex Optimization

Jincheng Zhang

This paper presents a novel approach to complex optimization problems utilizing a hybrid Genetic Algorithm (GA) enhanced with quantum computing techniques. Classical GAs often struggle with slow convergence rates in high-dimensional search spaces. This research addresses this limitation by integrating quantum superposition and interference into the core operations of the GA, specifically crossover and mutation. The proposed method, termed Quantum-Enhanced Genetic Algorithm (Q-GA), aims to significantly accelerate the optimization process by exploring the solution space more efficiently. The core idea is to represent potential solutions within a quantum state, allowing for parallel exploration facilitated by superposition. We detail the architecture of the Q-GA, outlining the integration of classical GA components with quantum algorithms. The performance of the Q-GA is theoretically analyzed, focusing on the potential speedup achievable through quantum computation. The results presented demonstrate the promise of this hybrid approach for tackling computationally intensive optimization problems where classical GAs fall short.

•Sep 6, 2026•0 citations
Genetic Algorithms (GAs) are optimization methods that search near-optimal solutions by applying well-known operations such as selection, crossover and mutation. In particular, crossover and mutation are aimed at creating new solutions from selected parents with the goal of discovering better and better solutions in the search space. In literature, several approaches have been defined to create new solutions from the mating pool to try to improve the performance of genetic optimization. In this paper, the literature is enriched by introducing a new mating operator that harnesses the stochastic nature of quantum computation to evolve individuals in a classical genetic workflow. This new approach, named Quantum Mating Operator, acts as a multi-parent operator that identifies alleles' frequency patterns from a collection of individuals selected by means of conventional selection operators, and encodes them through a quantum state. This state is successively mutated and measured to generate a new classical chromosome. As shown by experimental results, GAs equipped with the proposed operator outperform those equipped with traditional crossover and mutation operators when used to solve well-known benchmark functions.
Quantum Genetic Algorithms (QGAs) are emerging as a new class of algorithms that exploit the peculiarities of quantum computers to outperform classical evolutionary approaches in solving complex optimization problems. Despite the theoretical promises, their applicability has been strongly affected by the limitation of current noise-prone quantum hardware. It has only recently been demonstrated that acceptable levels of quantum noise can enhance the exploration capability of QGA in constrained optimization problems. The research corroborates the initial findings, providing further evidence of the efficacy of these algorithms by successfully resolving the NP-hard Ising Problem through the utilization of a QGA equipped with a quantum mating operator. The experimental results show that noisy simulations of QGA are capable of identifying better solutions than genetic algorithms that are equipped with state-of-the-art classical mating operators.
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.
This paper proposes a novel approach to optimization problems by integrating quantum entanglement with the Genetic Algorithm (GA). The core idea is to leverage the inherent parallelism and enhanced information transfer capabilities of quantum entanglement to significantly improve the search performance of the GA. We represent genetic algorithm chromosomes as quantum states and employ quantum entanglement to facilitate rapid information exchange and crossover operations across multiple qubits. This mechanism allows for parallel exploration of the search space, mitigating the limitations of traditional GA's tendency towards local optima. The theoretical framework and the underlying principles are presented, demonstrating the potential for the Quantum Entanglement Genetic Algorithm (QGA) to accelerate the solution of complex optimization problems. The algorithm's effectiveness is discussed through a mathematical formulation, focusing on the key components of the QGA and its advantages over conventional GA. The ultimate goal is to demonstrate a robust and efficient method for tackling challenging optimization tasks.
A genetic algorithm (GA) is a search-based optimization technique based on the principles of Genetics and Natural Selection. We present an algorithm which enhances the classical GA with input from quantum annealers. As in a classical GA, the algorithm works by breeding a population of possible solutions based on their fitness. However, the population of individuals is defined by the continuous couplings on the quantum annealer, which then give rise via quantum annealing to the set of corresponding phenotypes that represent attempted solutions. This introduces a form of directed mutation into the algorithm that can enhance its performance in various ways. Two crucial enhancements come from the continuous couplings having strengths that are inherited from the fitness of the parents (so-called nepotism) and from the annealer couplings allowing the entire population to be influenced by the fittest individuals (so-called quantum-polyandry). We find our algorithm to be significantly more powerful on several simple problems than a classical GA.
In recent years, quantum computing is finding strong application in the development of new evolutionary algorithms. This is mainly due to the intrinsic parallelism induced by this new computational paradigm, which fits well with the structure of population-based optimization algorithms. However, the pioneering nature of quantum hardware makes quantum computations still suffer from noise that affects their accuracy and precision. This study aims to analyze the effect of this noise on quantum genetic algorithms and to quantify how much this can destroy or enhance the guided search of these algorithms in the search space. In detail, the proposed paper introduces a systematic study that assess the effects of quantum noise in a genetic algorithm equipped with a quantum recombination operator, formally known as the Quantum Mating Operator, when applied to solving a well-known optimization problem such as the 01 knapsack.
This paper presents a novel approach to complex optimization problems utilizing a hybrid Genetic Algorithm (GA) enhanced with quantum computing techniques. Classical GAs often struggle with slow convergence rates in high-dimensional search spaces. This research addresses this limitation by integrating quantum superposition and interference into the core operations of the GA, specifically crossover and mutation. The proposed method, termed Quantum-Enhanced Genetic Algorithm (Q-GA), aims to significantly accelerate the optimization process by exploring the solution space more efficiently. The core idea is to represent potential solutions within a quantum state, allowing for parallel exploration facilitated by superposition. We detail the architecture of the Q-GA, outlining the integration of classical GA components with quantum algorithms. The performance of the Q-GA is theoretically analyzed, focusing on the potential speedup achievable through quantum computation. The results presented demonstrate the promise of this hybrid approach for tackling computationally intensive optimization problems where classical GAs fall short.