Jul 22, 2014 · Since single-target gates can be mapped to a cascade of Toffoli gates, this synthesis algorithm provides an interesting framework for reversible ...

Abstract. Reversible single-target gates are a generalization of Toffoli gates which are a helpful formal representation for the description of synthesis ...

The paper motivates this framework for reversible circuit complexity, illustrates first possible applications based on it, and proves a linear upper bound ...

ABSTRACT We present fast algorithms to synthesize exact minimal reversible circuits for various types of gate and cost. By reducing reversible logic synthesis ...

Mar 7, 2016 · In this paper we derive tighter upper bounds for the number of gates that are required to implement a reversible function in a reversible or quantum circuit.

Jan 30, 2016 · In this paper, we connect this problem with the multiplicative complexity analysis of classical Boolean functions.

The complexity of reversible logic synthesis is studied for bounded-ancilla and ancilla-free optimal synthesis approaches and the computational complexity ...

Jul 13, 2024 · An algorithm for reversible logic synthesis is proposed. The task is, for a given n-bit substitution map, to find a sequence of reversible logic gates that ...

Feb 17, 2016 · Abstract. We provide an extensive overview of upper bounds on the number of gates needed in reversible and quantum circuits.

Jun 1, 2022 · ABSTRACT In quantum computing the decoherence time of the qubits determines the computation time available, and this time is very limited ...