arXiv:2610.35722
Distillable entanglement is continuous
Lukas Schmitt, David Sutter
Abstract
We prove continuity of distillable entanglement, the optimal asymptotic rate at which copies of a bipartite state can be converted into maximally entangled pairs by local operations and classical communication (LOCC) with vanishing error. We establish an explicit asymptotic continuity bound that holds for arbitrary bipartite states and depends logarithmically on the system dimension. This bound has the same structure as known continuity bounds for conditional entropy, entanglement cost, and relative entropy of entanglement. Our proof constructs an explicit LOCC protocol that converts either of two arbitrary bipartite states into the other at an ebit cost that vanishes as their trace distance tends to zero.
AI Summary
The paper addresses whether two-way LOCC distillable entanglement $E_D$ is continuous for arbitrary finite-dimensional bipartite states. Previous results established lower semicontinuity and continuity inside the set of distillable states, but did not cover all boundary cases, including approaches to pure states or to the distillable–nondistillable boundary. For $\tfrac12\|\rho-\sigma\|_1\leq\varepsilon<1/16$ and $d=\min\{\dim A,\dim B\}$, it proves the asymptotic continuity bound $|E_D(\rho)-E_D(\sigma)|\leq4\sqrt{\varepsilon}\log d+4h(\sqrt{\varepsilon})$, where $h$ is binary entropy and logarithms are base two. Thus the dimension dependence is logarithmic, with no spectral assumptions on either state. The proof is operational. An LOCC conversion protocol turns $n+O(n^{2/3})$ copies of either state into an approximation of $n-O(n^{2/3})$ copies of the other, with vanishing error and an auxiliary ebit cost per copy tending to zero with their trace distance. It first prepares a common intermediate mixture, then extracts the target using a nonlocal projective measurement. A collective Grover-search procedure locates rare measurement outcomes, reducing the entanglement expenditure. Concatenating conversion with distillation, and bounding the net gain achievable with supplied ebits, yields continuity. The same construction gives the displayed bound for entanglement cost $E_C$, although the paper notes that an existing continuity bound for $E_C$ is slightly tighter. The conversion result concerns asymptotic, vanishing-error protocols; it does not provide a finite-copy performance guarantee.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 17 pages, 2 figures