37 citations · 51 across the 4 of their papers we have counts for
4 papers
Ancilla-free synthesis of large reversible functions using binary decision diagrams
Mathias Soeken, Laura Tague, Gerhard W. Dueck +1
The synthesis of reversible functions has been an intensively studied research area in the last decade. Since almost all proposed approaches rely on representations of exponential…
Embedding of Large Boolean Functions for Reversible Logic
Mathias Soeken, Robert Wille, Oliver Keszocze +2
Reversible logic represents the basis for many emerging technologies and has recently been intensively studied. However, most of the Boolean functions of practical interest are irr…
A framework for reversible circuit complexity
Mathias Soeken, Nabila Abdessaied, Rolf Drechsler
Reversible single-target gates are a generalization of Toffoli gates which are a helpful formal representation for the description of synthesis algorithms but are too general for a…
Synthesis of Reversible Functions Beyond Gate Count and Quantum Cost
Robert Wille, Mehdi Saeedi, Rolf Drechsler
Many synthesis approaches for reversible and quantum logic have been proposed so far. However, most of them generate circuits with respect to simple metrics, i.e. gate count or qua…