The Classification of Reversible Bit Operations

DOI10.4230/LIPICS.ITCS.2017.23zbMath1404.68042arXiv1504.05155OpenAlexW2962894666MaRDI QIDQ4638073

Daniel Grier, Luke Schaeffer, Scott Aaronson

Publication date: 3 May 2018

Full work available at URL: https://arxiv.org/abs/1504.05155

zbMATH Keywords

reversible computationcircuit synthesisBoolean logicPost's latticereversible gatesgate classification

Mathematics Subject Classification ID

Quantum computation (81P68)

Related Items (8)

The Classification of Reversible Bit Operations ⋮ The Group of Reversible Turing Machines ⋮ Strongly Universal Reversible Gate Sets ⋮ Galois connection for multiple-output operations ⋮ Universal groups of cellular automata ⋮ The Category TOF ⋮ No Tits alternative for cellular automata ⋮ Universal gates with wires in a row

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conservative logic
• Universal affine classification of Boolean functions
• Complexity Classification of Local Hamiltonian Problems
• Synthesis and optimization of reversible circuits—a survey
• Irreversibility and Heat Generation in the Computing Process
• The Classification of Reversible Bit Operations
• r-Universal reversible logic gates
• ALGORITHMIC PROBLEMS IN VARIETIES
• Function Algebras on Finite Sets
• Logical Reversibility of Computation
• Machines, Computations, and Universality
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)

This page was built for publication: The Classification of Reversible Bit Operations