Synthesis of reversible logic circuits

By Vivek V. Shende, Aditya K. Prasad, Igor L. Markov, John Patrick Hayes. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2003

564 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/262b21de4b4801792cbac45ddcaf47f958202588

How researchers see this paper

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

In Artificial Intelligence

In Computational Theory and Mathematics

Citations in the corpus

Synthesis of quantum-logic circuits (2004, unknown): “Abstract The pressure of fundamental limits on classical computation and the promise of exponential speedups from quantum effects have recently brought quantum circuits [10] to the attention of the Electronic Design Automation community [18, 28, 7, 27, 17].”
An Algorithm for Synthesis of Reversible Logic Circuits (2006, methodology): “An exhaustive algorithm is presented in [16], which generates all possible circuits containing k gates for increasing values of k until a circuit is found that implements the given speciﬁcation.”
Improved Simulation of Stabilizer Circuits (2004, methodology): “or example, that of Aharonov and Ben-Or [2]) are based on stabilizer codes. Although there has been some previous work on synthesizing CNOT circuits [16, 23] and general classical reversible circuits [24, 17], to our knowledge there has not been work on synthesizing stabilizer circuits. In this sect”
A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits (2012, methodology): “Maslov and Miller [18] also examined synthesis of 3-bit circuits over this gate set, using a pruned breadth-first search similar to [27] rather than formal methods.”
BDD-based synthesis of reversible logic for large functions (2009, background): “For a restricted gate library leading to smaller quantum cost and thus only consisting of NOT, CNOT and two-controlled Toffoli gates (the same as applied for the substitutions in Figure 4 and Table 1), functions can be synthesized with at most n NOT gates, n(2) CNOT gates, and 9n2 + o(n2) two-contro”
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].”