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

Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics

Knowledge Navigated Quantum-inspired Tabu Search Algorithm for Reversible Circuit Synthesis

Hsing-Yu Hsu, Shan-Jung Hou, Yu-Yuan Chen, Yu Chen, Yu-Chi Jiang, Shu–Yu Kuo, Yao–Hsin Chou

Published Oct 9, 2022• 9 citations
Publisher

Abstract

Reversible circuits are the essential building blocks of quantum computers and have zero energy dissipation. However, there is no general rule on how to synthesize an effective circuit with minimal cost. Many researchers have placed a high value on the design of algorithms for reversible circuit synthesis as it is the fundamental component to implement in many paradigms, such as Shor’s algorithm. In this paper, the knowledge navigated quantum-inspired tabu search algorithm (KNQTS) is proposed to synthesize several benchmark functions. KNQTS is a quantum-inspired algorithm with the concept of getting closer to the best solution and keeping away from the worst solution, and it has a great search ability. Furthermore, the proposed algorithm uses self-adaptive, global-best guided and Quantum-Not gate mechanisms to make all procedures more efficient and avoid sticking to the local optimum. This paper also compares the KNQTS approach’s experimental results with those obtained via other metaheuristics and previous algorithms. Finally, the result shows that the proposed KNQTS method outperforms other state-of-the-art methods and achieves the same functionality at a lower cost. The solutions are optimal or near-optimal.

DOI
10.1109/smc53654.2022.9945332

Related papers

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

Amplitude-Ensemble Quantum-Inspired Tabu Search Algorithm for Quantum Boolean Circuit Synthesis

Kuo-Chun Tseng, Ziyi Sun, Pei-Lun Ho +5 more

Quantum circuit synthesis is a key technique in quantum computing. Traditional methods often generate circuits with high cost, making it crucial to produce correct and low-cost circuits efficiently. This study proposes the Amplitude-Ensemble Quantum-inspired Tabu Search (AE-QTS) algorithm for quantum Boolean circuit synthesis. AE-QTS demonstrates strong search capability with fewer parameters. Experimental results show that it outperforms other algorithms on low-bit problems and retains a certain level of synthesis ability on high-bit ones. However, the results also reveal that if the encoding frequently produces infeasible solutions, all algorithms will eventually fail, regardless of design. Therefore, future work should focus on developing encoding methods that consistently generate feasible solutions, which is essential for effectively applying metaheuristics to quantum Boolean circuit synthesis.

Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics•Oct 5, 2025•0 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 Optimization with Hamming-Distance Reinforcement for Hypercube-Encoded Reversible Circuit Synthesis

Yu-Chi Jiang

Quantum logic reversible synthesis is a fundamental operation in quantum computing. One of the most challenging issues in this field resides in navigating the immense search space to synthesize the most compact circuit configurations, which are critical for realizing reliable, noise-free, and error-free quantum computing systems. To address this challenge, this study proposes a novel hypercube-encoded quantum-inspired optimization framework to formulate the synthesis task as a trajectory-finding process. This structure-informed domain knowledge transformation delivers exceptional search direction guidance, moving away from blind, black-box exploration. Specifically, by mapping the reversible functions onto the hypercube architecture, the framework embeds explicit dual Hamming-distance (HMD) guidance metrics into a global-best guided quantum-inspired tabu search (GQTS) engine. To minimize computational cost and enhance search efficiency, the framework incorporates a domain-informed initialization and couples a streamlined two-particle configuration with a global-best mechanism, thereby amplifying the efficiency of the underlying quantum-inspired updating mechanism to escape local optima and rapidly converge once a successfully synthesized superior path is locked. Under an online step relaxation mechanism, the framework preserves exceptional structural optimization flexibility without altering the underlying hypercube representation. The framework’s significance is rigorously evaluated against both rigid hypercube rule-based methods and generic randomized search-based heuristics, using gate count and exact-optimality as primary evaluation metrics. Extensive ablation studies first validate the individual and synergistic contributions of each core algorithmic component. Experimental results demonstrate that for the complete set of 3-bit reversible functions, the proposed HMD-guided GQTS (HMD-GQTS) framework achieves over 98% exact-optimal circuits in a single fine-tuned sweep, with selective retries attaining 100% exhaustive optimal coverage. Furthermore, for typical 4-bit benchmark instances, the method consistently delivers competitive gate counts, matching or improving upon previous hypercube-based outcomes. Through the seamless integration of structure-informed guidance and coordinated optimization mechanisms, the framework preserves exceptional structural flexibility and algorithmic robustness, offering an effective, low-cost, and highly scalable avenue for reversible circuit synthesis.

