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 Energy, Power and Environment (ICEPE)

Evolutionary Quantum Transition (EQUATe): A Novel Solution to Optimization Problems

Anand Ravishankar, Santhi Natarajan, Bharathi Malakreddy A

Published Mar 5, 2021• 0 citations
Publisher

Abstract

Quantum Computing (QC) has often been presented as an esoteric field of computing research. However, the possible advantages offered by the inherent quantum fundamentals beseeches extensive additional ventures into this field. Likewise, Evolutionary Computing (EC) offers a multi-pronged approach by deploying several candidates into the search space with constraints guiding the search process. In this paper, we present Evolutionary Quantum Transition (EQUATe) to provide a unique solution to solving state transition optimization problems using concepts borrowed from QC and EC. The combination leverages compute power to explore the space of candidate solutions by introducing smarter techniques. The solution so obtained provides the optimal transition solution with an automated circuit design and selection process.

DOI
10.1109/icepe50861.2021.9404499

Related papers

The Impact Of Quantum Computing In Evolutionary Algorithms

Djalila Belkebir, Abdelhai Lati, Malak Belkebir

Genetic algorithms are widely used for solving optimization problems. As the search space of the problem is augmented, the probability of falling into local minima will be augmented as well. Previous works showed that the adjusted phase (i.e. required modification per generation), may enhance badly the optimality reaching. Moreover, the search for suitable probabilities on crossover and mutation results in huge computational complexity. Recent developments in quantum technology have shown that quantum computers can provide a dramatic advantage over classical computers. This paper will be oriented toward computer scientists interested in the quantum genetic algorithm (QGA). Therefore, we will present a discussion, of the pros, and cons of classical GA. We survey the “state of the art” of the most known techniques for evolving evolutionary algorithms and quantum computing. We intend in this work to help researchers and application developers in gaining insights into the power of quantum computing mechanisms. This science can inherently treat the balance between exploration and exploitation of the search space. This property is due to the use of Q-bits. The orientation toward the best solution is due to the use of Q-gates.

International Conference on Decision Aid Sciences and Applications (DASA)•Sep 16, 2023•2 citations

Quantum-Inspired Evolutionary Algorithms for Circuit Optimization

Jincheng Zhang

This paper explores the application of quantum-inspired evolutionary algorithms (QIEAs) to the optimization of quantum circuits. Traditional evolutionary algorithms (EAs) often face challenges in efficiently navigating the complex design space inherent in quantum circuit design. This work proposes a novel approach that leverages quantum-inspired operators – superposition and quantum tunneling – within an adaptive evolutionary framework. The core idea is to mimic key quantum mechanical phenomena to enhance exploration capabilities and accelerate convergence. The algorithm is designed to dynamically adjust its search strategy based on the current state of the population, fostering a more targeted and effective exploration of the circuit design landscape. We demonstrate the potential of this approach to significantly improve the performance of circuit optimization, particularly in scenarios where conventional EAs struggle to find optimal solutions within reasonable computational time. The theoretical framework and the proposed algorithm are presented, followed by a discussion of its potential applications and future research directions.

•Sep 2, 2026•0 citations

Toward a Framework for Quantum Evolutionary Computation

Donald Sofge

Biological evolution provides an immensely powerful toolset for problem solving, while evolutionary computation attempts to harness the power of biological evolution for solving problems using classical computing paradigms. Quantum computing offers many apparent advantages over classical computing for certain types of problems, such as searching or optimizing over large solution sets. Once practical quantum computers are available, we would like to take advantage of their highly parallel computing capabilities for use in evolutionary computation. In this work we explore the nexus between quantum and evolutionary computation, and propose an approach toward a practical framework for performing evolutionary computation on quantum computers

IEEE Conference on Cybernetics and Intelligent Systems•Jun 1, 2006•8 citations

Quantum-Enhanced Evolutionary Algorithms for Optimization

Jincheng Zhang

This paper explores the integration of quantum computation with evolutionary algorithms to accelerate the search for optimal solutions to complex optimization problems. We propose a novel hybrid framework that utilizes quantum circuits to enhance the exploration of the solution space, enabling parallel processing and potentially dramatically improving convergence rates compared to traditional evolutionary algorithms. The core mechanism focuses on leveraging superposition and entanglement to represent and manipulate the solution space, leading to a significant acceleration of optimization processes. The potential impact of this approach is substantial for tackling challenging problems across diverse domains, including logistics, finance, and materials science.

