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/9908047 · Physics Letters A

On bound entanglement assisted distillation

Vlatko Vedral

Published Nov 1, 1999• 18 citations
arXivHTMLPDF
DOI
10.1016/s0375-9601(99)00686-6

Related papers

Irreversibility in Asymptotic Manipulations of Entanglement

Guifré Vidal, J. I. Cirac

We show that the process of entanglement distillation is irreversible by showing that the entanglement cost of a bound entangled state is finite. Such irreversibility remains even if extra pure entanglement is loaned to assist the distillation process.

arXiv:quant-ph/0102036•Physical Review Letters•Jun 18, 2001•109 citations

Canonical distillation of entanglement

Tamoghna Das, Asutosh Kumar, Amit Kumar Pal +3 more

arXiv:1411.7936•Physics Letters A•Sep 4, 2017•5 citations

General Theory of Environment-Assisted Entanglement Distillation

Francesco Buscemi, Nilanjana Datta

We evaluate the one-shot entanglement of assistance for an arbitrary bipartite state. This yields another interesting result, namely a characterization of the one-shot distillable entanglement of a bipartite pure state. This result is shown to be stronger than that obtained by specializing the one-shot hashing bound to pure states. Finally, we show how the one-shot result yields the operational interpretation of the asymptotic entanglement of assistance proved by Smolin and coworkers.

arXiv:1009.4464•IEEE Transactions on Information Theory•Nov 14, 2012•26 citations

Entanglement distillation using the exchange interaction

Adrian Auer, René Schwonnek, Christian Schoder +3 more

arXiv:1508.00364•Applied Physics B•Mar 1, 2016•1 citation

Unlimited quantum correlation advantage from bound entanglement

Armin Tavakoli, Carles Roch i Carceller, Lucas Tendick +1 more

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.

arXiv:2504.06395•New Journal of Physics•Feb 13, 2026•3 citations

Limiting one-way distillable secret key via privacy testing of extendible states

Vishal Singh, Karol Horodecki, Aby Philip +1 more

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.

quant-pharXiv:2511.04438•Nov 7, 2025•1 citation
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 kkk-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 kkk-extendible state can pass a privacy test, and we prove that it is equal to the maximum fidelity between an arbitrary kkk-extendible state and the standard maximally entangled state. Our findings, coupled with the resource theory of kkk-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 nnn-shot, one-way distillable key of a state and the nnn-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.