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

European Conference on Antennas and Propagation

Modified Oracles for Quantum Selection Applied to Electromagnetic Problems

Gabriel F. Martinez E., Alessandro Niccolai, Riccardo Enrico Zich

Published Mar 30, 2025• 3 citations
Publisher

Abstract

The emergence of quantum computing has brought with it multiple applications like hybrid classic-quantum evolutionary optimization algorithms. In electromagnetics, optimization has always been present to increase the performance of complex systems. This paper presents two new oracles for the genetic algorithm with quantum selection and its newer version that uses simulated binary crossover. These algorithms are applied to two common electromagnetic optimization problems showing strong results and demonstrating the flexibility that these hybrid algorithms have by making small changes to their quantum circuits.

DOI
10.23919/eucap63536.2025.11000033

Related papers

Quantum Selection for Genetic Algorithms Applied to Electromagnetic Design Problems

Gabriel F. Martinez, Alessandro Niccolai, Eleonora L. 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•7 citations

Hybrid quantum search with genetic algorithm optimization

Mihai Udrescu, Mihai Udrescu

Quantum genetic algorithms (QGA) integrate genetic programming and quantum computing to address search and optimization problems. The standard strategy of the hybrid QGA approach is to add quantum resources to classical genetic algorithms (GA), thus improving their efficacy (i.e., quantum optimization of a classical algorithm). However, the extent of such improvements is still unclear. Conversely, Reduced Quantum Genetic Algorithm (RQGA) is a fully quantum algorithm that reduces the GA search for the best fitness in a population of potential solutions to running Grover’s algorithm. Unfortunately, RQGA finds the best fitness value and its corresponding chromosome (i.e., the solution or one of the solutions of the problem) in exponential runtime, O(2n/2), where n is the number of qubits in the individuals’ quantum register. This article introduces a novel QGA optimization strategy, namely a classical optimization of a fully quantum algorithm, to address the RQGA complexity problem. Accordingly, we control the complexity of the RQGA algorithm by selecting a limited number of qubits in the individuals’ register and fixing the remaining ones as classical values of ‘0’ and ‘1’ with a genetic algorithm. We also improve the performance of RQGA by discarding unfit solutions and bounding the search only in the area of valid individuals. As a result, our Hybrid Quantum Algorithm with Genetic Optimization (HQAGO) solves search problems in O(2(n−k)/2) oracle queries, where k is the number of fixed classical bits in the individuals’ register.

PeerJ Computer Science•Aug 5, 2024•18 citations

EAQGA: A Quantum-Enhanced Genetic Algorithm with Novel Entanglement-Aware Crossovers

Mohammad Kashfi Haghighi, Matthieu Fortin-Deschênes, Christophe Père +1 more

Genetic algorithms are highly effective optimization techniques for many computationally challenging problems, including combinatorial optimization tasks like portfolio optimization. Quantum computing has also shown potential in addressing these complex challenges. Combining these approaches, quantum genetic algorithms leverage the principles of superposition and entanglement to enhance the performance of classical genetic algorithms. In this work, we propose a novel quantum genetic algorithm introducing an innovative crossover strategy to generate quantum circuits from a binary solution. We incorporate a heuristic method to encode entanglement patterns from parent solutions into circuits for the next generation. Our algorithm advances quantum genetic algorithms by utilizing a limited number of entanglements, enabling efficient exploration of optimal solutions without significantly increasing circuit depth, making it suitable for near-term applications. We test this approach on a portfolio optimization problem using an IBM 127 qubits Eagle processor (ibm_quebec) and simulators. Compared to state-of-the-art algorithms, our results show that the proposed method improves fitness values by 33.6% over classical genetic algorithm and 37.2% over quantum-inspired genetic algorithm, using the same iteration counts and population sizes with real quantum hardware employing 100 qubits. These findings highlight the potential of current quantum computers to address real-world utility-scale combinatorial optimization problems.

arXiv:2504.17923•Apr 24, 2025•5 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, 2026•0 citations

Quantum Acceleration of Evolutionary Algorithms

Jincheng Zhang

This paper investigates the potential of quantum algorithms to accelerate evolutionary algorithms (EAs). Traditional EAs often suffer from slow convergence rates due to computationally intensive selection processes. This work proposes a novel approach to leverage quantum parallelism to significantly speed up the search process within an EA. Specifically, we map the core operations of an EA – selection, crossover, and mutation – onto a quantum circuit. By exploiting the inherent parallelism of quantum computation, we aim to achieve a substantial improvement in the efficiency and performance of the EA. The theoretical framework is presented, outlining the mapping strategies and the potential advantages. While no experimental validation is included in this document, this work serves as a foundational study for future research in hybrid quantum-classical optimization. The core claim is that utilizing quantum algorithms to accelerate the simulation of evolutionary algorithms can improve their efficiency and performance. The core mechanism is the mapping of selection, crossover, and mutation operations within an EA to quantum circuits for parallel computation. This approach addresses a potential computational bottleneck in traditional EAs and promises a breakthrough in optimization tasks.

•Aug 28, 2026•0 citations

Quantum Circuit Construction and Optimization through Hybrid Evolutionary Algorithms

Leo Sünkel, Philipp J. Altmann, Michael Kölle +3 more

