Quantum-Inspired Tabu Search Algorithm for reversible logic circuit synthesis
- Resource Type
- Conference
- Authors
- Wang, Wen-Hsin; Chiu, Chia-Hui; Kuo, Shu-Yu; Huang, Sheng-Fei; Chou, Yao-Hsin
- Source
- 2012 IEEE International Conference on Systems, Man, and Cybernetics (SMC) Systems, Man, and Cybernetics (SMC), 2012 IEEE International Conference on. :709-714 Oct, 2012
- Subject
- Bioengineering
Communication, Networking and Broadcast Technologies
Components, Circuits, Devices and Systems
Computing and Processing
Fields, Waves and Electromagnetics
Signal Processing and Analysis
Robotics and Control Systems
Logic gates
Logic circuits
Quantum computing
Optimization
Evolutionary computation
Vectors
Wires
- Language
- ISSN
- 1062-922X
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.