1998/09/30 by Eric M. Rains, E. M. Rains · 6 citations
Chemistry · Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Argument (complex analysis) #Chemistry #Combinatorics #Computer science #Discrete mathematics #Entropy (arrow of time) #Kullback–Leibler divergence #Mathematical analysis #Mathematics #Measure (data warehouse) #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum mechanics #State (computer science) #Statistics #Upper and lower bounds #quant-ph
paper · pdf · doi:10.1103/physreva.60.179
14 pages, no figures. A significant erratum in theorems 4 and 5 has been fixed
openalex publication_date 1999/07/01 · arxiv created 2000/10/30 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
The best bound known on 2-locally distillable entanglement is that of Vedral and Plenio, involving a certain measure of entanglement based on relative entropy. It turns out that a related argument can be used to give an even stronger bound; we give this bound, and examine some of its properties. In particular, and in contrast to the earlier bounds, the new bound is not additive in general. We give an example of a state for which the bound fails to be additive, as well as a number of states for which the bound is additive.