We apply a hybrid evolutionary algorithm to minimize the depth of circuits in quantum computing. More specifically, we evaluate two different variants of the algorithm. In the first approach, we combine the evolutionary algorithm with an optimization subroutine to optimize the parameters of the rotation gates present in the quantum circuit. In the second, the algorithm solely relies on evolutionary operations (i.e., mutations and crossover). We approach the problem from two sides: (1) constructing circuits from the ground up by starting with random initializations and (2) initializing individuals with a target circuit in order to optimize it further according to the fitness function. We run experiments on random circuits with 4 and 6 qubits varying in circuit depth. Our results show that the proposed methods are able to significantly reduce the depth of circuits while still retaining a high fidelity to the target state.

arXiv:2504.17561•Genetic and Evolutionary Computation Conference (GECCO)•Jul 8, 2025•8 citations
The emergence of quantum computing has brought with it multiple applications like hybrid classic-quantum evolutionary optimization algorithms. In electromagnetics, optimization has always been present to increase the performance of complex systems. This paper presents two new oracles for the genetic algorithm with quantum selection and its newer version that uses simulated binary crossover. These algorithms are applied to two common electromagnetic optimization problems showing strong results and demonstrating the flexibility that these hybrid algorithms have by making small changes to their quantum circuits.
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.
Quantum genetic algorithms (QGA) integrate genetic programming and quantum computing to address search and optimization problems. The standard strategy of the hybrid QGA approach is to add quantum resources to classical genetic algorithms (GA), thus improving their efficacy (i.e., quantum optimization of a classical algorithm). However, the extent of such improvements is still unclear. Conversely, Reduced Quantum Genetic Algorithm (RQGA) is a fully quantum algorithm that reduces the GA search for the best fitness in a population of potential solutions to running Grover’s algorithm. Unfortunately, RQGA finds the best fitness value and its corresponding chromosome (i.e., the solution or one of the solutions of the problem) in exponential runtime, O(2n/2), where n is the number of qubits in the individuals’ quantum register. This article introduces a novel QGA optimization strategy, namely a classical optimization of a fully quantum algorithm, to address the RQGA complexity problem. Accordingly, we control the complexity of the RQGA algorithm by selecting a limited number of qubits in the individuals’ register and fixing the remaining ones as classical values of ‘0’ and ‘1’ with a genetic algorithm. We also improve the performance of RQGA by discarding unfit solutions and bounding the search only in the area of valid individuals. As a result, our Hybrid Quantum Algorithm with Genetic Optimization (HQAGO) solves search problems in O(2(n−k)/2) oracle queries, where k is the number of fixed classical bits in the individuals’ register.
Genetic algorithms are highly effective optimization techniques for many computationally challenging problems, including combinatorial optimization tasks like portfolio optimization. Quantum computing has also shown potential in addressing these complex challenges. Combining these approaches, quantum genetic algorithms leverage the principles of superposition and entanglement to enhance the performance of classical genetic algorithms. In this work, we propose a novel quantum genetic algorithm introducing an innovative crossover strategy to generate quantum circuits from a binary solution. We incorporate a heuristic method to encode entanglement patterns from parent solutions into circuits for the next generation. Our algorithm advances quantum genetic algorithms by utilizing a limited number of entanglements, enabling efficient exploration of optimal solutions without significantly increasing circuit depth, making it suitable for near-term applications. We test this approach on a portfolio optimization problem using an IBM 127 qubits Eagle processor (ibm_quebec) and simulators. Compared to state-of-the-art algorithms, our results show that the proposed method improves fitness values by 33.6% over classical genetic algorithm and 37.2% over quantum-inspired genetic algorithm, using the same iteration counts and population sizes with real quantum hardware employing 100 qubits. These findings highlight the potential of current quantum computers to address real-world utility-scale combinatorial optimization problems.
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. ---
This paper investigates the potential of quantum algorithms to accelerate evolutionary algorithms (EAs). Traditional EAs often suffer from slow convergence rates due to computationally intensive selection processes. This work proposes a novel approach to leverage quantum parallelism to significantly speed up the search process within an EA. Specifically, we map the core operations of an EA – selection, crossover, and mutation – onto a quantum circuit. By exploiting the inherent parallelism of quantum computation, we aim to achieve a substantial improvement in the efficiency and performance of the EA. The theoretical framework is presented, outlining the mapping strategies and the potential advantages. While no experimental validation is included in this document, this work serves as a foundational study for future research in hybrid quantum-classical optimization. The core claim is that utilizing quantum algorithms to accelerate the simulation of evolutionary algorithms can improve their efficiency and performance. The core mechanism is the mapping of selection, crossover, and mutation operations within an EA to quantum circuits for parallel computation. This approach addresses a potential computational bottleneck in traditional EAs and promises a breakthrough in optimization tasks.
We apply a hybrid evolutionary algorithm to minimize the depth of circuits in quantum computing. More specifically, we evaluate two different variants of the algorithm. In the first approach, we combine the evolutionary algorithm with an optimization subroutine to optimize the parameters of the rotation gates present in the quantum circuit. In the second, the algorithm solely relies on evolutionary operations (i.e., mutations and crossover). We approach the problem from two sides: (1) constructing circuits from the ground up by starting with random initializations and (2) initializing individuals with a target circuit in order to optimize it further according to the fitness function. We run experiments on random circuits with 4 and 6 qubits varying in circuit depth. Our results show that the proposed methods are able to significantly reduce the depth of circuits while still retaining a high fidelity to the target state.