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

IEEE Congress on Evolutionary Computation (CEC)

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, Sun‐Yuan Kung

Published Jun 1, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.1109/cec69861.2026.11727377

Related papers

A novel quantum-inspired evolutionary computation-based quantum circuit synthesis for various universal gate libraries

Yao–Hsin Chou, Shu–Yu Kuo, Yu-Chi Jiang +7 more

The quantum circuit is the prime factor to realize quantum computation. This paper proposes a novel quantum-inspired evolutionary computation method to synthesize quantum circuits effectively and efficiently. Recently, the Clifford+T gate library has become popular, as the T gate has a better fault-tolerant and error correction efficacy, which is essential to near-term quantum computation. The proposed quantum-inspired evolutionary computation is more flexible in constructing diverse solutions than the classical synthesis method. The entangled local search mechanism further enhances the ability to discover the optimal solutions on an efficient frontier. The encoding can be slightly changed to achieve various gate libraries circuit synthesis in the quantum or reversible Boolean circuits. The experiments demonstrate that our proposed method can be more effective in composing a compact quantum circuit than the state-of-the-art method. Meanwhile, the T-depth can attain an optimal value without ancilla bits. Furthermore, we provide an illustration to construct the function equivalent quantum circuit with the NOT, CNOT, Controlled-Square-Root-of-NOT quantum gate library (NCV). We also conduct exhaustion to prove that our synthesized circuit is an optimal solution, requiring far fewer resources in time and evaluation than exhaustion.

Genetic and Evolutionary Computation Conference Companion (GECCO Companion)•Jul 9, 2022•19 citations

Controlled-swap-based and Knowledge Navigated Quantum-inspired Computational Intelligence for Quantum Circuit Optimization

Shu–Yu Kuo, Cheng-Yen Hua, En-Tzu Hsu +5 more

Quantum and reversible circuit optimization stand as pivotal areas in quantum computing, crucial for error mitigation, size reduction, and cost minimization. In this scenario, computational intelligence (CI) is an efficient approach for improving circuit optimization issues and constructing equivalent small-scale quantum algorithms. In this paper, we propose a novel quantum-inspired computational intelligence method to automatically synthesize quantum circuits, benefiting reliable quantum computing realization. The proposed algorithm uses the feature of quantum mechanics to enhance the exploration ability of computational intelligence. It then detects situations when encountering local optima and reacts appropriately, drawing inspiration from the controlled-swap gate to navigate candidate solutions effectively and escape local optima with preference. Given the uncertain landscape of future quantum technologies and the diverse preferable gate sets with different platforms, our approach is a flexible algorithm that can simply adapt to different gate sets. The experimental results demonstrate that our method achieves superior performance compared to previous synthesis methods, with fewer circuit costs and more stable efficiency. Furthermore, we provide all circuits synthesized by our novel method to facilitate future studies to conduct in-depth research, simplify circuits, and map to different logic gate sets. This study advances reliable quantum computing through a quantum-inspired CI to mutually benefit both realms, promoting insight into interdisciplinary collaboration.

IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)•Jun 30, 2024•5 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

AI and Quantum Computing: A Co-Evolutionary Co-Design Framework and Systematic Review of Synergistic Benefits

Swati Shukla

Artificial intelligence (AI) and quantum computing (QC) have emerged as two rapidly advancing computational paradigms, each facing distinct theoretical and practical challenges. In recent years, increasing attention has been directed toward their interaction, particularly in the context of hybrid quantum-classical systems suitable for noisy intermediate-scale quantum (NISQ) devices. This paper presents a structured analysis of the bidirectional relationship between AI and QC, examining how classical machine learning methods currently support quantum hardware operation, algorithm optimization, and error mitigation, while critically assessing the potential of quantum computing to enhance artificial intelligence in the longer term. Building on this analysis, we introduce a co-evolutionary co-design framework that characterizes feedback mechanisms across hardware, algorithmic, and application layers. The framework is intended as an analytical tool for understanding system-level dependencies rather than as a performance-optimizing prescription. To ground the discussion, we include a simulation-based case study in which a variational quantum circuit is optimized using a classical learning loop implemented with a hybrid quantum-classical workflow. The results demonstrate stable convergence behavior under idealized conditions, illustrating the feasibility of AI-assisted quantum optimization without claiming quantum advantage. By combining a critical literature review, a modest computational study, and a system-level design perspective, this work aims to provide a balanced reference for researchers investigating the near-term and long-term interactions between artificial intelligence and quantum computing.

