On the gate complexity of reversible circuits consisting of NOT, CNOT and 2-CNOT gates
-
Dmitry V. Zakablukov
Abstract
The paper is concerned with the problem of complexity of reversible circuits consisting of NOT, CNOT and 2-CNOT gates. For a reversible circuit implementing a map
Originally published in Diskretnaya Matematika (2016) 28, №2, 12–26 (in Russian).
References
[1] Shannon C. E., “The synthesis of two-terminal switching circuits”, Bell System Tech. J., 28:8 (1949), 59–98.10.1002/j.1538-7305.1949.tb03624.xSearch in Google Scholar
[2] Yablonsky S.V., Introduction to Discrete Mathematics, Mir Publishers, Moscow, 2003 (in Russian), 384 pp.Search in Google Scholar
[3] Karpova N. A., “On calculations with limited memory”, Matematicheskie voprosy kibernetiki, 2 (1989), 131-144 (in Russian).Search in Google Scholar
[4] Feynman R., “Quantum Mechanical Computers”, Optic News, 11:2 (1985), 11–20.10.1364/CLEO.1984.TUAA2Search in Google Scholar
[5] Maslov D. A., Reversible Logic Synthesis, Ph. D. Thesis, Univ. New Brunswick, 2003, 165 pp.Search in Google Scholar
[6] Zakablukov D. V., “Reducing the gate complexity of reversible circuits without the using of tables of equivalent replacements gates compositions”, Nauka i obrazovanie. MGTU im. N. E. Baumana. Elektron. zhurn., 2014, №3 (in Russian).10.7463/0314.0699195Search in Google Scholar
[7] Shende V. V., Prasad A. K., Markov I. L., Hayes J. P., “Synthesis of Reversible Logic Circuits”, IEEE Trans. Comput.-Aid. Des. Integr. Circuits Syst., 22:6 (2006), 710–722.10.1109/TCAD.2003.811448Search in Google Scholar
[8] Zakablukov D. V., Zhukov A. E., “The research of schemes of reversible logic elements”, Informatika i sistemy upravleniya v XXI veke, Sbornik trudov №9 molodykh uchenykh, aspirantov i studentov, MGTU im. N. E. Baumana, Moscow, 2012, 148–157 (in Russian).Search in Google Scholar
[9] Zakablukov D. V., “Fast algorithm for synthesis of reversible circuits based on the permutation groups theory”, Prikladnaya diskretnaya matematika, 2014, №2, 101–109 (in Russian).10.17223/20710410/24/9Search in Google Scholar
[10] Glukhov M. M., Zubov A. Yu., “On the length of the symmetric and alternating permutations groups in different bases (review)”, Matematicheskie voprosy kibernetiki, 8, Nauka, M., 1999, 5–32 (in Russian).Search in Google Scholar
© 2017 Walter de Gruyter GmbH, Berlin/Boston
Articles in the same Issue
- Frontmatter
- An approach to the transformation of periodic sequences
- On the number of functions of k-valued logic which are polynomials modulo composite k
- Upper bounds for the size and the depth of formulae for MOD-functions
- Mean and variance of the number of subfunctions of random Boolean function which are close to the affine functions set
- The second coordinate sequence of the MP-LRS over nontrivial Galois ring of an odd characteristic
- On the asymptotics of the number of repetition-free Boolean functions in the basis {&, ∨, ⊕, ¬}
- On the gate complexity of reversible circuits consisting of NOT, CNOT and 2-CNOT gates
Articles in the same Issue
- Frontmatter
- An approach to the transformation of periodic sequences
- On the number of functions of k-valued logic which are polynomials modulo composite k
- Upper bounds for the size and the depth of formulae for MOD-functions
- Mean and variance of the number of subfunctions of random Boolean function which are close to the affine functions set
- The second coordinate sequence of the MP-LRS over nontrivial Galois ring of an odd characteristic
- On the asymptotics of the number of repetition-free Boolean functions in the basis {&, ∨, ⊕, ¬}
- On the gate complexity of reversible circuits consisting of NOT, CNOT and 2-CNOT gates
