Abstract Entangled states that cannot be distilled to maximal entanglement are called bound entangled and they are often viewed as too weak to break the limitations of classical models. Here, we show a strongly contrasting result: that bound entangled states, when deployed as resources between two senders who communicate with a receiver, can generate correlation advantages of unlimited magnitude. The proof is based on using many copies of a bound entangled state to assist quantum communication. We show that in order to simulate the correlations predicted by bound entanglement, one requires in the many-copy limit either an entanglement visibility that tends to zero or a diverging amount of overhead communication. This capability of bound entanglement is unlocked by only using elementary single-qubit operations. The result shows that bound entanglement can be a scalable resource for breaking the limitations of physical models without access to entanglement.
The notions of privacy tests and
k-extendible states have both been instrumental in quantum information theory, particularly in understanding the limits of secure communication. In this paper, we determine the maximum probability with which an arbitrary
k-extendible state can pass a privacy test, and we prove that it is equal to the maximum fidelity between an arbitrary
k-extendible state and the standard maximally entangled state. Our findings, coupled with the resource theory of
k-unextendibility, lead to an efficiently computable upper bound on the one-shot, one-way distillable key of a bipartite state, and we prove that it is equal to the best-known efficiently computable upper bound on the one-shot, one-way distillable entanglement. We also establish efficiently computable upper bounds on the one-shot, forward-assisted private capacity of channels. Extending our formalism to the independent and identically distributed setting, we obtain single-letter efficiently computable bounds on the
n-shot, one-way distillable key of a state and the
n-shot, forward-assisted private capacity of a channel. For some key examples of interest, our bounds are significantly tighter than other known efficiently computable bounds.