Related papers: No-Cloning Theorem on Quantum Logics
Quantum no-cloning theorem gives rise to the intriguing possibility of quantum copy protection where we encode a program or functionality in a quantum state such that a user in possession of k copies cannot create k+1 copies, for any k.…
We discuss the role of the notion of information in the description of physical reality. We consider theories for which dynamics is linear with respect to stochastic mixing. We point out that the no-cloning and no-deleting principles emerge…
We prove within the standard quantum formalism without reduction postulate that the no-cloning theorem and the principle of no-increasing of entanglement under local actions and one-way classical communication are equivalent. We argue that…
It is shown that any quantum operation that perfectly clones the entanglement of all maximally-entangled qubit pairs cannot preserve separability. This ``entanglement no-cloning'' principle naturally suggests that some approximate cloning…
An introduction is given to an algebraic formulation and generalisation of the consistent histories approach to quantum theory. The main technical tool in this theory is an orthoalgebra of history propositions that serves as a generalised…
Quantum logic aims to capture essential quantum mechanical structure in order-theoretic terms. The Achilles' heel of quantum logic is the absence of a canonical description of composite systems, given descriptions of their components. We…
(1) Let 1\leq k\leq \omega. Call an atom structure \alpha weakly k neat representable, the term algebra is in \RCA_n\cap \Nr_n\CA_{n+k}, but the complex algebra is not representable. Call an atom structure neat if there is an atomic algebra…
Cloning, or approximate cloning, is one of basic operations in quantum information processing. In this paper, we deal with cloning of classical states, or probability distribution in asymptotic setting. We study the quality of the…
We present a new approach to ternary Boolean algebras in which negation is derived from the ternary operation. The key aspect is the replacement of complete commutativity by other axioms that do not require the ternary operation to be…
Algorithmic approach is based on the assumption that any quantum evolution of many particle system can be simulated on a classical computer with the polynomial time and memory cost. Algorithms play the central role here but not the…
We prove that order convergence on a Boolean algebra turns it into a compact convergence space if and only if this Boolean algebra is complete and atomic. We also show that on an Archimedean vector lattice, order intervals are compact with…
Voting is a game with a no-go theorem. New proofs of Arrow's impossibility theorem are given based on quantum information theory. We show that the Arrowian dictator is equivalent to the perfect cloning circuit. We present…
The cloning of quantum variables with continuous spectra is analyzed. A universal - or Gaussian - quantum cloning machine is exhibited that copies equally well the states of two conjugate variables such as position and momentum. It also…
We have proposed in several recent papers a critical view of some parts of quantum mechanics (QM) that is methodologically unusual because it rests on analysing the language of QM by using some elementary but fundamental tools of…
We present a discrete model theory similar in structure to ordinary quantum mechanics, but based on a finite field instead of complex amplitudes. The interpretation of this theory involves only the "modal" concepts of possibility and…
It is known that the stronger no-cloning theorem and the no-deleting theorem taken together provide the permanence property of quantum information. Also, it is known that the violation of the no-deletion theorem would imply signalling.…
An operad describes a category of algebras and a (co)homology theory for these algebras may be formulated using the homological algebra of operads. A morphism of operads $f:\mathcal{O}\rightarrow\mathcal{P}$ describes a functor allowing a…
In quantum theory, the modulus-square of the inner product of two normalized Hilbert space elements is to be interpreted as the transition probability between the pure states represented by these elements. A probabilistically motivated and…
We give a simpler proof of a result of Hodkinson in the context of a blow and blur up construction argueing that the idea at heart is similar to that adopted by Andr\'eka et all \cite{sayed}. The idea is to blow up a finite structure,…
Two-way quantum computers (2WQC) are proposed extension of standard 1WQC: adding conjugated state preparation operation $\langle 0|$ similar to postselection $|0\ra \langle 0|$, by performing a process which from perspective of CPT symmetry…