Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Zakablukov, Dmitry V."'
Autor:
Zakablukov, Dmitry V.
In this paper, reversible circuits consisting of NOT, CNOT and 2-CNOT gates are studied. Several asymptotically optimal by the order of magnitude synthesis methods are described. Some circuit's complexity reduction approaches are considered. Implemen
Externí odkaz:
http://arxiv.org/abs/1806.00687
Autor:
Zakablukov, Dmitry V.
The paper discusses the gate complexity of reversible circuits with the small number of additional inputs consisting of NOT, CNOT and 2-CNOT gates. We study Shannon's gate complexity function $L(n, q)$ for a reversible circuit implementing a Boolean
Externí odkaz:
http://arxiv.org/abs/1802.02346
Autor:
Zakablukov, Dmitry V.
The paper discusses the gate complexity and the depth of reversible circuits consisting of NOT, CNOT and 2-CNOT gates in the case, when the number of additional inputs is limited. We study Shannon's gate complexity function $L(n, q)$ and depth functi
Externí odkaz:
http://arxiv.org/abs/1702.08045
Autor:
Zakablukov, Dmitry V.
The paper discusses various applications of permutation group theory in the synthesis of reversible logic circuits consisting of Toffoli gates with negative control lines. An asymptotically optimal synthesis algorithm for circuits consisting of gates
Externí odkaz:
http://arxiv.org/abs/1507.04309
Autor:
Zakablukov, Dmitry V.
The reversible logic can be used in various research areas, e.g. quantum computation, cryptography and signal processing. In the paper we study reversible logic circuits with additional inputs, which consist of NOT, CNOT and C\textsuperscript{2}NOT g
Externí odkaz:
http://arxiv.org/abs/1505.02372
Autor:
Zakablukov, Dmitry V.
The paper discusses the asymptotic depth of a reversible circuit consisting of NOT, CNOT and 2-CNOT gates. Reversible circuit depth function $D(n, q)$ for a circuit implementing a transformation $f\colon \mathbb Z_2^n \to \mathbb Z_2^n$ is introduced
Externí odkaz:
http://arxiv.org/abs/1501.04344
Autor:
Zakablukov, Dmitry V.
The paper discusses the gate complexity of reversible circuits consisting of NOT, CNOT and 2-CNOT gates. The Shannon gate complexity function $L(n, q)$ for a reversible circuit, implementing a Boolean transformation $f\colon \mathbb Z_2^n \to \mathbb
Externí odkaz:
http://arxiv.org/abs/1412.2662
Autor:
Zakablukov, Dmitry V.
Publikováno v:
In Journal of Computer and System Sciences March 2017 84:132-143
Autor:
Zakablukov, Dmitry V.
Publikováno v:
Discrete Mathematics & Applications; Dec2022, Vol. 32 Issue 6, p439-444, 6p
Autor:
Zakablukov, Dmitry V.
Publikováno v:
Discrete Mathematics & Applications; Aug2022, Vol. 32 Issue 4, p279-284, 6p