Realization and synthesis of reversible functions
From MaRDI portal
Publication:633699
DOI10.1016/J.TCS.2010.11.031zbMATH Open1211.81049OpenAlexW2148904857MaRDI QIDQ633699FDOQ633699
Authors: Fei Xie, William N. N. Hung, Xiaoyu Song, Marek A. Perkowski, Guowu Yang 
Publication date: 29 March 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.11.031
Recommendations
- Theory and Applications of Models of Computation
- On asymptotic gate complexity and depth of reversible circuits without additional memory
- On synthesis of 3 × 3 reversible logic functions
- Synthesis of reversible logic quantum circuits
- A reversible logic synthesis algorithm based on the transformation of the truth table
Analysis of algorithms (68W40) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)
Cites Work
- Conservative logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quantum computational networks
- Irreversibility and Heat Generation in the Computing Process
- Logical Reversibility of Computation
- Title not available (Why is that?)
- Bicontinuous extensions of invertible combinatorial functions
- Title not available (Why is that?)
- Generating the group of reversible logic gates
- Majority-based reversible logic gates
- Algebraic characterization of reversible logic gates
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (39)
- The NEGATOR as a basic building block for quantum circuits
- Synthesis of quantum multiple-valued circuits
- Transforming MCT circuits to NCVW circuits
- Synthesis and optimization of reversible circuits -- a survey
- Algebraic characterization of reversible logic gates
- Complexity of reversible circuits and their quantum implementations
- Sistemi A Trasformazioni Reversibili
- Reversible Functional Array Programming
- A reversible logic synthesis algorithm based on the transformation of the truth table
- Constructive reversible logic synthesis for Boolean functions with special properties
- Exact synthesis of elementary quantum gate circuits
- Reversible circuit synthesis of symmetric functions using a simple regular structure
- Improved algorithms for debugging problems on erroneous reversible circuits
- Generating reversible circuits from higher-order functional programs
- Improving the quantum cost of reversible Boolean functions using reorder algorithm
- Minimal universal library for \(n\times n\) reversible circuits
- Application of Functional Decomposition in Synthesis of Reversible Circuits
- An approximate algorithm for computing the complexity of reversible functions in the basis of Toffoli
- Finding the redundant gates in reversible circuits
- Optimal synthesis of linear reversible circuits
- Synthesis of reversible logic quantum circuits
- Title not available (Why is that?)
- A reversible logical circuit synthesis algorithm based on decomposition of cycle representations of permutations
- Enumeration of reversible functions and its application to circuit complexity
- A coding theoretic approach towards symmetrization in reversible circuit synthesis
- Cycles-based and transformation-based synthesis of ternary reversible circuits. Aspects of complexity
- Quantum circuit synthesis using a new quantum logic gate library of NCV quantum gates
- Controlled and uncontrolled SWAP gates in reversible logic synthesis
- Computing the number of the equivalence classes for reversible logic functions
- Utilization of variable reordering in quantum ESCT minimization
- Realization of a new permutative gate library using controlled-\(k\)th-root-of-NOT quantum gates for exact minimization of quantum circuits
- Properties of quantum templates
- Theory and Applications of Models of Computation
- REVS: a tool for space-optimized reversible circuit synthesis
- Majority-based reversible logic gates
- Efficient algorithms for optimal 4-bit reversible logic system synthesis
- Title not available (Why is that?)
- Title not available (Why is that?)
- An algorithm for minimization of Boolean functions in the class of Toffoli reversible logic circuits
This page was built for publication: Realization and synthesis of reversible functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q633699)
