2,942 research outputs found
A note on many valued quantum computational logics
The standard theory of quantum computation relies on the idea that the basic
information quantity is represented by a superposition of elements of the
canonical basis and the notion of probability naturally follows from the Born
rule. In this work we consider three valued quantum computational logics. More
specifically, we will focus on the Hilbert space C^3, we discuss extensions of
several gates to this space and, using the notion of effect probability, we
provide a characterization of its states.Comment: Pages 15, Soft Computing, 201
Fredkin Gates for Finite-valued Reversible and Conservative Logics
The basic principles and results of Conservative Logic introduced by Fredkin
and Toffoli on the basis of a seminal paper of Landauer are extended to
d-valued logics, with a special attention to three-valued logics. Different
approaches to d-valued logics are examined in order to determine some possible
universal sets of logic primitives. In particular, we consider the typical
connectives of Lukasiewicz and Godel logics, as well as Chang's MV-algebras. As
a result, some possible three-valued and d-valued universal gates are described
which realize a functionally complete set of fundamental connectives.Comment: 57 pages, 10 figures, 16 tables, 2 diagram
Finite automata models of quantized systems: conceptual status and outlook
Since Edward Moore, finite automata theory has been inspired by physics, in
particular by quantum complementarity. We review automaton complementarity,
reversible automata and the connections to generalized urn models. Recent
developments in quantum information theory may have appropriate formalizations
in the automaton context.Comment: 12 pages, prepared for the Sixth International Conference on
Developments in Language Theory, Kyoto, Japan, September 18-21, 200
- …