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

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

Tatsuya Nakano

Published Apr 25, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.5281/zenodo.19763790

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

Quantum gates

Pawan Kumar Verma, Mohit Kumar, Saurabh Singhal +1 more

This chapter delineates the theoretical and operational foundations of quantum gates, marking the radical transition from deterministic Boolean logic to the probabilistic, unitary formalism of quantum mechanics, and explores the mathematical elegance of gates as reversible operators acting within Hilbert space, where the preservation of probability amplitude fundamentally distinguishes them from irreversible classical counterparts. The discussion traverses the historical evolution of quantum computing, referencing pivotal contributions from Feynman to the Solovay–Kitaev theorem, while addressing the physical imperatives of gate fidelity and fault tolerance. Detailed analysis is provided for essential single-qubit components, including the Hadamard gate’s role in generating superposition and the Pauli group’s geometric rotations on the Bloch sphere. Furthermore, this chapter examines the Controlled-NOT gate as the critical enabler of entanglement and quantum parallelism. By synthesizing matrix algebra with physical implementation challenges—ranging from decoherence to the no-cloning theorem—this chapter establishes the necessary framework for understanding universal gate sets. Ultimately, it provides a rigorous yet accessible roadmap for constructing the complex quantum circuits that underpin advanced algorithms and error-correction protocols.

CRC Press eBooks•Nov 6, 2026•0 citations

Many-valued Logics in Classical and Quantum Gates

Carlos Lungarzo

The research on many valued interpretation in quantum computing [1,3] is rather recent and the theory is not fully developed yet. The main advantage of this approach seems to be the complexity gain when a computation is based upon general quantum digits (usually called qudits) if compared with time spent by the same algorithm, when running in a equivalent system built up by means of qubits (binary digits). If this assumption is sound, then temporal complexity of algorithms could be significantly simplified. The use of many-valued semantics in classical logic doesn't convey any precise idea of its physical application, as it happens in the framework of quantum gates. However, we propose an analysis motivated by the known use of finite-many-valued semantic in non-quantum logics. We shall produce a propositional representation for classical gates. We make explicit the usually implicit relationship between classical and quantum logics, extend in a natural way the many-valued semantics, as used in axiomatic systems of classical logical, to the quantum case (by using Toffoli gate and algebraic properties), define many-valued digits (qu-d-its) and reversible gates based upon them, and extend the functional completeness (“universality”) of some gates to the new situation. We conjecture the possibility of enhancing the performance of quantum algorithms, when running in a many-valued quantum system.

Logic Journal of IGPL•Jan 1, 2005•2 citations

Reversible Computing Foundations in Quantum Computation: From Classical Logic to Quantum Algorithms

Keval Barvaliya

Reversible computing provides a foundational framework for understanding quantum computation.This paper first examines classical reversible logic gates, including the CNOT and Toffoli gates, and demonstrates how they can simulate arbitrary Boolean functions.We then extend these concepts to quantum gates and circuits, where all operations are inherently unitary and reversible.Quantum algorithms such as the Deutsch-Jozsa algorithm, phase estimation, and Shor's factoring algorithm are discussed to illustrate how reversibility enables exponential computational speedups.Finally, current challenges and future directions in quantum hardware and algorithm design are presented.Highlighting the essential role of reversible computing in the realisation of practical quantum computers.

Advances in intelligent systems research/Advances in Intelligent Systems Research•Jan 1, 2026•3 citations

Reversible logic

W. David Pan, M. Nalasani

This work presents the logical reversibility. The inputs and outputs of reversible logic gates can be uniquely retrievable from each other. The reversible logic operations can't erase information and dissipate zero heat. The circuit actually operates in a backward operation, allows reproducing the inputs from the outputs and consumes zero power. As the basic elements of any logic circuit, logic gates are used to realize Boolean functions. By combining reversible logic gates, reversible circuits can perform complex logical and arithmetic operations. A one-to-one mapping between inputs and outputs is realized. The logical operations run backwards by cascading a reversible logic gate with its dual (inverse). Reversible circuits are also called lossless circuits, as there is neither energy loss nor information loss. These circuits are very attractive for applications where extremely low power consumption, or heat dissipation, is desirable in areas ranging from communications, low power VLSI (very large-scale integration) technology, optical computing to nanotechnology. Reversible logic found to be very useful in quantum computing where the quantum evolution is inherently reversible.

IEEE Potentials•Feb 1, 2005•56 citations

An Algorithm for Reversible Logic Circuit Synthesis Based on Tensor Decomposition

Hochang Lee, Kyung Chul Jeong, Daewan Han +1 more

An algorithm for reversible logic synthesis is proposed. The task is, for a given n -bit substitution map, to find a sequence of reversible logic gates that implements the map. The gate library adopted in this work consists of multiple-controlled Toffoli gates with m control bits, where \(m \in \lbrace 0, \ldots , n-1\rbrace\) . Controlled gates with large m (> 2) are then further decomposed into smaller gates ( \(m \le 2\) ). A primary goal in designing the algorithm is to reduce the number of Toffoli gates, which is known to be universal. The main idea is to view an n -bit substitution map as a rank-2 n tensor and to transform it such that the resulting map can be written as a tensor product of a rank-(2 n -2) tensor and the 2× 2 identity matrix. It can then be seen that the transformed map acts nontrivially on n -1 bits only, meaning that the map to be synthesized becomes ( n -1)-bit substitution. This size reduction process is iteratively applied until it reaches a tensor product of only 2× 2 matrices. The time complexity of the algorithm is exponential in n , as most previously known heuristic algorithms for reversible logic synthesis are, but it terminates within reasonable time for not too large n , which may find practical uses. As stated earlier, our primary target is to reduce the number of Toffoli gates in the output circuit. Benchmark results show that the algorithm works well for hard benchmark functions, but it does not seem advantageous when the function is structured. As an application, the algorithm is applied to find reversible circuits for cryptographic substitution boxes, which are often required in quantum cryptanalysis.

