This PhD dissertation investigates garbage-free reversible computing systems from abstract
design to physical gate-level implementation. Designed in reversible logic, we propose a …

Encryption is a special case of conditional loss-less transformation and is, thus, interesting to
study from the perspective of reversible computations. In this paper we investigate some of …

NASA's proposed Soil Moisture Active and Passive (SMAP) mission would provide global
soil moisture content and freeze/thaw state measurements with a minimum repeat period of …

Quantum computation on w qubits is represented by the infinite unitary group U (2 w);
classical reversible computation on w bits is represented by the finite symmetric group S 2 w …

Multiplication of integers is non-injective and, thus, requires garbage lines for any reversible
logic implementation. However, multiplying with a fixed constant is injective, and should …

Quantum computing and circuits are of growing interest and so is reversible logic as it plays
an important role in the synthesis of quantum circuits. Moreover, reversible logic provides an …

We present a method for constructing reversible circuitry for multiplying integers by arbitrary
integer constants. The method is based on Mealy machines and gives circuits whose size …

Reversible simulations can realize any irreversible computation on any r-Turing complete
reversible computation model at the expense of additional garbage output. The problem of …

Reversible computing spans computational models that are both forward and backward
deterministic. These models have applications in program inversion and bidirectional …

We propose clean reversible simulations of ranking binary trees and unranking as reversible
algorithms for reversible computing systems, which are useful for enumerating and randomly …