Related papers: No-Cloning Theorem on Quantum Logics
To better understand quantum computation we can search for its limits or no-gos, especially if analogous limits do not appear in classical computation. Classical computation easily implements and extensively employs the addition of two bit…
In this paper, we introduce and investigate monadic NM-algebras: a variety of NM-algebras equipped with universal quantifiers. Also, we obtain some conditions under which monadic NM-algebras become monadic Boolean algebras. Besides, we show…
It is believed that the more we have {\it a priori} information on input states, the better we can make the quality of clones in quantum cloning machines. This common sense idea was confirmed several years ago by analyzing a situation,…
Do the partial order and ortholattice operations of a quantum logic correspond to the logical implication and connectives of classical logic? Re-phrased, how far might a classical understanding of quantum mechanics be, in principle,…
It is shown that quantum logic is a logic in the very same way in which classical logic is a logic. Soundness and completeness of both quantum and classical logics have been proved for novel lattice models that are not orthomodular and…
Let ${\cal S}(\mathcal{H})$ denote the set of all self-adjoint operators (not necessarily bounded) on a Hilbert space $\mathcal{H}$, which is the set of all physical quantities on a quantum system $\mathcal{H}$. We introduce a binary…
In this paper we discuss the relevance of the algebraic approach to quantum phenomena first introduced by von Neumann before he confessed to Birkoff that he no longer believed in Hilbert space. This approach is more general and allows us to…
Contextuality is widely regarded as a hallmark of quantum information, yet its structural origin is often obscured by probabilistic or operational formulations. In this work, we show that non-distributive orthomodular structure need not be…
We prove a new impossibility for quantum information (the no-splitting theorem): an unknown quantum bit (qubit) cannot be split into two complementary qubits. This impossibility, together with the no-cloning theorem, demonstrates that an…
The no-cloning theorem can be used as a basis for quantum money constructions which guarantee unconditionally unforgeable currency. Existing schemes, however, either (i) require long-term quantum memory and quantum communication between the…
Effect algebras form an algebraic formalization of the logic of quantum mechanics. For lattice effect algebras E we investigate a natural implication and prove that the implication reduct of E is term equivalent to E. Then we present a…
Quasi-set theory was proposed as a mathematical context to investigate collections of indistinguishable objects. After presenting an outline of this theory, we define an algebra that has most of the standard properties of an orthocomplete…
There exists a complete atomless Boolean algebra that has no proper atomless complete subalgebra.
We investigate an entangled deformation of the deterministic quantum cloning process, called enscription, that can be applied to (certain) sets of distinct quantum states which are not necessarily orthogonal, called texts. Some basic…
Universal algebra and clone theory have proven to be a useful tool in the study of constraint satisfaction problems since the complexity, up to logspace reductions, is determined by the set of polymorphisms of the constraint language. For…
The correspondence principle suggests that a quantum description for the microworld should be naturally transited to a classical description within the classical limit. However, it seems that there is a large gap between quantum no-cloning…
We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be derived from the underlying untyped equations. As a consequence, the…
We present algebraic semantics for the classical logic of proofs based on Boolean algebras. We also extend the language of the logic of proofs in order to have a Boolean structure on justification terms and equality predicate on terms. In…
We introduce quantum Boolean algebras which are the analogue of the Weyl algebras for Boolean affine spaces. We study quantum Boolean algebras from the logical and set theoretical viewpoints.
We show that one can formulate an algebra with lattice ordering so as to contain one quantum and five classical operations as opposed to the standard formulation of the Hilbert space subspace algebra. The standard orthomodular lattice is…