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

Genetic and Evolutionary Computation Conference Companion (GECCO Companion)

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

Yao–Hsin Chou, Shu–Yu Kuo, Yu-Chi Jiang, Ching-Hsuan Wu, Jyun–Yi Shen, Cheng-Yen Hua, Pei-Shin Huang, Yun-Ting Lai, Yong Feng Tong, Ming-He Chang

Published Jul 9, 2022• 19 citations
Publisher

Abstract

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.

DOI
10.1145/3520304.3533956

Related papers

Adapting Developing Quantum Circuit Synthesis with a Multi -objective Quantum- inspired Optimization

Yao–Hsin Chou, Cheng-Yen Hua, Huan-Pu Chen +3 more

It is important to construct quantum algorithms within shallow-depth quantum circuits due to the current imperfections and decoherence in quantum devices. Efficient quantum circuit synthesis and optimization are critical tasks that generate relatively small quantum circuits tailored to specific requirements. However, an efficient circuit may vary depending on the physical realization platforms of quantum computers. For example, the Clifford+T gate library has recently gained prominence for its superior fault tolerance and error correction capabilities, but the T gate dominates circuit execution time. Therefore, the objectives of synthesis algorithms in this gate set include reducing T-depth and T-count, as well as overall circuit depth and gate count. Most traditional synthesis methods produce a single optimized circuit. In contrast, this study introduces a multi-objective quantum-inspired tabu search algorithm in quantum circuit synthesis to construct a diverse set of optimized circuits based on four distinct metrics. The values of these metrics in the optimized circuit display the entanglement relationship, and the proposed method simulates the formula to assist in building the entangled optimal circuit. Results show that the construction of the Pareto front can flexibly offer a variety of functionally equivalent circuits that adapt to advancements in quantum technology. Providing multiple optimized circuit structures facilitates circuit replacement and further simplification, thereby enhancing the development of quantum computing.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•4 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

An efficient algorithm to synthesize quantum circuits and optimization

Ömercan Susam, Mustafa Altun

Quantum computers, more specifically quantum circuits, take on the eyes with their computational promises such as reversibility. In this paper, we perform synthesis and optimization of quantum circuits. In the first part, we propose a fast synthesis algorithm that implements any given reversible Boolean function with quantum gates. Instead of an exhaustive search on every given function, our algorithm creates a library of essential functions and performs sorting. As an example, to implement 4 bit circuits we only use 120 essential functions out of all 20922789888000 functions. In the second part, we optimize our circuits by using new templates. The proposed templates mainly consist of Toffoli gates with negative and positive controlling lines. These templates also show us that optimum area solutions proposed in the literature are not actually optimum; they can be improved.

IEEE International Conference on Electronics, Circuits and Systems (ICECS)•Dec 1, 2014•2 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 Tabu Search Algorithm for reversible logic circuit synthesis

Wen-Hsin Wang, Chia-Hui Chiu, Shu–Yu Kuo +2 more

Reversible logic plays an important role in quantum computation, which is a promising research field. The reversible logic synthesis problem focuses on generating a reversible circuit automatically and finding the lowest cost when an output function is given. The synthesis of reversible logic circuits can be formulated as a combinatorial optimization problem. This paper proposes a new evolutionary algorithm for synthesizing reversible circuits based on Quantum-Inspired Tabu Search Algorithm (QTS). The proposed algorithm uses the QTS-based approach to find fewer gates and reduce the cost of reversible circuits. This method is simpler, has better performance in computational cost, and reduce the gate counts of reversible circuits. This paper also compares experimental results with other heuristic and evolutionary algorithms. The final outcome shows that the QTS-based approach performs much better than other algorithms.

Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics•Oct 1, 2012•24 citations

Quantum Circuit Automatic Synthesizer (QCAS)

Ali Moghadaszadeh, Majid Mohamadi, Ali Niknafs +1 more

