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

World Journal of Future Technologies in Computer Science and Engineering

Genetic AI Algorithms for Multi-Objective Optimization in Quantum Systems

Dr Chethan H N

Published Jul 3, 2026• 0 citations
OpenAlex

Abstract

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.

Related papers

Noise Resilient Quantum Circuit Design by Multi-Objective Genetic Algorithm

Christian Wood, Alberto Moraglio

Designing quantum circuits is a major challenge due to their sensitivity to noise and the complexity of quantum logic. This paper presents an evolutionary algorithm that balances multiple design criteria, namely fidelity and circuit depth, by combining them into a single scalarised fitness function. This approach enables efficient optimisation while avoiding the computational cost of fully multi-objective methods. A novel circuit representation and set of noise-aware genetic operators are introduced, and the technique is applied to evolve implementations of the Quantum Fourier Transform (QFT) for two- and three-qubit systems. Experimental results show that evolved circuits match or exceed ideal fidelity and outperform textbook QFT implementations under simulated noise. These findings highlight the potential of hardware-aware evolutionary design for producing circuits that are both accurate and resilient on near-term quantum hardware.

Genetic and Evolutionary Computation Conference Companion (GECCO Companion)•Jul 14, 2025•0 citations

Scalable multi-objective genetic algorithm for quantum circuit optimization

Roumaissa Ghlib, Rania Bouhadouza, Faicel Hnaien

Abstract Designing compact and efficient quantum circuits that are compatible with Noisy Intermediate-Scale Quantum (NISQ) hardware remains a central challenge in quantum computing. Most existing optimization approaches rely on fidelity-based fitness functions that require computing the full unitary matrix of the circuit. However, this quickly becomes computationally intractable beyond 10–12 qubits due to the exponential memory and time complexity $$O(2^{2n})$$ . In this work, we propose a scalable multi-objective genetic algorithm for quantum circuit optimization tailored to NISQ devices. Although evolutionary algorithms have demonstrated strong potential for circuit synthesis, current methods generally depend on full-unitary fidelity evaluation, which severely limits scalability. To address this bottleneck, we introduce two complementary strategies: (1) an independent block-based evaluation using graph partitioning, and (2) an overlapping sliding-window decomposition approach. Both strategies reduce computational complexity from $$O(2^{2n})$$ to $$O(2^{2k})$$ , where $$k \ll n$$ , making it possible to optimize circuits with more than 20 qubits in practice. Our methods are integrated into the NSGA-II multi-objective framework, enabling simultaneous optimization of fidelity, circuit depth, and gate cost, while maintaining structural compatibility with NISQ hardware–without requiring full-unitary simulation. Experimental results on benchmark circuits demonstrate high fidelity (above 0.94 for small circuits up to 8 qubits, above 0.85 for medium-scale circuits of 10–16 qubits, and above 0.80 for large-scale circuits up to 32 qubits), up to $$45\%$$ reduction in circuit depth, and a $$10\times$$ speedup compared to exact evaluation at 14 qubits.

Scientific Reports•Apr 18, 2026•0 citations

QAGO: evolving quantumness through genetic optimization of quantum circuits

Kavitha Yogaraj, Brian Quanz, Sahil Agrawal +2 more

Abstract Designing expressive yet hardware-efficient quantum circuits remains a central challenge in quantum machine learning (QML). Existing approaches to quantum circuit synthesis primarily optimize for classical performance metrics, often overlooking intrinsic quantum characteristics that govern circuit quality and generalization. This work introduces a quantumness-aware genetic optimization (QAGO) framework for circuit synthesis that integrates quantum properties such as entanglement and non-Clifford gate utilization into the evolutionary design process. We formulate circuit synthesis as both a single-objective optimization (SOO) and a multi-objective optimization (MOO) problem within a genetic framework. The SOO formulation explores quantumness-aware objectives balancing predictive performance and circuit-level quantum structure, while the MOO formulation approximates Pareto-efficient trade-offs between these goals. This dual perspective enables systematic analysis of how increasing quantum expressivity influences predictive behavior and resource cost. Experimental evaluations across three quantum kernel-based algorithms include quantum support vector machines, quantum kernel trainers, and projected quantum kernels demonstrate that circuits evolved under quantumness-aware objectives consistently outperform baseline kernel circuits such as ZZFeatureMap. Comprehensive benchmarking against classical baselines shows that QAGO achieves up to 2.5% area under the ROC curve improvement on the Higgs Boson dataset and 1.5%–9.2% gains across six of nine targets in the LIT-PCBA drug discovery benchmark. Compared to prior work (Wu et al 2021 J. Phys. G: Nucl. Part. Phys. 48 125003, Mensa et al 2023 Mach. Learn.: Sci. Technol. 4 015023) QAGO yields up to 4% improvement on Higgs and 5%–20% gains across eight of nine targets. These results provide quantitative evidence that optimizing for quantumness enhances both performance and quantum expressivity of QML models, establishing QAGO as a principled framework for quantumness-aware circuit evolution.

