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

DOI10.3103/S0027132216030013zbMath1348.94108MaRDI QIDQ334289

Dmitriy V. Zakablukov

Publication date: 1 November 2016

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

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An approximate algorithm for computing the complexity of reversible functions in the basis of Toffoli
• Reducing the Depth of Quantum Circuits Using Additional Circuit Lines
• New inequality relations between depth and delay

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