A transformation based algorithm for reversible logic synthesis

By D. M. Miller, Dmitri Maslov, G. Dueck. Proceedings - Design Automation Conference, 2003

555 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

An Algorithm for Synthesis of Reversible Logic Circuits (2006, methodology): “The ﬁrst two examples are from [7].”
RevLib: An Online Resource for Reversible Functions and Reversible Circuits (2008, methodology): “[16, 13, 1, 10, 8, 18, 19, 7]) using the different gate libraries including (multiple control) Toffoli gates [17], Fredkin gates [5], Peres gates [14], and elementary quantum gates [3].”
An Efficient Methodology for Mapping Quantum Circuits to the IBM QX Architectures (2017, background): “In case the desired quantum functionality is not provided in OpenQASM, decomposition or synthesis approaches such as those proposed in [10]–[13] and [26]–[28], respectively, can be applied which determine (e.g., depth optimal) realizations of quantum functionality for speciﬁc libraries like…”
Synthesis and optimization of reversible circuits—a survey (2011, methodology): “Transformation-based methods [Miller et al. 2003; Maslov et al. 2007] iteratively select a gate so as to make a function s truth table or RM spectrum more similar to the identity function.”