Quantum Science and Technology•May 8, 2026•0 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 search algorithms for optimizing complex systems

Saxena Smailov Egon, Angara Han Mizuta, Hamoud Osaba

This research explores the application of a Quantum-Inspired Genetic Algorithm (QIGA) to optimize complex systems, utilizing a numerical experiment with a focus on the objective function... The QIGA integrates quantum-inspired principles, including crossover, entanglement, and evolution, to strike a balance between exploration and exploitation within the solution space. A 100-generation experiment with a population size of 50 reveals the algorithm's adaptability and gradual convergence towards optimal solutions. The linear combination crossover, guided by quantum principles, enhances diversity, while entanglement and evolution operations introduce correlations between quantum states. The results underscore the algorithm's potential, prompting discussions on parameter tuning, comparisons with classical algorithms, and considerations for transitioning to real quantum hardware. The findings contribute to the understanding of quantum-inspired optimization and pave the way for further research in quantum computing applications for complex system optimization.

Journal of Computer Science and Research (JoCoSiR)•Nov 30, 2023•0 citations

Quantum Selection for Genetic Algorithms Applied to Electromagnetic Design Problems

Gabriel F. Martinez, Alessandro Niccolai, Eleonora Lorenza Zich +1 more

Optimization has always been viewed as a central component of many electrical engineering techniques, where it involves designing a complex system with various constraints and competing objectives. The method described in this work proposes a hybrid quantum–classical evolutionary optimization algorithm targeting high-frequency electromagnetic problems. A genetic algorithm with a quantum selection operator that applies high selection pressure while preserving selection diversity is introduced. This change means that stagnation can be reduced without compromising the speed of convergence. This was used on both real quantum hardware as well as quantum simulators. The results demonstrate that the performance of the real quantum devices was deteriorated by the noise in these devices and that simulators would be a useful option. We provide a description of the operation of the proposed evolutionary optimization method with mathematical benchmarks and electromagnetic design problems that show that it outperforms conventional evolutionary algorithms in terms of convergence behavior and robustness.