•Sep 4, 2026•0 citations

Evolutionary Algorithms and Quantum Computing—Pioneering the Next Era of Intelligence and Innovation

A. Suresh, B. Rupa Devi, R Roopa +3 more

Quantum computing and evolutionary algorithms are collaborating and combining to create a new era of computational problem-solving. Natural-selection-based evolution algorithms have demonstrated efficacy in optimizing complicated systems by iteratively improving solutions. However, quantum computing offers an entirely novel technique to handle information using superposition and entanglement, potentially accelerating optimization procedures. This study examines the theoretical underpinnings and practical implications of recent developments in quantum-enhanced evolutionary algorithms. A unique case study on 5G networks demonstrates the application of these methods to optimization problems in next-generation communication systems. We also emphasize their influence in fields where quantum-assisted evolutionary techniques spur innovation, such as financial modeling, bioinformatics, machine learning, and cryptography. Despite their revolutionary promise, several obstacles remain, such as the scalability of quantum hardware, noise sensitivity, and converting conventional evolutionary mechanisms to quantum frameworks. Developing hybrid quantum-classical and novel optimization approaches will be crucial in advancing artificial intelligence, data analytics, and decision-making systems. The author combines quantum computing with evolutionary principles to explain an advanced computational framework that has diverse scientific concepts as well as industrial applications.

CRC Press eBooks•Nov 28, 2025•0 citations

Knowledge-Navigated Quantum-inspired Evolutionary Computation with Smart Encoding and Dynamic Local Search for Quantum Circuit Optimization

Cheng-Yen Hua, Shu–Yu Kuo, Yao–Hsin Chou +1 more

Quantum computing (QC) has demonstrated strong theoretical potential for solving complex optimization problems, yet its practical impact depends on the availability of resource-efficient quantum circuits compatible with near-term hardware constraints. In this context, classical artificial intelligence (AI) techniques, particularly evolutionary computation (EC), play a crucial enabling role by enhancing the feasibility and scalability of quantum processes. This work presents a quantum-inspired evolutionary computation framework that leverages classical EC mechanisms to improve quantum circuit synthesis under the Clifford+T gate set. The proposed approach integrates a compact encoding scheme, a knowledge-driven Separation mechanism to resolve functional redundancy, and a dynamic Local Search strategy for phase refinement, demonstrating how classical EC can effectively guide quantum-oriented optimization tasks. Experimental results on diverse benchmark circuits show that the proposed framework achieves higher success rates while significantly reducing computational evaluations compared to state-of-the-art methods, without compromising circuit optimality. Moreover, the resulting optimized circuits provide reusable building blocks for future quantum algorithms, illustrating a concrete and effective instance of QC–EC collaboration within quantum-inspired AI.