Abstract — Quantum and reversible circuit synthesis has been important concern of designers in recently passed decades. Considering the application of garbage bit in optimization of quantum circuit, GA-Based techniques have been introduced. This project provides an extensible infrastructure for quantum circuit automatic synthesis and optimization with the enhancement of interoperability features. The problem domain begins from complex computing model up to a synthesis of reversible quantum circuit. Optimization criterias are whole considered separately from software processing logic which cause capability of applying variable optimization critria in different problem domains. The new introduced methodology utilize PSO technique for circuit synthesis evolutionary computation in optimization step. A software library has been developed which implements this technique. It provides a simple flexible software for researchers in order to automatic synthesis of quantum circuit that implements an open source library of prerequisite of quantum circuit synthesis. Index Terms-Quantum circuits, gate, PSO, Automatic synthesis.

•Jan 1, 2013•0 citations
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.
It is important to construct quantum algorithms within shallow-depth quantum circuits due to the current imperfections and decoherence in quantum devices. Efficient quantum circuit synthesis and optimization are critical tasks that generate relatively small quantum circuits tailored to specific requirements. However, an efficient circuit may vary depending on the physical realization platforms of quantum computers. For example, the Clifford+T gate library has recently gained prominence for its superior fault tolerance and error correction capabilities, but the T gate dominates circuit execution time. Therefore, the objectives of synthesis algorithms in this gate set include reducing T-depth and T-count, as well as overall circuit depth and gate count. Most traditional synthesis methods produce a single optimized circuit. In contrast, this study introduces a multi-objective quantum-inspired tabu search algorithm in quantum circuit synthesis to construct a diverse set of optimized circuits based on four distinct metrics. The values of these metrics in the optimized circuit display the entanglement relationship, and the proposed method simulates the formula to assist in building the entangled optimal circuit. Results show that the construction of the Pareto front can flexibly offer a variety of functionally equivalent circuits that adapt to advancements in quantum technology. Providing multiple optimized circuit structures facilitates circuit replacement and further simplification, thereby enhancing the development of quantum computing.
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.
Quantum computers, more specifically quantum circuits, take on the eyes with their computational promises such as reversibility. In this paper, we perform synthesis and optimization of quantum circuits. In the first part, we propose a fast synthesis algorithm that implements any given reversible Boolean function with quantum gates. Instead of an exhaustive search on every given function, our algorithm creates a library of essential functions and performs sorting. As an example, to implement 4 bit circuits we only use 120 essential functions out of all 20922789888000 functions. In the second part, we optimize our circuits by using new templates. The proposed templates mainly consist of Toffoli gates with negative and positive controlling lines. These templates also show us that optimum area solutions proposed in the literature are not actually optimum; they can be improved.
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.
Reversible logic plays an important role in quantum computation, which is a promising research field. The reversible logic synthesis problem focuses on generating a reversible circuit automatically and finding the lowest cost when an output function is given. The synthesis of reversible logic circuits can be formulated as a combinatorial optimization problem. This paper proposes a new evolutionary algorithm for synthesizing reversible circuits based on Quantum-Inspired Tabu Search Algorithm (QTS). The proposed algorithm uses the QTS-based approach to find fewer gates and reduce the cost of reversible circuits. This method is simpler, has better performance in computational cost, and reduce the gate counts of reversible circuits. This paper also compares experimental results with other heuristic and evolutionary algorithms. The final outcome shows that the QTS-based approach performs much better than other algorithms.
Abstract — Quantum and reversible circuit synthesis has been important concern of designers in recently passed decades. Considering the application of garbage bit in optimization of quantum circuit, GA-Based techniques have been introduced. This project provides an extensible infrastructure for quantum circuit automatic synthesis and optimization with the enhancement of interoperability features. The problem domain begins from complex computing model up to a synthesis of reversible quantum circuit. Optimization criterias are whole considered separately from software processing logic which cause capability of applying variable optimization critria in different problem domains. The new introduced methodology utilize PSO technique for circuit synthesis evolutionary computation in optimization step. A software library has been developed which implements this technique. It provides a simple flexible software for researchers in order to automatic synthesis of quantum circuit that implements an open source library of prerequisite of quantum circuit synthesis. Index Terms-Quantum circuits, gate, PSO, Automatic synthesis.