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

International Conference on Communications

A Genetic Algorithm with Quantum Circuit Objective Function for Optimizing Communication Network Design: A Quadratic Assignment Approach

Razieh Abdolahi, M. Reza Soleymani, Walaa Hamouda

Published Jun 8, 2025• 0 citations
Publisher

Abstract

This paper introduces a novel Quantum Genetic Algorithm (QGA) designed to solve the Quadratic Assignment Problem (QAP), a structure widely applied in communication network optimization, where efficient solutions are critical. This approach utilizes quantum circuits as the objective function, enabling simultaneous evaluation of entire individuals at each generation of the Genetic Algorithm (GA) through quantum superposition and the SWAP test. A preprocessing step involving inverse stereographic projection is applied to ensure proper normalization of data. The method is validated in a case study, analyzing the impact of varying the number of elites and an additional algorithm parameter on solution quality and convergence speed. This work underscores the potential of quantum computing for addressing large-scale optimization challenges in communication networks.

DOI
10.1109/icc52391.2025.11161958

Related papers

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

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

A Novel Quantum Algorithm for Solving Optimization Problems in Electrical Engineering

Ajay Sharma, Kuldeep Sharma, Kanchan Yadav +3 more

The ability of theoretical and monadic quantum models against number comparison to conventional Quantum Genetic Algorithm (QGA), quantitative particle swarm optimization, ant colony groups with simulated annealing types is analyzed in the context of electrical engineering. Several experiments were done, involving a collection of multiple data sets standard for the proposed circuit layout within power distribution and signal processing applications. In regard to comparative analysis, each algorithm presents its particular strengths for QGA-competitive convergence speed; ͟QPSO – quick conversion of individuals into a global optimum during evolution’s course and robust solutions quality in an unstable environment without tuning. The related works of the proposed algorithms include evaluating it against metaheuristics for power systems, nature-inspired hybrid heuristic approaches as well as physics motivated optimization schemes. The paper emphasizes the superiority of quantum algorithms over their classical counterparts, which is a major innovation in optimization space. This detailed analysis contributes to further comprehending the potentials of quantum computing in overcoming tough optimization challenges faced by electrical engineers.

International Conference on Innovative Practices in Technology and Management (ICIPTM)•Feb 21, 2024•0 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

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

Genetic Algorithm Based Optimisation Framework for Quantum Circuit Mapping GAQCM

Kai Lu, Hui Li, Zi’ao Han +2 more

Abstract Most of the existing qubit mapping algorithms are deterministic, resulting in a lack of diversity in the generated quantum circuit mappings, which makes it difficult to strike a balance between quality and diversity, and prevents them from being flexibly adapted to different quantum computing tasks. To solve this problem, this paper proposes the Genetic Algorithm-based Quantum Circuit Mapping (GAQCM) framework, which is based on the idea of genetic algorithm, evaluates the quality of mapping by the fitness function, and continuously improves the mapping scheme through several iterations. The GAQCM framework is designed to be flexible, providing a variety of choices, crossover operations and several unique mutation methods are designed to improve the performance of the algorithm. The framework also introduces a neighbourhood gate-based initialisation strategy to improve the algorithm efficiency and convergence speed. Experimental results show that the GAQCM framework reduces the number of SWAP gates by an average of 44.6% and 62.0%, and reduces the hardware gate overhead by 13.8% and 14.9% in the t|ket > and Qiskit compilers, respectively, compared to 2QAN. The framework allows users to customise the fitness function and parameter settings according to their specific needs, and is suitable for a variety of quantum computing tasks.

•Sep 11, 2024•1 citation
This paper introduces a novel Quantum Genetic Algorithm (QGA) designed to solve the Quadratic Assignment Problem (QAP), a structure widely applied in communication network optimization, where efficient solutions are critical. This approach utilizes quantum circuits as the objective function, enabling simultaneous evaluation of entire individuals at each generation of the Genetic Algorithm (GA) through quantum superposition and the SWAP test. A preprocessing step involving inverse stereographic projection is applied to ensure proper normalization of data. The method is validated in a case study, analyzing the impact of varying the number of elites and an additional algorithm parameter on solution quality and convergence speed. This work underscores the potential of quantum computing for addressing large-scale optimization challenges in communication networks.
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.
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.
The ability of theoretical and monadic quantum models against number comparison to conventional Quantum Genetic Algorithm (QGA), quantitative particle swarm optimization, ant colony groups with simulated annealing types is analyzed in the context of electrical engineering. Several experiments were done, involving a collection of multiple data sets standard for the proposed circuit layout within power distribution and signal processing applications. In regard to comparative analysis, each algorithm presents its particular strengths for QGA-competitive convergence speed; ͟QPSO – quick conversion of individuals into a global optimum during evolution’s course and robust solutions quality in an unstable environment without tuning. The related works of the proposed algorithms include evaluating it against metaheuristics for power systems, nature-inspired hybrid heuristic approaches as well as physics motivated optimization schemes. The paper emphasizes the superiority of quantum algorithms over their classical counterparts, which is a major innovation in optimization space. This detailed analysis contributes to further comprehending the potentials of quantum computing in overcoming tough optimization challenges faced by electrical engineers.
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. ---
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.
Abstract Most of the existing qubit mapping algorithms are deterministic, resulting in a lack of diversity in the generated quantum circuit mappings, which makes it difficult to strike a balance between quality and diversity, and prevents them from being flexibly adapted to different quantum computing tasks. To solve this problem, this paper proposes the Genetic Algorithm-based Quantum Circuit Mapping (GAQCM) framework, which is based on the idea of genetic algorithm, evaluates the quality of mapping by the fitness function, and continuously improves the mapping scheme through several iterations. The GAQCM framework is designed to be flexible, providing a variety of choices, crossover operations and several unique mutation methods are designed to improve the performance of the algorithm. The framework also introduces a neighbourhood gate-based initialisation strategy to improve the algorithm efficiency and convergence speed. Experimental results show that the GAQCM framework reduces the number of SWAP gates by an average of 44.6% and 62.0%, and reduces the hardware gate overhead by 13.8% and 14.9% in the t|ket > and Qiskit compilers, respectively, compared to 2QAN. The framework allows users to customise the fitness function and parameter settings according to their specific needs, and is suitable for a variety of quantum computing tasks.