Estimation of the depth of reversible circuits consisting of NOT, CNOT and 2-CNOT gates
From MaRDI portal
Publication:334289
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
Cites work
- 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 3692653 (Why is no real title available?)
- An approximate algorithm for computing the complexity of reversible functions in the basis of Toffoli
- Fast synthesis of invertible circuits based on permutation group theory
- New inequality relations between depth and delay
- Reducing the Depth of Quantum Circuits Using Additional Circuit Lines
Cited in
(5)- A finite alternation result for reversible Boolean circuits
- 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
- 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)
