Related papers: No-Cloning Theorem on Quantum Logics
We prove a no-triplets theorem for spin 1 particles, which implies a strengthened form of the no-cloning theorem.
Quantum copy-protection, introduced by Aaronson (CCC'09), uses the no-cloning principle of quantum mechanics to protect software from being illegally distributed. Constructing copy-protection has been an important problem in quantum…
We discuss the usefulness of quantum cloning and present examples of quantum computation tasks for which cloning offers an advantage which cannot be matched by any approach that does not resort to it. In these quantum computations, we need…
Orthogonal pure states can be cloned as well as deleted. However if there is an initial disorder in the system, that is for orthogonal mixed states, one cannot perform deletion. And cloning, in such cases, necessarily produces an…
We propose the concept of pseudorandom states and study their constructions, properties, and applications. Under the assumption that quantum-secure one-way functions exist, we present concrete and efficient constructions of pseudorandom…
The hidden shift problem is a natural place to look for new separations between classical and quantum models of computation. One advantage of this problem is its flexibility, since it can be defined for a whole range of functions and a…
The (meta)logic underlying classical theory of computation is Boolean (two-valued) logic. Quantum logic was proposed by Birkhoff and von Neumann as a logic of quantum mechanics more than sixty years ago. The major difference between Boolean…
Recently, apparent nonphysical implications of non-Hermitian quantum mechanics (NHQM) have been discussed in the literature. In particular, the apparent violation of the no-signaling theorem, discrimination of nonorthogonal states, and the…
We show that, there are physical means for cloning two non-orthogonal pure states which are secretly chosen from a certain set $% \$={ | \Psi_0 > , | \Psi_1 > }$. The states are cloned through a unitary evolution together with a…
In this paper we discuss limitions appearing while using Boolean Logic in Non-Constructive Mathematics (NCM) as a mathematical foundation for Quantum Mechanics. These limitations naturally vanish using Constructive Mathematics (CM) and…
Associated to a symmetric space there is a canonical connection with zero torsion and parallel curvature. This connection acts as a binary operator on the vector space of smooth sections of the tangent bundle, and it is linear with respect…
In this note we contribute to the recently developing study of "almost Boolean" quantum logics (i.e. to the study of orthomodular partially ordered sets that are naturally endowed with a symmetric difference). We call them enriched quantum…
We consider relationships between cubic algebras and implication algebras. We first exhibit a functorial construction of a cubic algebra from an implication algebra. Then we consider an collapse of a cubic algebra to an implication algebra…
All existing quantum cryptosystems use non-orthogonal states as the carriers of information. Non-orthogonal states cannot be cloned (duplicated) by an eavesdropper. In result, any eavesdropping attempt must introduce errors in the…
We argue that symmetrization of an incoming microstate with similar states in a sea of microstates contained in a macroscopic detector can produce an effective image, which does not contradict the no-cloning theorem, and such a…
In this paper we consider the notion of quantum entanglement from the perspective of the logos categorical approach [26, 27]. Firstly, we will argue that the widespread distinctions, on the one hand, between pure states and mixed states,…
In a recent paper [2], Chang et al. have proposed studying "Quantum $\mathbb{F}_{un}$": the $q \mapsto 1$ limit of Modal Quantum Theories over finite fields $\mathbb{F}_q$, motivated by the fact that such limit theories can be naturally…
We define the notion of a partially additive Kleene algebra, which is a Kleene algebra where the + operation need only be partially defined. These structures formalize a number of examples that cannot be handled directly by Kleene algebras.…
Kleene algebra (KA) is an important tool for reasoning about general program equivalences, with a decidable and complete equational theory. However, KA cannot always prove equivalences between specific programs. For this purpose, one adds…
It is generally believed that entanglement is essential for quantum computing. We present here a few simple examples in which quantum computing without entanglement is better than anything classically achievable, in terms of the reliability…