Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Group Theoretical Aspects of Reversible Logic Gates

Alexis De Vos, Gerald Jacobs, Leo Storme

Published Jan 1, 1999• 29 citations
Publisher
DOI
10.3217/jucs-005-05-0307

Related papers

Analysis of Reversible Logic Gates

Priyanka Priyanka, K M Rajesh

•Dec 8, 2017•1 citation

Group theoretical aspects of reversible logic gates

Leo Storme, Alexis De Vos, Gerald H. Jacobs

Logic gates with three input bits and three output bits have a privileged position within fundamental computer science: they are a sufficient building block for constructing arbitrary reversible boolean networks and therefore are the key to reversible digital computers. Such computers can, in principle, operate without heat production. As there exist as many as 8! = 40,320 different 3-bit reversible truth tables, the question arises as to which ones to choose as building blocks. Because these gates form a group with respect to the operation "cascading" , we can apply group theoretical tools, in order to make such a choice.

JUCS - Journal of Universal Computer Science•Jan 1, 1999•69 citations

Reversible Logic Gates

Kalyan S. Perumalla

Historically, logic gates have been used as building blocks for theoretical development of deterministic computation, and the assembled logic is realized in practice over physical processes such as composition of variable voltage levels in electronic circuit elements. However, much of the logic gate theory and design has focused on forward computation only, without explicit consideration of reversible execution. Here, we consider the reversibility aspect of traditional 2-bit gates and describe the concepts behind the development of reversible gates (which happen to require gates with at least 3 bit-wide inputs and outputs), and describe popular 3-bit reversible logic gates.

Chapman & Hall/CRC eBooks•Sep 10, 2013•0 citations

Group theory for reversible logic

Alexis De Vos, Yvan Van Rentergem

•Jan 1, 2006•0 citations

Group theory based reversible logic synthesis

Kamalika Datta, Indranil Sengupta, Hafizur Rahaman

With increase in emphasis on low-power design and quantum computation, research in reversible logic synthesis has gained great attention. Various methods of synthesis exist in the literature, like exact synthesis, heuristic approaches, methods based on group theory, and those based on higher level representation of functions like Binary Decision Diagram (BDD). In this paper a group theory based synthesis approach for reversible circuits is presented, using both positive-control and negative-control Toffoli gates. The method uses group theoretic rules for factoring permutation cycles for synthesis. The use of both positive and negative control Toffoli gates results in reduction of total number of gates required as compared to previous methods based on group theory. Several worked out examples illustrate the advantage of the proposed approach.

International Conference on Computers and Devices for Communication•Dec 1, 2012•5 citations

Algebraic Characterization of Reversible Logic Gates

Xiaoyu Song, Guowu Yang, Marek A. Perkowski +1 more

Theory of Computing Systems•Dec 20, 2004•31 citations
Logic gates with three input bits and three output bits have a privileged position within fundamental computer science: they are a sufficient building block for constructing arbitrary reversible boolean networks and therefore are the key to reversible digital computers. Such computers can, in principle, operate without heat production. As there exist as many as 8! = 40,320 different 3-bit reversible truth tables, the question arises as to which ones to choose as building blocks. Because these gates form a group with respect to the operation "cascading" , we can apply group theoretical tools, in order to make such a choice.
Historically, logic gates have been used as building blocks for theoretical development of deterministic computation, and the assembled logic is realized in practice over physical processes such as composition of variable voltage levels in electronic circuit elements. However, much of the logic gate theory and design has focused on forward computation only, without explicit consideration of reversible execution. Here, we consider the reversibility aspect of traditional 2-bit gates and describe the concepts behind the development of reversible gates (which happen to require gates with at least 3 bit-wide inputs and outputs), and describe popular 3-bit reversible logic gates.
With increase in emphasis on low-power design and quantum computation, research in reversible logic synthesis has gained great attention. Various methods of synthesis exist in the literature, like exact synthesis, heuristic approaches, methods based on group theory, and those based on higher level representation of functions like Binary Decision Diagram (BDD). In this paper a group theory based synthesis approach for reversible circuits is presented, using both positive-control and negative-control Toffoli gates. The method uses group theoretic rules for factoring permutation cycles for synthesis. The use of both positive and negative control Toffoli gates results in reduction of total number of gates required as compared to previous methods based on group theory. Several worked out examples illustrate the advantage of the proposed approach.