Bibliographic Details
| Title: |
Algebraic Characterization of Reversible Logic Gates. |
| Authors: |
Xiaoyu Song1 song@ece.pdx.edu, Guowu Yang1, Perkowski, Marek1 mperkows@ece.pdx.edu, Yuke Wang2 yuke@utdallas.edu |
| Source: |
Theory of Computing Systems. Mar/Apr2006, Vol. 39 Issue 2, p311-319. 9p. 3 Charts. |
| Subjects: |
Computer arithmetic & logic units, Computer logic, Boolean algebra, Quantum computers, Computer circuits, Computer systems |
| Abstract: |
Reversible logic plays an important role in quantum computing. This paper investigates the universality and composition power of various known and new reversible gates. We present the algebraic characterization of selected new families of Boolean reversible gates. Some theoretical results on the relation between reversible w*w gates and the corresponding symmetric group are derived. Different combinations of reversible gate classes are proven to generate the entire class of reversible w*w gates. [ABSTRACT FROM AUTHOR] |
|
Copyright of Theory of Computing Systems is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
