Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0310054 · Physical Review Letters

Quantum Correlations and Secret Bits

Antonio Acín, Nicolas Gisin

Published Jan 18, 2005• 53 citations
arXivHTMLPDF

Abstract

It is shown that (i) all entangled states can be mapped by single-copy measurements into probability distributions containing secret correlations, and (ii) if a probability distribution obtained from a quantum state contains secret correlations, then this state has to be entangled. These results prove the existence of a two-way connection between secret and quantum correlations in the process of preparation. They also imply that either it is possible to map any bound entangled state into a distillable probability distribution or bipartite bound information exists.

DOI
10.1103/physrevlett.94.020501

Related papers

Bipartite Bound Information Exists

Jef Pauwels, Nicolas Gisin, Renato Renner

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.

quant-pharXiv:2607.25838•Jul 29, 2026•0 citations

Multipartite Secret Correlations and Bound Information

Lluís Masanes, Antonio Acín

The problem of secret key extraction when n honest parties and an eavesdropper share correlated information is considered. A family of probability distributions is introduced and the full characterization of its distillation properties is presented. This formalism allows to design a rich variety of cryptographic scenarios. In particular, the existence of multipartite probability distributions containing nondistillable secret correlations, also known as bound information, can be proved

arXiv:cs/0501008•IEEE Transactions on Information Theory•Sep 29, 2006•6 citations

Equivalence between Two-Qubit Entanglement and Secure Key Distribution

Antonio Acín, Lluís Masanes, Nicolas Gisin

We study the problem of secret key distillation from bipartite states in the scenario where Alice and Bob can perform measurements only at the single-copy level and classically process the obtained outcomes. Even with these limitations, secret bits can be asymptotically distilled by the honest parties from any two-qubit entangled state, under any individual attack. Our results point out a complete equivalence between two-qubit entanglement and secure key distribution: a key can be established through a one-qubit channel if and only if it allows one to distribute entanglement. These results can be generalized to a higher dimension for all those states that are one-copy distillable.

arXiv:quant-ph/0303053•Physical Review Letters•Oct 13, 2003•34 citations

A non-distillability criterion for secret correlations

Lluís Masanes, Andreas Winter

Within entanglement theory there are criteria which certify that some quantum states cannot be distilled into pure entanglement. An example is the positive partial transposition criterion. Here we present, for the first time, the analogous thing for secret correlations. We introduce a computable criterion which certifies that a probability distribution between two honest parties and an eavesdropper cannot be (asymptotically) distilled into a secret key. The existence of non-distillable correlations with positive secrecy cost, also known as bound information, is an open question. This criterion may be the key for finding bound information. However, if it turns out that this criterion does not detect bound information, then, a very interesting consequence follows: any distribution with positive secrecy cost can increase the secrecy content of another distribution. In other words, all correlations with positive secrecy cost constitute a useful resource.

Quantum Information and Computation•Jan 1, 2010•0 citations

A non-distillability criterion for secret correlations

Lluís Masanes, Andreas Winter

Within entanglement theory there are criteria which certify that some quantum states cannot be distilled into pure entanglement. An example is the positive partial transposition criterion. Here we present, for the first time, the analogous thing for secret correlations. We introduce a computable criterion which certifies that a probability distribution between two honest parties and an eavesdropper cannot be (asymptotically) distilled into a secret key. The existence of non-distillable correlations with positive secrecy cost, also known as bound information, is an open question. This criterion may be the key for finding bound information. However, if it turns out that this criterion does not detect bound information, then, a very interesting consequence follows: any distribution with positive secrecy cost can increase the secrecy content of another distribution. In other words, all correlations with positive secrecy cost constitute a useful resource.

arXiv:0804.4523•Apr 29, 2008•1 citation

Bound Information: The Classical Analog to Bound Quantum Entanglemen

Nicolas Gisin, Renato Renner, Stefan Wolf

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.

Birkhäuser Basel eBooks•Jan 1, 2001•7 citations
It is shown that (i) all entangled states can be mapped by single-copy measurements into probability distributions containing secret correlations, and (ii) if a probability distribution obtained from a quantum state contains secret correlations, then this state has to be entangled. These results prove the existence of a two-way connection between secret and quantum correlations in the process of preparation. They also imply that either it is possible to map any bound entangled state into a distillable probability distribution or bipartite bound information exists.
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.
We study the problem of secret key distillation from bipartite states in the scenario where Alice and Bob can perform measurements only at the single-copy level and classically process the obtained outcomes. Even with these limitations, secret bits can be asymptotically distilled by the honest parties from any two-qubit entangled state, under any individual attack. Our results point out a complete equivalence between two-qubit entanglement and secure key distribution: a key can be established through a one-qubit channel if and only if it allows one to distribute entanglement. These results can be generalized to a higher dimension for all those states that are one-copy distillable.
Within entanglement theory there are criteria which certify that some quantum states cannot be distilled into pure entanglement. An example is the positive partial transposition criterion. Here we present, for the first time, the analogous thing for secret correlations. We introduce a computable criterion which certifies that a probability distribution between two honest parties and an eavesdropper cannot be (asymptotically) distilled into a secret key. The existence of non-distillable correlations with positive secrecy cost, also known as bound information, is an open question. This criterion may be the key for finding bound information. However, if it turns out that this criterion does not detect bound information, then, a very interesting consequence follows: any distribution with positive secrecy cost can increase the secrecy content of another distribution. In other words, all correlations with positive secrecy cost constitute a useful resource.
Within entanglement theory there are criteria which certify that some quantum states cannot be distilled into pure entanglement. An example is the positive partial transposition criterion. Here we present, for the first time, the analogous thing for secret correlations. We introduce a computable criterion which certifies that a probability distribution between two honest parties and an eavesdropper cannot be (asymptotically) distilled into a secret key. The existence of non-distillable correlations with positive secrecy cost, also known as bound information, is an open question. This criterion may be the key for finding bound information. However, if it turns out that this criterion does not detect bound information, then, a very interesting consequence follows: any distribution with positive secrecy cost can increase the secrecy content of another distribution. In other words, all correlations with positive secrecy cost constitute a useful resource.
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.