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.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Song, X., Yang, G., Perkowski, M. et al. Algebraic Characterization of Reversible Logic Gates. Theory Comput Syst 39, 311–319 (2006). https://doi.org/10.1007/s00224-004-1166-2
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-004-1166-2