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

Theory of Computing Systems

Algebraic Characterization of Reversible Logic Gates

Xiaoyu Song, Guowu Yang, Marek A. Perkowski, Yuke Wang

Published Dec 20, 2004• 31 citations
Publisher
DOI
10.1007/s00224-004-1166-2

Related papers

Mobius Reversible Logic: ¨ A Matrix-Based Universal Model of Reversible Computation

Tatsuya Nakano

We introduce Mobius Reversible Logic, a new ¨ algebraic framework for reversible computation based on large-base digit-region matrix embeddings, determinant- sign inversion, and matrix-based gate composition. Each Boolean variable is encoded as a 2 × 2 integer matrix with a dedicated high-magnitude digit region, ensuring non- interference under matrix multiplication. Logical negation is implemented as a determinant-sign flip, and reversible gate operations correspond to structured matrix products. The model provides a dual semantics: (1) an operational semantics via reversible gate sequences (NOT, CNOT, Toffoli), and (2) an algebraic semantics via matrix mul- tiplication. We show that all matrices in the system remain invertible, that the model preserves information, and that it is universal by representing a complete reversible gate set. Mobius Reversible Logic thus establishes a new matrix- ¨ theoretic foundation for reversible computation.

•Apr 24, 2026•0 citations

Analysis of Reversible Logic Gates

Priyanka Priyanka, K M Rajesh

•Dec 8, 2017•1 citation

Mobius Reversible Logic: ¨ A Matrix-Based Universal Model of Reversible Computation

Tatsuya Nakano

Abstract—We introduce Mobius Reversible Logic, a new ¨ algebraic framework for reversible computation based on large-base digit-region matrix embeddings, determinant- sign inversion, and matrix-based gate composition. Each Boolean variable is encoded as a 2 × 2 integer matrix with a dedicated high-magnitude digit region, ensuring non- interference under matrix multiplication. Logical negation is implemented as a determinant-sign flip, and reversible gate operations correspond to structured matrix products. The model provides a dual semantics: (1) an operational semantics via reversible gate sequences (NOT, CNOT, Toffoli), and (2) an algebraic semantics via matrix mul- tiplication. We show that all matrices in the system remain invertible, that the model preserves information, and that it is universal by representing a complete reversible gate set. Mobius Reversible Logic thus establishes a new matrix- ¨ theoretic foundation for reversible computation.

•Apr 25, 2026•0 citations

Group Theoretical Aspects of Reversible Logic Gates

Alexis De Vos, Gerald Jacobs, Leo Storme

•Jan 1, 1999•29 citations

Permutation Algebra for Constructing Reversible Circuits

Shah Mohammad Bahauddin, Abu Ashik Irfan

In this paper, we show that the algebra of permutation group is one of the inherent structures of reversible logic for quantum computation. In this venture, we discuss necessary properties of cycle and transposition to reveal the potential of permutation algebra for reversible logic. Then we present an efficient method which naturally interconnects the structure of reversible logic with the expression of cycle and corresponding transpositions. Finally we discuss several examples which show that the algebra can be effectively used to construct complex gates as well.

Journal of Quantum Information Science•Jan 1, 2012•3 citations

Decompositions of reversible logic circuits

Marek Szyprowski, Paweł Kerntopf

Pomiary Automatyka Kontrola•Jan 1, 2009•2 citations
We introduce Mobius Reversible Logic, a new ¨ algebraic framework for reversible computation based on large-base digit-region matrix embeddings, determinant- sign inversion, and matrix-based gate composition. Each Boolean variable is encoded as a 2 × 2 integer matrix with a dedicated high-magnitude digit region, ensuring non- interference under matrix multiplication. Logical negation is implemented as a determinant-sign flip, and reversible gate operations correspond to structured matrix products. The model provides a dual semantics: (1) an operational semantics via reversible gate sequences (NOT, CNOT, Toffoli), and (2) an algebraic semantics via matrix mul- tiplication. We show that all matrices in the system remain invertible, that the model preserves information, and that it is universal by representing a complete reversible gate set. Mobius Reversible Logic thus establishes a new matrix- ¨ theoretic foundation for reversible computation.
Abstract—We introduce Mobius Reversible Logic, a new ¨ algebraic framework for reversible computation based on large-base digit-region matrix embeddings, determinant- sign inversion, and matrix-based gate composition. Each Boolean variable is encoded as a 2 × 2 integer matrix with a dedicated high-magnitude digit region, ensuring non- interference under matrix multiplication. Logical negation is implemented as a determinant-sign flip, and reversible gate operations correspond to structured matrix products. The model provides a dual semantics: (1) an operational semantics via reversible gate sequences (NOT, CNOT, Toffoli), and (2) an algebraic semantics via matrix mul- tiplication. We show that all matrices in the system remain invertible, that the model preserves information, and that it is universal by representing a complete reversible gate set. Mobius Reversible Logic thus establishes a new matrix- ¨ theoretic foundation for reversible computation.
In this paper, we show that the algebra of permutation group is one of the inherent structures of reversible logic for quantum computation. In this venture, we discuss necessary properties of cycle and transposition to reveal the potential of permutation algebra for reversible logic. Then we present an efficient method which naturally interconnects the structure of reversible logic with the expression of cycle and corresponding transpositions. Finally we discuss several examples which show that the algebra can be effectively used to construct complex gates as well.