Estimation of the depth of reversible circuits consisting of NOT, CNOT and 2-CNOT gates

DOI10.3103/S0027132216030013zbMATH Open1348.94108MaRDI QIDQ334289FDOQ334289

Authors: Dmitriy V. Zakablukov 

Publication date: 1 November 2016

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

Recommendations

• 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
• On asymptotic gate complexity and depth of reversible circuits without additional memory
• 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

Mathematics Subject Classification ID

Analytic circuit theory (94C05) Networks and circuits as models of computation; circuit complexity (68Q06)

Cites Work

• Title not available (Why is that?)
• Reducing the Depth of Quantum Circuits Using Additional Circuit Lines
• Title not available (Why is that?)
• Title not available (Why is that?)
• An approximate algorithm for computing the complexity of reversible functions in the basis of Toffoli
• New inequality relations between depth and delay
• Title not available (Why is that?)

Cited In (2)

• On asymptotic gate complexity and depth of reversible circuits without additional memory
• 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

This page was built for publication: Estimation of the depth of reversible circuits consisting of NOT, CNOT and 2-CNOT gates

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