Quantum conservative many-valued computing
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3392404 (Why is no real title available?)
- A New Proof of the Completeness of the Lukasiewicz Axioms
- A single quantum cannot be cloned
- Algebraic Analysis of Many Valued Logics
- Axiom schemes for m-valued propositions calculi
- Conservative logic
- Fault-tolerant quantum computation with higher-dimensional systems
- Fredkin gates for finite-valued reversible and conservative logics
- Logical Reversibility of Computation
- Quantum computational networks
- Quantum conservative gates for finite-valued logics
- Quantum theory, the Church–Turing principle and the universal quantum computer
Cited in
(8)- Quantum conservative gates for finite-valued logics
- Mathematical Foundations of Computer Science 2003
- Design of \(p\)-valued Deutsch quantum gates with multiple control signals and mixed polarity
- Holistic and compositional logics based on the Bertini gate
- Towards a theory of conservative computing
- Classical Boolean logic gates with quantum systems
- scientific article; zbMATH DE number 1775518 (Why is no real title available?)
- Fredkin gates for finite-valued reversible and conservative logics
This page was built for publication: Quantum conservative many-valued computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835101)
