The no-broadcasting theorem is a fundamental result in quantum information theory. It guarantees that a class of attacks on quantum protocols, based on eavesdropping and indiscriminate copying of quantum information, are impossible. Due to its fundamental importance, it is natural to ask whether it is an intrinsic quantum property or whether it also holds for a broader class of non-classical theories. To address this question, one could use the framework of correlation scenarios. Under this standpoint, Joshi, Grudka, and the Horodeckis conjectured that one cannot locally broadcast nonlocal behaviours. In this paper, we prove their conjecture based on the monotonicity of the relative entropy for behaviours. Additionally, following a similar reasoning, we obtain an analogous no-go theorem for steerable assemblages.
The no-broadcasting theorem is a fundamental result in quantum information theory. It guarantees that a class of attacks on quantum protocols, based on eavesdropping and indiscriminate copying of quantum information, are impossible. Due to its fundamental importance, it is natural to ask whether it is an intrinsic quantum property or whether it also holds for a broader class of non-classical theories. To address this question, one could use the framework of correlation scenarios. Under this standpoint, Joshi, Grudka, and the Horodeckis conjectured that one cannot locally broadcast nonlocal behaviours. In this paper, we prove their conjecture based on the monotonicity of the relative entropy for behaviours. Additionally, following a similar reasoning, we obtain an analogous no-go theorem for steerable assemblages.
Abstract No-broadcasting theorem is one of the most fundamental results in quantum information theory; it guarantees that the simplest attacks on any quantum protocol, based on eavesdropping and copying of quantum information, are impossible. Due to the fundamental importance of the no-broadcasting theorem, it is essential to understand the exact boundaries of this limitation. We generalize the standard definition of broadcasting by restricting the set of states which we want to broadcast and restricting the sets of measurements which we use to test the broadcasting. We show that in some of the investigated cases broadcasting is equivalent to commutativity, while in other cases commutativity is not necessary.
The no-broadcasting theorem, first established by Barnum et al. [Phys. Rev. Lett. 76, 2818 (1996)], states that a set of quantum states can be broadcast if and only if it constitutes a commuting family. Quite recently, Piani et al. [Phys. Rev. Lett. 100, 090502 (2008)] showed, by using an ingenious and sophisticated method, that the correlations in a single bipartite state can be locally broadcast if and only if the state is effectively a classical one (i.e., the correlations therein are classical). In this Brief Report, under the condition of nondegenerate spectrum, we provide an alternative and significantly simpler proof of the latter result based on the original no-broadcasting theorem and the monotonicity of the quantum relative entropy. This derivation motivates us to conjecture the equivalence between these two elegant yet formally different no-broadcasting theorems and indicates a subtle and fundamental issue concerning spectral degeneracy which also lies at the heart of the conflict between the von Neumann projection postulate and the L\"uders ansatz for quantum measurements. This relation not only offers operational interpretations for commutativity and classicality but also illustrates the basic significance of noncommutativity in characterizing quantumness from the informational perspective.
One of the classical results concerning quantum channels is the characterization of entanglement-breaking channels [M. Horodecki, P. W. Shor, and M. B. Ruskai, Rev. Math. Phys. 15, 629 (2003)]. We address the question whether there exists a similar characterization on the level of quantum correlations which may go beyond entanglement. The answer is fully affirmative in the case of breaking quantum correlations down to the, so-called, QC (quantum-classical) type, while it is no longer true in the CC (classical-classical) case. The corresponding channels turn out to be measurement maps. Our study also reveals an unexpected link between quantum state and local correlation broadcasting and finite Markov chains. We present a possibility of broadcasting via non von Neumann measurements, which relies on the Perron-Frobenius theorem. Surprisingly, this is not the typical generalized controlled-not (c-not) gate scenario appearing naturally in this context.
Correlations in bipartite quantum states are fundamental objects in quantum information theory. A canonical framework for studying correlations is the entangled versus separable dichotomy in which the decompositions of separable states as convex combinations of product states play an instrumental role. In this paper, motivated by both the representation of separable states and quantum no-broadcasting considerations, we establish a constructive decomposition representation for any bipartite state. As applications, we prove the conjectures proposed by Luo [Lett. Math. Phys. 92, 143 (2010)] concerning no-unilocal broadcasting for quantum correlations and further provide a unified picture for the celebrated quantum no-broadcasting theorem for noncommuting states by Barnum et al. [Phys. Rev. Lett. 76, 2818 (1996)], and the elegant no-local-broadcasting theorem for quantum correlations by Piani et al. [Phys. Rev. Lett. 100, 090502 (2008)]. The results reveal some intrinsic relation between quantumness of correlations and noncommutativity of states, and in particular, provide a characterization for zero quantum discord introduced by Ollivier and Zurek [Phys. Rev. Lett. 88, 017901 (2001)] from the broadcasting perspective. Furthermore, it is indicated that the distinction between the decomposition for general bipartite states and that for separable states might be useful in studying entanglement versus separability.
Quantum information theory is a wide area of investigation, which includes two main subjects: quantum computation and quantum communication. The success of quantum computation theory is due to a positive result: Shor's algorithm. The algorithm provides factorization of integers in a much more efficient way with respect to what is achieved not only by present-day computers, but even by the most powerful conceivable computers based on classical physics. On the other hand, the success of quantum communication is due to the intrinsic security of ideal quantum cryptographic protocols, and thus relies on a negative result, that is the impossibility of reading quantum information without scrambling it in an unrecoverable way. The no information without disturbance property spawns other no-go theorems, which represent some of the most famous and classic results in quantum information theory. Among these results one can certainly list the no-cloning theorem, stating the impossibility of copying quantum information. This impossibility is clearly a consequence of the impossibility of extracting information without disturbing it. Indeed, if we could copy exactly the state of a system, reproducing it on another system of the same type, then we would also be able to iterate this process, and produce as many copies as we want. We could then extract all the information we are interested in from the copies, keeping the original intact. This argument is so simple, but hides a very deep point about quantum information, and more generally about any type of information that can be purified. Suppose indeed that there exists a measurement allowing us to determine the state of a system, with absolute precision. We could then use such a measurement on the system, and once we know its exact state, we can in principle re-prepare the same state as many times as we want. If copying the state is forbidden within a theory, we must then conclude that, in that theory, measuring the state is forbidden, too! This is exactly the case in theories with purification, and in particular in quantum theory. In quantum theory, determining the state of a system is impossible. We can only have some information about what state our system is prepared in. The information may be accurate, but it will never be certain. This could be practically the case in classical theory, too.
In this work, we extensively study the problem of broadcasting of quantum correlations (QCs). This includes broadcasting of quantum entanglement as well as correlations that go beyond the notion of entanglement (QCsbE). It is quite well known from the ``no-broadcasting theorem'' that perfect broadcasting of QCs is not possible. However, it does not rule out the possibility of partial broadcasting of QCs where we can get lesser correlated states from a given correlated state. In order to have a holistic view of broadcasting, we investigate this problem by starting with a most general representation of two qubit mixed states in terms of the Bloch vectors. As a cloning transformation we have used universal symmetric optimal Buzek-Hillery (BH) cloner both locally and nonlocally. Unlike entanglement, we find that it is impossible to broadcast QCsbE optimally. Lastly, we generalize these results for any symmetric or asymmetric cloning machines as well. This result brings out a fundamental difference between the correlations defined from the perspective of entanglement and the correlations measure which claims to go beyond entanglement.