Applied Sciences•Jul 18, 2025•6 citations
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.
Designing quantum circuits is a major challenge due to their sensitivity to noise and the complexity of quantum logic. This paper presents an evolutionary algorithm that balances multiple design criteria, namely fidelity and circuit depth, by combining them into a single scalarised fitness function. This approach enables efficient optimisation while avoiding the computational cost of fully multi-objective methods. A novel circuit representation and set of noise-aware genetic operators are introduced, and the technique is applied to evolve implementations of the Quantum Fourier Transform (QFT) for two- and three-qubit systems. Experimental results show that evolved circuits match or exceed ideal fidelity and outperform textbook QFT implementations under simulated noise. These findings highlight the potential of hardware-aware evolutionary design for producing circuits that are both accurate and resilient on near-term quantum hardware.
Abstract Designing compact and efficient quantum circuits that are compatible with Noisy Intermediate-Scale Quantum (NISQ) hardware remains a central challenge in quantum computing. Most existing optimization approaches rely on fidelity-based fitness functions that require computing the full unitary matrix of the circuit. However, this quickly becomes computationally intractable beyond 10–12 qubits due to the exponential memory and time complexity O(22n)O(2^{2n})O(22n) . In this work, we propose a scalable multi-objective genetic algorithm for quantum circuit optimization tailored to NISQ devices. Although evolutionary algorithms have demonstrated strong potential for circuit synthesis, current methods generally depend on full-unitary fidelity evaluation, which severely limits scalability. To address this bottleneck, we introduce two complementary strategies: (1) an independent block-based evaluation using graph partitioning, and (2) an overlapping sliding-window decomposition approach. Both strategies reduce computational complexity from O(22n)O(2^{2n})O(22n) to O(22k)O(2^{2k})O(22k) , where k≪nk \ll nk≪n , making it possible to optimize circuits with more than 20 qubits in practice. Our methods are integrated into the NSGA-II multi-objective framework, enabling simultaneous optimization of fidelity, circuit depth, and gate cost, while maintaining structural compatibility with NISQ hardware–without requiring full-unitary simulation. Experimental results on benchmark circuits demonstrate high fidelity (above 0.94 for small circuits up to 8 qubits, above 0.85 for medium-scale circuits of 10–16 qubits, and above 0.80 for large-scale circuits up to 32 qubits), up to 45%45\%45% reduction in circuit depth, and a 10×10\times10× speedup compared to exact evaluation at 14 qubits.
Abstract Designing expressive yet hardware-efficient quantum circuits remains a central challenge in quantum machine learning (QML). Existing approaches to quantum circuit synthesis primarily optimize for classical performance metrics, often overlooking intrinsic quantum characteristics that govern circuit quality and generalization. This work introduces a quantumness-aware genetic optimization (QAGO) framework for circuit synthesis that integrates quantum properties such as entanglement and non-Clifford gate utilization into the evolutionary design process. We formulate circuit synthesis as both a single-objective optimization (SOO) and a multi-objective optimization (MOO) problem within a genetic framework. The SOO formulation explores quantumness-aware objectives balancing predictive performance and circuit-level quantum structure, while the MOO formulation approximates Pareto-efficient trade-offs between these goals. This dual perspective enables systematic analysis of how increasing quantum expressivity influences predictive behavior and resource cost. Experimental evaluations across three quantum kernel-based algorithms include quantum support vector machines, quantum kernel trainers, and projected quantum kernels demonstrate that circuits evolved under quantumness-aware objectives consistently outperform baseline kernel circuits such as ZZFeatureMap. Comprehensive benchmarking against classical baselines shows that QAGO achieves up to 2.5% area under the ROC curve improvement on the Higgs Boson dataset and 1.5%–9.2% gains across six of nine targets in the LIT-PCBA drug discovery benchmark. Compared to prior work (Wu et al 2021 J. Phys. G: Nucl. Part. Phys. 48 125003, Mensa et al 2023 Mach. Learn.: Sci. Technol. 4 015023) QAGO yields up to 4% improvement on Higgs and 5%–20% gains across eight of nine targets. These results provide quantitative evidence that optimizing for quantumness enhances both performance and quantum expressivity of QML models, establishing QAGO as a principled framework for quantumness-aware circuit evolution.
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 research explores the application of a Quantum-Inspired Genetic Algorithm (QIGA) to optimize complex systems, utilizing a numerical experiment with a focus on the objective function... The QIGA integrates quantum-inspired principles, including crossover, entanglement, and evolution, to strike a balance between exploration and exploitation within the solution space. A 100-generation experiment with a population size of 50 reveals the algorithm's adaptability and gradual convergence towards optimal solutions. The linear combination crossover, guided by quantum principles, enhances diversity, while entanglement and evolution operations introduce correlations between quantum states. The results underscore the algorithm's potential, prompting discussions on parameter tuning, comparisons with classical algorithms, and considerations for transitioning to real quantum hardware. The findings contribute to the understanding of quantum-inspired optimization and pave the way for further research in quantum computing applications for complex system optimization.
Optimization has always been viewed as a central component of many electrical engineering techniques, where it involves designing a complex system with various constraints and competing objectives. The method described in this work proposes a hybrid quantum–classical evolutionary optimization algorithm targeting high-frequency electromagnetic problems. A genetic algorithm with a quantum selection operator that applies high selection pressure while preserving selection diversity is introduced. This change means that stagnation can be reduced without compromising the speed of convergence. This was used on both real quantum hardware as well as quantum simulators. The results demonstrate that the performance of the real quantum devices was deteriorated by the noise in these devices and that simulators would be a useful option. We provide a description of the operation of the proposed evolutionary optimization method with mathematical benchmarks and electromagnetic design problems that show that it outperforms conventional evolutionary algorithms in terms of convergence behavior and robustness.