No-Broadcasting Theorem and Its Classical Counterpart

2007/04/30 by Amir Kalev, A. Kalev, Itay Hen +1 · 2 citations
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #quant-ph

paper · pdf · doi:10.1103/physrevlett.100.210502

4 pages

arxiv created 2008/05/02 · openalex publication_date 2008/05/29 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Although it is widely accepted that "no-broadcasting"-the nonclonability of quantum information-is a fundamental principle of quantum mechanics, an impossibility theorem for the broadcasting of general density matrices has not yet been formulated. In this Letter, we present a general proof for the no-broadcasting theorem, which applies to arbitrary density matrices. The proof relies on entropic considerations, and as such can also be directly linked to its classical counterpart, which applies to probabilistic distributions of statistical ensembles.

Citations

• On Information and Sufficiency
• Completely positive maps and entropy inequalities
• Noncommuting Mixed States Cannot Be Broadcast
• Equivalence of Semiclassical and Quantum Mechanical Descriptions of Statistical Light Beams
• Quantum State Disturbance vs. Information Gain: Uncertainty Relations for Quantum Information
• Stochastic Processes in Physics and Chemistry
• A single quantum cannot be cloned
• Quantum Approach to a Derivation of the Second Law of Thermodynamics
• Quantum copying: Beyond the no-cloning theorem

Cited by

• Linear assignment maps for correlated system-environment states
• No-cloning theorem [wikipedia]