Reversible computation, quantum computation, and computer architectures in between
From MaRDI portal
Recommendations
- Symmetry groups for the decomposition of reversible computers, quantum computers, and computers in between
- Synthesis of quantum circuits vs. synthesis of classical reversible circuits
- Optimal synthesis of linear reversible circuits
- The decomposition of an arbitrary reversible logic circuit
- Young subgroups for reversible computers.
Cited in
(14)- A unified approach to quantum computation and classical reversible computation
- Inverse problems, constraint satisfaction, reversible logic, invertible logic and Grover quantum oracles for practical problems
- Reversible Computing
- Reversibility and adiabatic computation: trading time and space for energy
- Paraconsistent Machines and their Relation to Quantum Computing
- Reversible Logic Synthesis
- Synthesis of quantum circuits vs. synthesis of classical reversible circuits
- The decomposition of U(n) into XU(n) and ZU(n)
- The NEGATOR as a basic building block for quantum circuits
- Transactions on Computational Science XXIV. Special issue on reversible computing.
- \textit{OptQC}: an optimized parallel quantum compiler
- Symmetry groups for the decomposition of reversible computers, quantum computers, and computers in between
- Reversibility and Irreversibility in Quantum Computation and in Quantum Computational Logics
- The decomposition of an arbitrary reversible logic circuit
This page was built for publication: Reversible computation, quantum computation, and computer architectures in between
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5389334)
