Reversible modified reconstructability analysis of Boolean circuits and its quantum computation
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2163011
- Synthesis of reversible logic quantum circuits
- Majority-based reversible logic gates
- Algebraic characterization of reversible logic gates
- Multiple-level circuit solutions to the circuit non-decomposability problem of the set-theoretic modified reconstructability analysis (MRA)
Cites work
Cited in
(8)- Quantum reversible circuit of AES-128
- Reordering method and hierarchies for quantum and classical ordered binary decision diagrams
- Inverse problems, constraint satisfaction, reversible logic, invertible logic and Grover quantum oracles for practical problems
- A comparison of modified reconstructability analysis and Ashenhurst‐Curtis decomposition of Boolean functions
- Introducing Reversibility in a High Level JJL Qubit Model According to CAN2 Paradigm
- On asymptotic gate complexity and depth of reversible circuits without additional memory
- Identification of a reversible quantum gate: assessing the resources
- Enhancements to Crisp Possibilistic Reconstructability Analysis
This page was built for publication: Reversible modified reconstructability analysis of Boolean circuits and its quantum computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3156162)