2006/06/24 by Amit Bhar, Indrani Chattopadhyay, Debasis Sarkar · 1 citation
Computer Science · Physics and Astronomy · #Formal Methods in Verification #Logic, programming, and type systems #quant-ph #semigroups and automata theory
paper · pdf · doi:10.1007/s11128-006-0041-2
published as Quantum Information Processing, 6 (2007) 93-99 · 4 pages, no figures, revtex format, accepted in Quantum Information Processing
arxiv created 2006/06/24 · openalex publication_date 2006/11/28 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
No-Cloning and No-Deleting theorems are verified with the constraint on local state transformations via the existence of incomparable states. Assuming the existence of exact cloning or deleting operation defined on a minimum number of two arbitrary states, an incomparable pair of states of the joint system between two parties can be made to compare under deterministic LOCC. We have restricted our proof with the assumption that the machine states of the cloning or deleting operations do not keep any information about the input states. We use the same setting to establish the no-cloning and no-deleting theorems via incomparability that supports the reciprocity of the two operations in their operational senses. The work associates the impossibility of operations with the evolution of an entangled system by LOCC.