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 theory for reversible logic

Alexis De Vos, Yvan Van Rentergem

Published Jan 1, 2006• 0 citations
OpenAlex

Related papers

Application of Permutation Group Theory in Reversible Logic Synthesis

Dmitry Vladimirovich Zakablukov

arXiv:1507.04309•Lecture notes in computer science•Jan 1, 2016•16 citations

Group Theoretical Aspects of Reversible Logic Gates

Alexis De Vos, Gerald Jacobs, Leo Storme

•Jan 1, 1999•29 citations

Group Theory Based Synthesis of Binary Reversible Circuits

Guowu Yang, Xiaoyu Song, William N. N. Hung +2 more

Lecture notes in computer science•Jan 1, 2006•38 citations

Synthesis of ternary non-reversible logic circuits

Xiaoyu Li, Guowu Yang, Desheng Zheng

Reversible quantum circuits are a necessary subclass of quantum computation and its realization is required for any quantum computer to be universal. This paper investigates how to synthesis of arbitrary ternary non-reversible logic circuits by adding inputs with constant value and garbage outputs. Group theory has been also used to solve the synthesis of reversible logic circuits. Our algorithm uses the SNT (ternary Swap gate, ternary NOT gate, ternary Toffoli gate) library, by reducing the ternary non-reversible logic circuit synthesis problem to group theory representation. The main result shows the relationship of ternary non-reversible logic circuits and the reversible circuits. The realization approach is constructive and can be further used to develop software for synthesis of arbitrary d-level circuits. This result is significantly different from the binary non-reversible logic circuits.

IEEE Congress on Evolutionary Computation (CEC)•Jul 1, 2010•1 citation

Reversible computing: from mathematical group theory to electronical circuit experiment

Alexis De Vos, Yvan Van Rentergem

Reversible logic gates of a certain logic width w form a group (isomorphic to the symmetric group of order (2 w )!). Study of the subgroups of this group both teaches us a lot about properties of reversible gates and guides us to synthesize particular circuits. After design, circuits are implemented in prototype silicon chips.

ACM International Conference on Computing Frontiers (CF)•May 4, 2005•29 citations

Reversible Logic: Fundamentals and New Results

Anas N. Al‐Rabadi

Springer eBooks•Jan 1, 2004•4 citations
Reversible quantum circuits are a necessary subclass of quantum computation and its realization is required for any quantum computer to be universal. This paper investigates how to synthesis of arbitrary ternary non-reversible logic circuits by adding inputs with constant value and garbage outputs. Group theory has been also used to solve the synthesis of reversible logic circuits. Our algorithm uses the SNT (ternary Swap gate, ternary NOT gate, ternary Toffoli gate) library, by reducing the ternary non-reversible logic circuit synthesis problem to group theory representation. The main result shows the relationship of ternary non-reversible logic circuits and the reversible circuits. The realization approach is constructive and can be further used to develop software for synthesis of arbitrary d-level circuits. This result is significantly different from the binary non-reversible logic circuits.