On the dependence of the complexity and depth of reversible circuits consisting of NOT, CNOT, and 2-CNOT gates on the number of additional inputs

DOI10.1515/DMA-2021-0006MaRDI QIDQ1996847zbMATH OpenOpenAlexFDO

Authors Dmitriy V. Zakablukov

Publication date 26 February 2021

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma-2021-0006

zbMATH Keywords

circuit complexitycircuit depthcomputations with memoryreversible circuits

Mathematics Subject Classification ID

Networks and circuits as models of computation; circuit complexity (68Q06)

Recommendations

• Estimation of the depth of reversible circuits consisting of NOT, CNOT and 2-CNOT gates
• On the gate complexity of reversible circuits consisting of NOT, CNOT and 2-CNOT gates
• On synthesis of reversible circuits consisting of NOT, CNOT, 2-CNOT gates with small number of additional inputs
• On asymptotic gate complexity and depth of reversible circuits without additional memory
• Retracted: Synthesis of reversible circuits consisting of NOT, CNOT and 2-CNOT gates with small number of additional inputs
• Complexity of reversible circuits and their quantum implementations
• Mathematical Foundations of Computer Science 2005
• Retraction note to: ``Synthesis of reversible circuits consisting of NOT, CNOT and 2-CNOT gates with small number of additional inputs
• On the complexity and depth of circuits that realize partial Boolean functions
• On the computational power of depth-2 circuits with threshold and modulo gates

Cites work

• Estimation of the depth of reversible circuits consisting of NOT, CNOT and 2-CNOT gates
• scientific article; zbMATH DE number 4179292 (Why is no real title available?)
• scientific article; zbMATH DE number 3133387 (Why is no real title available?)
• scientific article; zbMATH DE number 4085569 (Why is no real title available?)
• scientific article; zbMATH DE number 3422274 (Why is no real title available?)
• On the gate complexity of reversible circuits consisting of NOT, CNOT and 2-CNOT gates

Cited in

(5)

• On the gate complexity of reversible circuits consisting of NOT, CNOT and 2-CNOT gates
• On synthesis of reversible circuits consisting of NOT, CNOT, 2-CNOT gates with small number of additional inputs
• Retracted: Synthesis of reversible circuits consisting of NOT, CNOT and 2-CNOT gates with small number of additional inputs
• Estimation of the depth of reversible circuits consisting of NOT, CNOT and 2-CNOT gates
• On asymptotic gate complexity and depth of reversible circuits without additional memory

This page was built for publication: On the dependence of the complexity and depth of reversible circuits consisting of NOT, CNOT, and 2-CNOT gates on the number of additional inputs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1996847)