arXiv:2107.04298•ACM Transactions on Quantum Computing•Jun 18, 2024•6 citations
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.
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.
This chapter delineates the theoretical and operational foundations of quantum gates, marking the radical transition from deterministic Boolean logic to the probabilistic, unitary formalism of quantum mechanics, and explores the mathematical elegance of gates as reversible operators acting within Hilbert space, where the preservation of probability amplitude fundamentally distinguishes them from irreversible classical counterparts. The discussion traverses the historical evolution of quantum computing, referencing pivotal contributions from Feynman to the Solovay–Kitaev theorem, while addressing the physical imperatives of gate fidelity and fault tolerance. Detailed analysis is provided for essential single-qubit components, including the Hadamard gate’s role in generating superposition and the Pauli group’s geometric rotations on the Bloch sphere. Furthermore, this chapter examines the Controlled-NOT gate as the critical enabler of entanglement and quantum parallelism. By synthesizing matrix algebra with physical implementation challenges—ranging from decoherence to the no-cloning theorem—this chapter establishes the necessary framework for understanding universal gate sets. Ultimately, it provides a rigorous yet accessible roadmap for constructing the complex quantum circuits that underpin advanced algorithms and error-correction protocols.
The research on many valued interpretation in quantum computing [1,3] is rather recent and the theory is not fully developed yet. The main advantage of this approach seems to be the complexity gain when a computation is based upon general quantum digits (usually called qudits) if compared with time spent by the same algorithm, when running in a equivalent system built up by means of qubits (binary digits). If this assumption is sound, then temporal complexity of algorithms could be significantly simplified. The use of many-valued semantics in classical logic doesn't convey any precise idea of its physical application, as it happens in the framework of quantum gates. However, we propose an analysis motivated by the known use of finite-many-valued semantic in non-quantum logics. We shall produce a propositional representation for classical gates. We make explicit the usually implicit relationship between classical and quantum logics, extend in a natural way the many-valued semantics, as used in axiomatic systems of classical logical, to the quantum case (by using Toffoli gate and algebraic properties), define many-valued digits (qu-d-its) and reversible gates based upon them, and extend the functional completeness (“universality”) of some gates to the new situation. We conjecture the possibility of enhancing the performance of quantum algorithms, when running in a many-valued quantum system.
Reversible computing provides a foundational framework for understanding quantum computation.This paper first examines classical reversible logic gates, including the CNOT and Toffoli gates, and demonstrates how they can simulate arbitrary Boolean functions.We then extend these concepts to quantum gates and circuits, where all operations are inherently unitary and reversible.Quantum algorithms such as the Deutsch-Jozsa algorithm, phase estimation, and Shor's factoring algorithm are discussed to illustrate how reversibility enables exponential computational speedups.Finally, current challenges and future directions in quantum hardware and algorithm design are presented.Highlighting the essential role of reversible computing in the realisation of practical quantum computers.
This work presents the logical reversibility. The inputs and outputs of reversible logic gates can be uniquely retrievable from each other. The reversible logic operations can't erase information and dissipate zero heat. The circuit actually operates in a backward operation, allows reproducing the inputs from the outputs and consumes zero power. As the basic elements of any logic circuit, logic gates are used to realize Boolean functions. By combining reversible logic gates, reversible circuits can perform complex logical and arithmetic operations. A one-to-one mapping between inputs and outputs is realized. The logical operations run backwards by cascading a reversible logic gate with its dual (inverse). Reversible circuits are also called lossless circuits, as there is neither energy loss nor information loss. These circuits are very attractive for applications where extremely low power consumption, or heat dissipation, is desirable in areas ranging from communications, low power VLSI (very large-scale integration) technology, optical computing to nanotechnology. Reversible logic found to be very useful in quantum computing where the quantum evolution is inherently reversible.
An algorithm for reversible logic synthesis is proposed. The task is, for a given n -bit substitution map, to find a sequence of reversible logic gates that implements the map. The gate library adopted in this work consists of multiple-controlled Toffoli gates with m control bits, where m∈{0,…,n−1}m \in \lbrace 0, \ldots , n-1\rbracem∈{0,…,n−1} . Controlled gates with large m (> 2) are then further decomposed into smaller gates ( m≤2m \le 2m≤2 ). A primary goal in designing the algorithm is to reduce the number of Toffoli gates, which is known to be universal. The main idea is to view an n -bit substitution map as a rank-2 n tensor and to transform it such that the resulting map can be written as a tensor product of a rank-(2 n -2) tensor and the 2× 2 identity matrix. It can then be seen that the transformed map acts nontrivially on n -1 bits only, meaning that the map to be synthesized becomes ( n -1)-bit substitution. This size reduction process is iteratively applied until it reaches a tensor product of only 2× 2 matrices. The time complexity of the algorithm is exponential in n , as most previously known heuristic algorithms for reversible logic synthesis are, but it terminates within reasonable time for not too large n , which may find practical uses. As stated earlier, our primary target is to reduce the number of Toffoli gates in the output circuit. Benchmark results show that the algorithm works well for hard benchmark functions, but it does not seem advantageous when the function is structured. As an application, the algorithm is applied to find reversible circuits for cryptographic substitution boxes, which are often required in quantum cryptanalysis.