An Algorithm for Synthesis of Optimal 3-qubit Reversible Circuits Based on Bit Operation

We use bit operation to construct the novel and perfect Hash function and present an efficient algorithm which can construct optimal quantum reversible logic circuits with various types of gates by using the Hash table and produce quantum circuits with minimal cost in theory. Judging by the internat...

Full description

Saved in:
Bibliographic Details
Published in2008 Second International Conference on Genetic and Evolutionary Computing pp. 455 - 458
Main Authors Zhiqiang Li, Hanwu Chen, Baowen Xu, Xiaoyu Song, Xiling Xue
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.09.2008
Subjects
Algorithm design and analysis
Artificial neural networks
Bit operation
Computers
Libraries
Logic circuits
Logic gates
Perfect Hash Function
Quantum circuit optimization
Quantum computing
Reversible logic circuit
Online AccessGet full text

Cover

More Information
Summary:We use bit operation to construct the novel and perfect Hash function and present an efficient algorithm which can construct optimal quantum reversible logic circuits with various types of gates by using the Hash table and produce quantum circuits with minimal cost in theory. Judging by the internationally recognized reversible functions of three variables, the algorithm not only synthesizes all optimal reversible logic circuits, but also runs extremely faster than other ones. The experimental results show that the average speed of the algorithm which synthesizes circuit with minimum length is 69.8 times that of currently best result [9].
ISBN:9780769533346
0769533345
DOI:10.1109/WGEC.2008.37