Skip to main content

Advertisement

Log in

Algebraic Characterization of Reversible Logic Gates

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Xiaoyu Song, Marek Perkowski or Yuke Wang.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-004-1166-2

Keywords