Turing machines based on unsharp quantum logic

In this paper, we consider Turing machines based on unsharp quantum logic. For a lattice-ordered quantum multiple-valued (MV) algebra E, we introduce E-valued non-deterministic Turing machines (ENTMs) and E-valued deterministic Turing machines (EDTMs). We discuss different E-valued recursively enumerable languages from width-first and depth-first recognition. We find that width-first recognition is equal to or less than depth-first recognition in general. The equivalence requires an underlying E value lattice to degenerate into an MV algebra. We also study variants of ENTMs. ENTMs with a classical initial state and ENTMs with a classical final state have the same power as ENTMs with quantum initial and final states. In particular, the latter can be simulated by ENTMs with classical transitions under a certain condition. Using these findings, we prove that ENTMs are not equivalent to EDTMs and that ENTMs are more powerful than EDTMs. This is a notable difference from the classical Turing machines.Comment: In Proceedings QPL 2011, arXiv:1210.029

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

Quantum Voting and Violation of Gibbard-Satterthwaite's Impossibility Theorem

In the realm of algorithmic economics, voting systems are evaluated and compared by examining the properties or axioms they satisfy. While this pursuit has yielded valuable insights, it has also led to seminal impossibility results such as Arrow's and Gibbard-Satterthwaite's Impossibility Theorems, which pose challenges in designing ideal voting systems. Enter the domain of quantum computing: recent advancements have introduced the concept of quantum voting systems, which have many potential applications including in security and blockchain. Building on recent works that bypass Arrow's Impossibility Theorem using quantum voting systems, our research extends Quantum Condorcet Voting (QCV) to counter the Gibbard-Satterthwaite Impossibility Theorem in a quantum setting. To show this, we introduce a quantum-specific notion of truthfulness, extend ideas like incentive compatibility and the purpose of onto to the quantum domain, and introduce new tools to map social welfare functions to social choice functions in this domain.Comment: 35 pages, 1 figure, 2 table

Remarks on the order-theoretical and algebraic properties of quantum structures

This thesis is concerned with the analysis of common features and distinguishing traits of algebraic structures arising in the sharp as well as in the unsharp approaches to quan- tum theory both from an order-theoretical and an algebraic perspective. Firstly, we recall basic notions of order theory and universal algebra. Furthermore, we introduce fundamental concepts and facts concerning the algebraic structures we deal with, from orthomodular lattices to e↵ect algebras, MV algebras and their non-commutative gener- alizations. Finally, we present Basic algebras as a general framework in which (lattice) quantum structures can be studied from an universal algebraic perspective. Taking advantage of the categorical (term-)equivalence between Basic algebras and Lukasiewicz near semirings, in Chapter 3 we provide a structure theory for the lat- ter in order to highlight that, if turned into near-semirings, orthomodular lattices, MV algebras and Basic algebras determine ideals amenable of a common simple description. As a consequence, we provide a rather general Cantor-Bernstein Theorem for involutive left-residuable near semirings. In Chapter 4, we show that lattice pseudoe↵ect algebras, i.e. non-commutative gener- alizations of lattice e↵ect algebras can be represented as near semirings. One one side, this result allows the arithmetical treatment of pseudoe↵ect algebras as total structures; on the other, it shows that near semirings framework can be really seen as the common “ground” on which (commutative and non commutative) quantum structures can be studied and compared. In Chapter 5 we show that modular paraorthomodular lattices can be represented as semiring-like structures by first converting them into (left-) residuated structures. To this aim, we show that any modular bonded lattice A with antitone involution satisfying a strengthened form of regularity can be turned into a left-residuated groupoid. This condition turns out to be a sucient and necessary for a Kleene lattice to be equipped with a Boolean-like material implication. Finally, in order to highlight order theoretical peculiarities of orthomodular quantum structures, in Chapter 6 we weaken the notion of orthomodularity for posets by introduc- ing the concept of the generalized orthomodularity property (GO-property) expressed in terms of LU-operators. This seemingly mild generalization of orthomodular posets and its order theoretical analysis yields rather strong applications to e↵ect algebras, and orthomodular structures. Also, for several classes of orthoalgebras, the GO-property yields a completely order-theoretical characterization of the coherence law and, in turn, of proper orthoalgebras

Concurrent Kleene Algebra with Tests and Branching Automata

We introduce concurrent Kleene algebra with tests (CKAT) as a combination of Kleene algebra with tests (KAT) of Kozen and Smith with concurrent Kleene algebras (CKA), introduced by Hoare, Möller, Struth and Wehrman. CKAT provides a relatively simple algebraic model for reasoning about semantics of concurrent programs. We generalize guarded strings to guarded series-parallel strings , or gsp-strings, to give a concrete language model for CKAT. Combining nondeterministic guarded automata of Kozen with branching automata of Lodaya and Weil one obtains a model for processing gsp-strings in parallel. To ensure that the model satisfies the weak exchange law (x‖y)(z‖w)≤(xz)‖(yw) of CKA, we make use of the subsumption order of Gischer on the gsp-strings. We also define deterministic branching automata and investigate their relation to (nondeterministic) branching automata. To express basic concurrent algorithms, we define concurrent deterministic flowchart schemas and relate them to branching automata and to concurrent Kleene algebras with tests