On Reversible Combinatory Logic

TL;DR: In this article, the authors present a synthesis approach for reversible logic circuits that relies on Boolean function representations, e.g., truth tables or decision diagrams, instead of Boolean functions.

TL;DR: This tutorial focuses on a high-level reversible programming language Janus, which is simple, yet powerful, and its constructs can serve as a model for designing reversible languages in general.

TL;DR: In this paper , the authors present a quantum machine model that supports both quantum effects on data and data-dependent control flow, using variants of conditional jump with injective semantics, and identify the necessary condition for programs for such a machine to preserve superposition of data.

TL;DR: Reversible logic serves as a basis for emerging technologies like quantum computing and additionally has applications in low-power design, and how to efficiently synthesize complex reversible circuits is an important question.

TL;DR: This result makes plausible the existence of thermodynamically reversible computers which could perform useful computations at useful speed while dissipating considerably less than kT of energy per logical step.

TL;DR: Introduction Classical computation Quantum computation Solutions Elementary number theory Bibliography Index.