2009/10/13 by Samson Abramsky, Abramsky, Samson
Computer Science · #Advanced Algebra and Logic #Category Theory (math.CT) #FOS: Mathematics #FOS: Physical sciences #Logic (math.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.0910.2401
openalex publication_date 2009/10/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Recently, the author and Bob Coecke have introduced a categorical formulation of Quantum Mechanics. In the present paper, we shall use it to open up a novel perspective on No-Cloning. What we shall find, quite unexpectedly, is a link to some fundamental issues in logic, computation, and the foundations of mathematics. A striking feature of our results is that they are visibly in the same genre as a well-known result by Joyal in categorical logic showing that a `Boolean cartesian closed category' trivializes, which provides a major road-block to the computational interpretation of classical logic. In fact, they strengthen Joyal's result, insofar as the assumption of a full categorical product (both diagonals and projections) in the presence of a classical duality is weakened. This shows a heretofore unsuspected connection between limitative results in proof theory and No-Go theorems in quantum mechanics.