Reversible logic circuits have been historically motivated by theoretical research in low-
power electronics as well as practical improvement of bit manipulation transforms in …

Synthesis of reversible logic has become an active research area in the last years. But many
proposed algorithms are evaluated with a small set of benchmarks only. Furthermore, results …

Recently a large amount of research has been devoted to automatic activity analysis.
Typically, activities have been defined by their motion characteristics and represented by …

The decision problem of quantified Boolean formulas (QBFs) is the archetypical problem for
the complexity class PSPACE. Beside such theoretical aspects QBF also provides an …

This paper presents a rewriting method for Boolean circuits that minimizes small subcircuits
with exact synthesis. Individual synthesis tasks are encoded as Quantified Boolean …

Few books comprehensively cover the software and programming aspects of reversible
computing. Filling this gap, Introduction to Reversible Computing offers an expanded view of …

Circuit synthesis is the task of decomposing a given logical functionality into a sequence of
elementary gates. It is (depth-) optimal if it is impossible to achieve the desired functionality …

This communication presents the complete design of a reversible arithmetic logic unit (ALU)
that can be part of a programmable reversible computing device such as a quantum …

This study introduces a new optimization model and a branch-and-cut approach for
synthesizing optimal quantum circuits for reversible Boolean functions, which are pivotal …

Synthesis of reversible and quantum logic has become an intensely studied topic in the last
years. However, most synthesis methods are limited, since they rely on a truth table …