It was recently pointed out that there is a close connection between information-theoretic key agreement and quantum entanglement purification. This suggests that the concept of bound entanglement (entanglement which cannot be purified) has a classical counterpart: bound information, which cannot be used to generate a secret key by any protocol. We analyse a probability distribution which results when a specific bound entangled quantum state is measured. We show strong evidence for the fact that the corresponding mutual information is indeed bound. The probable existence of such information stands in contrast to previous beliefs in classical information theory. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
It was recently pointed out that there is a close connection between information-theoretic key agreement and quantum entanglement purification. This suggests that the concept of bound entanglement (entanglement which cannot be purified) has a classical counterpart: bound information, which cannot be used to generate a secret key by any protocol. We analyse a probability distribution which results when a specific bound entangled quantum state is measured. We show strong evidence for the fact that the corresponding mutual information is indeed bound. The probable existence of such information stands in contrast to previous beliefs in classical information theory. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Abstract. After carrying out a protocol for quantum key agreement over a noisy quantum channel, the parties Alice and Bob must process the raw key in order to end up with identical keys about which the adversary has virtually no information. In principle, both classical and quantum protocols can be used for this processing. It is a natural question which type of protocols is more powerful. We show that the limits of tolerable noise are identical for classical and quantum protocols in many cases. More specifically, we prove that a quantum state between two parties is entangled if and only if the classical random variables resulting from optimal measurements provide some mutual classical information between the parties. In addition, we present evidence which strongly suggests that the potentials of classical and of quantum protocols are equal in every situation. An important consequence, in the purely classical regime, of such a correspondence would be the existence of a classical counterpart of so-called bound entanglement, namely “bound information” that cannot be used for generating a secret key by any protocol. This stands in sharp contrast to what was previously believed. Keywords. Secret-key agreement, intrinsic information, secret-key rate, quantum privacy amplification, purification, entanglement. 1
There exist bipartite quantum states that cost entanglement to create, yet from which no singlet can be distilled. This extreme irreversibility is known as bound entanglement. A quarter-century ago, Gisin and Wolf asked whether classical information theory admits the same phenomenon. Are there correlations, shared by two parties and an eavesdropper, that cost secret bits to create, yet from which none can be distilled? This question is part of a broader program exploring the relation between quantum and classical information theory. We answer it in the affirmative, providing a simple example, a distribution of two bits and a trit. Bound entanglement thus has a classical counterpart, bound information. An even more direct correspondence was originally conjectured, namely that measuring purifications of bound-entangled states yields distributions with bound information. The very states that motivated the conjecture, however, yield no bound information when measured in the standard basis, whereas suitable measurements of purifications of separable states do. The analogy between bound entanglement and bound information thus lies in the accounting of resources, not in a correspondence between individual quantum states and the classical probability distributions induced by measuring them.
After carrying out a protocol for quantum key agreement over a noisy quantum channel, the parties Alice and Bob must process the raw key in order to end up with identical keys about which the adversary has virtually no information. In principle, both classical and quantum protocols can be used for this processing. It is a natural question which type of protocols is more powerful. We prove for general states but under the assumption of incoherent eavesdropping that Alice and Bob share some so-called intrinsic information in their classical random variables, resulting from optimal measurements, if and only if the parties' quantum systems are entangled. In addition, we provide evidence that the potentials of classical and of quantum protocols are equal in every situation. Consequently, many techniques and results from quantum information theory directly apply to problems in classical information theory, and vice versa. For instance, it was previously believed that two parties can carry out unconditionally secure key agreement as long as they share some intrinsic information in the adversary's view. The analysis of this purely classical problem from the quantum information-theoretic viewpoint shows that this is true in the binary case, but false in general. More explicitly, bound entanglement, i.e., entanglement that cannot be purified by any quantum protocol, has a classical counterpart. This "bound intrinsic information" cannot be distilled to a secret key by any classical protocol. As another application we propose a measure for entanglement based on classical information-theoretic quantities.
Entanglement is a fundamental resource for quantum information processing. In its pure form, it allows quantum teleportation and sharing classical secrets. Realistic quantum states are noisy and their usefulness is only partially understood. Bound-entangled states are central to this question--they have no distillable entanglement, yet sometimes still have a private classical key. We present a construction of bound-entangled states with a private key based on classical probability distributions. From this emerge states possessing a new classical analogue of bound entanglement, distinct from the long-sought bound information. We also find states of smaller dimensions and higher key rates than previously known. Our construction has implications for classical cryptography: we show that existing protocols are insufficient for extracting private key from our distributions due to their "bound-entangled" nature. We propose a simple extension of existing protocols that can extract a key from them.
We prove the conjectured existence of bound information, a classical analog of bound entanglement, in the multipartite scenario. We give examples of tripartite probability distributions from which it is impossible to extract any kind of secret key, even in the asymptotic regime, although they cannot be created by local operations and public communication. Moreover, we show that bound information can be activated: three honest parties can distill a common secret key from different distributions having bound information. Our results demonstrate that quantum information theory can provide useful insight for solving open problems in classical information theory.
Entanglement manipulation, and especially Entanglement Swapping is at the heart of current work on quantum information processing, purification and quantum teleportation. We will discuss how it may be generalized to multiparticle systems and how this enables multi-user quantum cryptographic protocols to be developed. Our scheme allows us to establish multiparticle entanglement between particles which belong to distant users in a communication network through a prior distribution of Bell state singlets followed by local measurements. We compare our method for generating entanglement with existing schemes using simple quantum networks, and highlight the advantages and applications in cryptographic conferencing and in reading messages from more than one source through a single quantum measurement. We also discuss how entanglement leads to the idea of ‘telecloning’, in which a teleportation-like protocol can be found which reproduces the output of an optimal quantum cloning machine. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.