Computers, materials & continua/Computers, materials & continua (Print)•Jan 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

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
Reversible circuits are the essential building blocks of quantum computers and have zero energy dissipation. However, there is no general rule on how to synthesize an effective circuit with minimal cost. Many researchers have placed a high value on the design of algorithms for reversible circuit synthesis as it is the fundamental component to implement in many paradigms, such as Shor’s algorithm. In this paper, the knowledge navigated quantum-inspired tabu search algorithm (KNQTS) is proposed to synthesize several benchmark functions. KNQTS is a quantum-inspired algorithm with the concept of getting closer to the best solution and keeping away from the worst solution, and it has a great search ability. Furthermore, the proposed algorithm uses self-adaptive, global-best guided and Quantum-Not gate mechanisms to make all procedures more efficient and avoid sticking to the local optimum. This paper also compares the KNQTS approach’s experimental results with those obtained via other metaheuristics and previous algorithms. Finally, the result shows that the proposed KNQTS method outperforms other state-of-the-art methods and achieves the same functionality at a lower cost. The solutions are optimal or near-optimal.
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.
Quantum circuit synthesis is a key technique in quantum computing. Traditional methods often generate circuits with high cost, making it crucial to produce correct and low-cost circuits efficiently. This study proposes the Amplitude-Ensemble Quantum-inspired Tabu Search (AE-QTS) algorithm for quantum Boolean circuit synthesis. AE-QTS demonstrates strong search capability with fewer parameters. Experimental results show that it outperforms other algorithms on low-bit problems and retains a certain level of synthesis ability on high-bit ones. However, the results also reveal that if the encoding frequently produces infeasible solutions, all algorithms will eventually fail, regardless of design. Therefore, future work should focus on developing encoding methods that consistently generate feasible solutions, which is essential for effectively applying metaheuristics to quantum Boolean circuit synthesis.
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.
Quantum logic reversible synthesis is a fundamental operation in quantum computing. One of the most challenging issues in this field resides in navigating the immense search space to synthesize the most compact circuit configurations, which are critical for realizing reliable, noise-free, and error-free quantum computing systems. To address this challenge, this study proposes a novel hypercube-encoded quantum-inspired optimization framework to formulate the synthesis task as a trajectory-finding process. This structure-informed domain knowledge transformation delivers exceptional search direction guidance, moving away from blind, black-box exploration. Specifically, by mapping the reversible functions onto the hypercube architecture, the framework embeds explicit dual Hamming-distance (HMD) guidance metrics into a global-best guided quantum-inspired tabu search (GQTS) engine. To minimize computational cost and enhance search efficiency, the framework incorporates a domain-informed initialization and couples a streamlined two-particle configuration with a global-best mechanism, thereby amplifying the efficiency of the underlying quantum-inspired updating mechanism to escape local optima and rapidly converge once a successfully synthesized superior path is locked. Under an online step relaxation mechanism, the framework preserves exceptional structural optimization flexibility without altering the underlying hypercube representation. The framework’s significance is rigorously evaluated against both rigid hypercube rule-based methods and generic randomized search-based heuristics, using gate count and exact-optimality as primary evaluation metrics. Extensive ablation studies first validate the individual and synergistic contributions of each core algorithmic component. Experimental results demonstrate that for the complete set of 3-bit reversible functions, the proposed HMD-guided GQTS (HMD-GQTS) framework achieves over 98% exact-optimal circuits in a single fine-tuned sweep, with selective retries attaining 100% exhaustive optimal coverage. Furthermore, for typical 4-bit benchmark instances, the method consistently delivers competitive gate counts, matching or improving upon previous hypercube-based outcomes. Through the seamless integration of structure-informed guidance and coordinated optimization mechanisms, the framework preserves exceptional structural flexibility and algorithmic robustness, offering an effective, low-cost, and highly scalable avenue for reversible circuit synthesis.
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.
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.