•Dec 29, 2025•0 citations

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 Engineering•Jul 3, 2026•0 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
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.
The quantum circuit is the prime factor to realize quantum computation. This paper proposes a novel quantum-inspired evolutionary computation method to synthesize quantum circuits effectively and efficiently. Recently, the Clifford+T gate library has become popular, as the T gate has a better fault-tolerant and error correction efficacy, which is essential to near-term quantum computation. The proposed quantum-inspired evolutionary computation is more flexible in constructing diverse solutions than the classical synthesis method. The entangled local search mechanism further enhances the ability to discover the optimal solutions on an efficient frontier. The encoding can be slightly changed to achieve various gate libraries circuit synthesis in the quantum or reversible Boolean circuits. The experiments demonstrate that our proposed method can be more effective in composing a compact quantum circuit than the state-of-the-art method. Meanwhile, the T-depth can attain an optimal value without ancilla bits. Furthermore, we provide an illustration to construct the function equivalent quantum circuit with the NOT, CNOT, Controlled-Square-Root-of-NOT quantum gate library (NCV). We also conduct exhaustion to prove that our synthesized circuit is an optimal solution, requiring far fewer resources in time and evaluation than exhaustion.
Quantum and reversible circuit optimization stand as pivotal areas in quantum computing, crucial for error mitigation, size reduction, and cost minimization. In this scenario, computational intelligence (CI) is an efficient approach for improving circuit optimization issues and constructing equivalent small-scale quantum algorithms. In this paper, we propose a novel quantum-inspired computational intelligence method to automatically synthesize quantum circuits, benefiting reliable quantum computing realization. The proposed algorithm uses the feature of quantum mechanics to enhance the exploration ability of computational intelligence. It then detects situations when encountering local optima and reacts appropriately, drawing inspiration from the controlled-swap gate to navigate candidate solutions effectively and escape local optima with preference. Given the uncertain landscape of future quantum technologies and the diverse preferable gate sets with different platforms, our approach is a flexible algorithm that can simply adapt to different gate sets. The experimental results demonstrate that our method achieves superior performance compared to previous synthesis methods, with fewer circuit costs and more stable efficiency. Furthermore, we provide all circuits synthesized by our novel method to facilitate future studies to conduct in-depth research, simplify circuits, and map to different logic gate sets. This study advances reliable quantum computing through a quantum-inspired CI to mutually benefit both realms, promoting insight into interdisciplinary collaboration.
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.
Artificial intelligence (AI) and quantum computing (QC) have emerged as two rapidly advancing computational paradigms, each facing distinct theoretical and practical challenges. In recent years, increasing attention has been directed toward their interaction, particularly in the context of hybrid quantum-classical systems suitable for noisy intermediate-scale quantum (NISQ) devices. This paper presents a structured analysis of the bidirectional relationship between AI and QC, examining how classical machine learning methods currently support quantum hardware operation, algorithm optimization, and error mitigation, while critically assessing the potential of quantum computing to enhance artificial intelligence in the longer term. Building on this analysis, we introduce a co-evolutionary co-design framework that characterizes feedback mechanisms across hardware, algorithmic, and application layers. The framework is intended as an analytical tool for understanding system-level dependencies rather than as a performance-optimizing prescription. To ground the discussion, we include a simulation-based case study in which a variational quantum circuit is optimized using a classical learning loop implemented with a hybrid quantum-classical workflow. The results demonstrate stable convergence behavior under idealized conditions, illustrating the feasibility of AI-assisted quantum optimization without claiming quantum advantage. By combining a critical literature review, a modest computational study, and a system-level design perspective, this work aims to provide a balanced reference for researchers investigating the near-term and long-term interactions between artificial intelligence and quantum computing.
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.
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.