Advanced Quantum Technologies

Quantum‐Enhanced Genetic Algorithm for Quantum Neural Network Optimization

Kehan Chen, Yixi Wei, Fei Yan

Published Aug 1, 2026• 0 citations

Abstract

ABSTRACT This work proposes a Quantum Enhanced Genetic Algorithm (QEGA) that synergistically integrates three quantum‐inspired operators: a Grover adaptive search‐based selection mechanism, a swap test‐guided crossover scheme, and a quantum walk‐driven mutation process. By harnessing quantum amplitude amplification, entanglement recombination, and probabilistic exploration, QEGA pioneers the integration of quantum computational advantages into evolutionary optimization for quantum neural network parameters. The algorithm enhances global search effectiveness while accelerating convergence and exhibiting robust resistance to local optima. Experimental results on three benchmark datasets, i.e., Iris, the plane point set, and MNIST binary classification, demonstrate that QEGA outperforms classical genetic algorithms and quantum optimization algorithms from recent studies by a substantial margin on classification tasks. Specifically, it attains a peak accuracy of 98.67%, 99.16%, and 98.00% on the three datasets, respectively, accompanied by consistently smooth and monotonic convergence behaviors across the evaluated trials. These findings validate QEGA's potential as a versatile optimization framework for quantum neural network training and highlight the broader promise of quantum‐enhanced evolutionary computation in practical machine learning applications.

DOI: 10.1002/qute.70394

Related papers

Genetic AI Algorithms for Multi-Objective Optimization in Quantum Systems

Dr Chethan H N

Multi‐objective optimization in quantum systems poses formidable challenges stemming from the high dimensionality, complex constraints, and conflicting performance metrics inherent to quantum control tasks and circuit synthesis. This study presents a comprehensive exploration of genetic AI algorithms—evolutionary strategies inspired by natural selection—tailored specifically for multi‐objective optimization in quantum computing contexts. We propose a hybrid framework that synergistically combines the elitist, Pareto‐based selection mechanics of NSGA-II with quantum‐inspired crossover and mutation operators designed to preserve entanglement structures and exploit hardware‐specific gate sets. In this framework, candidate solutions encoding circuit topologies or control‐pulse parameters undergo iterative evolution, guided by fitness vectors that balance gate fidelity, circuit depth, and resource overhead. To benchmark performance, we apply the algorithm to canonical quantum computing problems: Fourier transform circuits, QAOA ansätze for MaxCut instances, and random Clifford+T circuits. Through extensive simulation on noise-modelled quantum devices, we evaluate Pareto front coverage, convergence speed, diversity maintenance, and robustness under decoherence. Our results demonstrate that the proposed genetic AI algorithm outperforms classical single‐objective genetic methods and established multi‐objective evolutionary algorithms (e.g., SPEA2) by achieving broader Pareto fronts and faster convergence rates, while maintaining solution diversity. Furthermore, noise-resilience experiments show graceful degradation, indicating practical applicability on near-term quantum hardware. These findings substantiate the potential of evolutionary computation paradigms—augmented with quantum‐inspired operators—to address the intricate trade-off surfaces that define NISQ-era optimization problems, paving the way toward automated quantum circuit design and control parameter tuning for real-world quantum computing applications.

World Journal of Future Technologies in Computer Science and EngineeringJul 3, 20260 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.05254Nov 10, 20250 citations

Quantum-Inspired Evolutionary Algorithms for Optimization

Jincheng Zhang

This paper investigates the potential of incorporating quantum mechanical concepts into evolutionary algorithms (EAs) to improve their optimization capabilities. Traditional EAs, while effective, often struggle with complex search spaces and can get trapped in local optima. We propose a framework for developing quantum-inspired EAs that leverages principles such as superposition and entanglement to enhance exploration and exploitation strategies. The core idea is to introduce probabilistic operators and adaptive parameter control mimicking quantum behaviors. We present a detailed description of the proposed algorithm, focusing on the mathematical formulation of the key components, including the representation of solutions, the selection process, and the mutation operator. The algorithm's performance is evaluated on several benchmark optimization problems, demonstrating its potential to outperform conventional EAs in scenarios demanding high accuracy and rapid convergence. Furthermore, we analyze the theoretical implications of this approach, highlighting the advantages derived from quantum-inspired mechanisms. This work contributes to the ongoing research at the intersection of evolutionary computation and quantum information theory, offering a novel approach to tackling complex optimization challenges.

Sep 3, 20260 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, 20260 citations

Quantum-Inspired Optimization of Neural Network Architecture

Jincheng Zhang

This paper explores a novel approach to neural network architecture optimization inspired by quantum superposition and measurement. Traditional neural network architecture search methods, such as reinforcement learning or evolutionary algorithms, often suffer from computational bottlenecks and slow convergence rates. We propose a genetic algorithm that leverages quantum-inspired probability amplitudes to represent and evaluate neural network architectures. Each architecture is assigned a set of probability amplitudes, reflecting the potential for success. Through a simulated measurement process, the algorithm dynamically adjusts these amplitudes, favoring architectures with higher potential and accelerating the search for optimal configurations. The core idea is that quantum superposition allows us to explore a vast solution space concurrently, while the measurement process mimics the collapse of the wave function, focusing the search on promising candidates. This approach demonstrates the potential to significantly reduce the time and resources required for neural network architecture design, paving the way for more efficient and powerful deep learning models. We present a detailed theoretical framework and outline the key components of the algorithm, emphasizing its ability to mimic quantum phenomena for architectural optimization.

Aug 31, 20260 citations

Based on Genetic Algorithm for Quantum Circuit Optimization

Jincheng Zhang

This paper explores the application of genetic algorithms (GAs) to optimize quantum circuits. The core claim is that GA can effectively improve the efficiency and accuracy of quantum computation by strategically modifying the topology and control parameters of quantum circuits. The proposed mechanism treats a quantum circuit as a genetic individual, leveraging the principles of genetic algorithms – including crossover, mutation, and selection – to iteratively enhance circuit performance. This approach represents a novel method for quantum circuit optimization, offering a potentially robust and adaptable solution compared to traditional optimization techniques. We present a framework for implementing this approach, focusing on the algorithmic steps and considerations for successful application. The exploration will cover the challenges and potential benefits of integrating evolutionary algorithms with the unique characteristics of quantum computation. ---

Sep 5, 20260 citations