On asymptotic gate complexity and depth of reversible circuits without additional memory

DOI10.1016/j.jcss.2016.09.010zbMath1391.94921arXiv1504.06876OpenAlexW2963059938MaRDI QIDQ340566

Dmitriy V. Zakablukov

Publication date: 14 November 2016

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.06876

zbMATH Keywords

reversible logicasymptotic boundscircuit depthgate complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analytic circuit theory (94C05) General theory for finite permutation groups (20B05) Quantum algorithms and complexity in the theory of computing (68Q12) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (2)

Application of Permutation Group Theory in Reversible Logic Synthesis ⋮ Reversible circuit synthesis by genetic programming using dynamic gate libraries

Cites Work

• Reducing the Depth of Quantum Circuits Using Additional Circuit Lines
• Irreversibility and Heat Generation in the Computing Process
• Logical Reversibility of Computation
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On asymptotic gate complexity and depth of reversible circuits without additional memory