IEEE Congress on Evolutionary Computation (CEC)•Jun 1, 2026•0 citations
Quantum Computing (QC) has often been presented as an esoteric field of computing research. However, the possible advantages offered by the inherent quantum fundamentals beseeches extensive additional ventures into this field. Likewise, Evolutionary Computing (EC) offers a multi-pronged approach by deploying several candidates into the search space with constraints guiding the search process. In this paper, we present Evolutionary Quantum Transition (EQUATe) to provide a unique solution to solving state transition optimization problems using concepts borrowed from QC and EC. The combination leverages compute power to explore the space of candidate solutions by introducing smarter techniques. The solution so obtained provides the optimal transition solution with an automated circuit design and selection process.
Genetic algorithms are widely used for solving optimization problems. As the search space of the problem is augmented, the probability of falling into local minima will be augmented as well. Previous works showed that the adjusted phase (i.e. required modification per generation), may enhance badly the optimality reaching. Moreover, the search for suitable probabilities on crossover and mutation results in huge computational complexity. Recent developments in quantum technology have shown that quantum computers can provide a dramatic advantage over classical computers. This paper will be oriented toward computer scientists interested in the quantum genetic algorithm (QGA). Therefore, we will present a discussion, of the pros, and cons of classical GA. We survey the “state of the art” of the most known techniques for evolving evolutionary algorithms and quantum computing. We intend in this work to help researchers and application developers in gaining insights into the power of quantum computing mechanisms. This science can inherently treat the balance between exploration and exploitation of the search space. This property is due to the use of Q-bits. The orientation toward the best solution is due to the use of Q-gates.
This paper explores the application of quantum-inspired evolutionary algorithms (QIEAs) to the optimization of quantum circuits. Traditional evolutionary algorithms (EAs) often face challenges in efficiently navigating the complex design space inherent in quantum circuit design. This work proposes a novel approach that leverages quantum-inspired operators – superposition and quantum tunneling – within an adaptive evolutionary framework. The core idea is to mimic key quantum mechanical phenomena to enhance exploration capabilities and accelerate convergence. The algorithm is designed to dynamically adjust its search strategy based on the current state of the population, fostering a more targeted and effective exploration of the circuit design landscape. We demonstrate the potential of this approach to significantly improve the performance of circuit optimization, particularly in scenarios where conventional EAs struggle to find optimal solutions within reasonable computational time. The theoretical framework and the proposed algorithm are presented, followed by a discussion of its potential applications and future research directions.
Biological evolution provides an immensely powerful toolset for problem solving, while evolutionary computation attempts to harness the power of biological evolution for solving problems using classical computing paradigms. Quantum computing offers many apparent advantages over classical computing for certain types of problems, such as searching or optimizing over large solution sets. Once practical quantum computers are available, we would like to take advantage of their highly parallel computing capabilities for use in evolutionary computation. In this work we explore the nexus between quantum and evolutionary computation, and propose an approach toward a practical framework for performing evolutionary computation on quantum computers
This paper explores the integration of quantum computation with evolutionary algorithms to accelerate the search for optimal solutions to complex optimization problems. We propose a novel hybrid framework that utilizes quantum circuits to enhance the exploration of the solution space, enabling parallel processing and potentially dramatically improving convergence rates compared to traditional evolutionary algorithms. The core mechanism focuses on leveraging superposition and entanglement to represent and manipulate the solution space, leading to a significant acceleration of optimization processes. The potential impact of this approach is substantial for tackling challenging problems across diverse domains, including logistics, finance, and materials science.
Quantum computing and evolutionary algorithms are collaborating and combining to create a new era of computational problem-solving. Natural-selection-based evolution algorithms have demonstrated efficacy in optimizing complicated systems by iteratively improving solutions. However, quantum computing offers an entirely novel technique to handle information using superposition and entanglement, potentially accelerating optimization procedures. This study examines the theoretical underpinnings and practical implications of recent developments in quantum-enhanced evolutionary algorithms. A unique case study on 5G networks demonstrates the application of these methods to optimization problems in next-generation communication systems. We also emphasize their influence in fields where quantum-assisted evolutionary techniques spur innovation, such as financial modeling, bioinformatics, machine learning, and cryptography. Despite their revolutionary promise, several obstacles remain, such as the scalability of quantum hardware, noise sensitivity, and converting conventional evolutionary mechanisms to quantum frameworks. Developing hybrid quantum-classical and novel optimization approaches will be crucial in advancing artificial intelligence, data analytics, and decision-making systems. The author combines quantum computing with evolutionary principles to explain an advanced computational framework that has diverse scientific concepts as well as industrial applications.
Quantum computing (QC) has demonstrated strong theoretical potential for solving complex optimization problems, yet its practical impact depends on the availability of resource-efficient quantum circuits compatible with near-term hardware constraints. In this context, classical artificial intelligence (AI) techniques, particularly evolutionary computation (EC), play a crucial enabling role by enhancing the feasibility and scalability of quantum processes. This work presents a quantum-inspired evolutionary computation framework that leverages classical EC mechanisms to improve quantum circuit synthesis under the Clifford+T gate set. The proposed approach integrates a compact encoding scheme, a knowledge-driven Separation mechanism to resolve functional redundancy, and a dynamic Local Search strategy for phase refinement, demonstrating how classical EC can effectively guide quantum-oriented optimization tasks. Experimental results on diverse benchmark circuits show that the proposed framework achieves higher success rates while significantly reducing computational evaluations compared to state-of-the-art methods, without compromising circuit optimality. Moreover, the resulting optimized circuits provide reusable building blocks for future quantum algorithms, illustrating a concrete and effective instance of QC–EC collaboration within quantum-inspired AI.