We prove generic versions of the no-cloning and no-broadcasting theorems, applicable to essentially {\em any} non-classical finite-dimensional probabilistic model that satisfies a no-signaling criterion. This includes quantum theory as well as models supporting ``super-quantum'' correlations that violate the Bell inequalities to a larger extent than quantum theory. The proof of our no-broadcasting theorem is significantly more natural and more self-contained than others we have seen: we show that a set of states is broadcastable if, and only if, it is contained in a simplex whose vertices are cloneable, and therefore distinguishable by a single measurement. This necessary and sufficient condition generalizes the quantum requirement that a broadcastable set of states commute.
Local quantum operations and classical communication (LOCC) put considerable constraints on many quantum information processing tasks such as cloning and discrimination. Surprisingly, however, discrimination of any two pure states survives such constraints in some sense. We show that cloning is not that lucky; namely, probabilistic LOCC cloning of two product states is strictly less efficient than global cloning. We prove our result by giving explicitly the efficiency formula of local cloning of any two product states.
We consider probabilistic cloning of a state chosen from a mutually nonorthogonal set of pure states, with the help of a party holding supplementary information in the form of pure states. When the number of states is 2, we show that the best efficiency of producing
m copies is always achieved by a two-step protocol in which the helping party first attempts to produce $m\ensuremath{-}1$ copies from the supplementary state, and if it fails, then the original state is used to produce
m copies. On the other hand, when the number of states exceeds two, the best efficiency is not always achieved by such a protocol. We give examples in which the best efficiency is not achieved even if we allow any amount of one-way classical communication from the helping party.