arXiv:2609.40080
Universal Entanglement Distillation
Salvatore Tirone, Francesco Anna Mele, Vittorio Giovannetti, Ludovico Lami
Abstract
We present a universal entanglement distillation protocol that asymptotically achieves the distillable entanglement of any unknown bipartite state in a fixed finite dimension. That is, its ebit yield attains every rate below the optimum that would be available if the state were known, with vanishing trace-distance error. Our approach combines tomography by local operations and classical communication with an adaptive distillation routine, using a local robustness lemma to control finite-sample estimation errors. We also characterize worst-case distillation from a family of states: the optimal uniform rate is the minimum distillable entanglement on the family's closure. These results show that ignorance of the state need not incur an asymptotic rate penalty.
AI Summary
The paper asks whether an unknown i.i.d. bipartite mixed state can be distilled by LOCC without losing asymptotic rate relative to protocols given its classical description. For fixed, known local dimension $d$, it proves the existence of a single state-agnostic protocol that, for every state $\rho$ and every $0<R<E_d(\rho)$, produces at least $\lceil Rn\rceil$ ebits with probability tending to one and vanishing trace-distance error. The announced output size may be random; the error guarantee is averaged over that size. The central ingredient is a local robustness lemma: every rate strictly below $E_d(\rho)$ is achievable by one sequence of LOCC maps uniformly throughout a sufficiently small neighborhood of $\rho$. This also implies lower semicontinuity of $E_d$. The universal construction spends $o(n)$ copies on LOCC tomography, then selects a robust distillation routine from a slowly expanding finite menu. The tomography procedure combines separable-resource teleportation, tomography at one party, and classical inversion, requiring $O((d^6+d^2\log(1/\delta))/\varepsilon^2)$ copies for trace-distance accuracy $\varepsilon$ and failure probability $\delta$. For any nonempty family $\mathcal X$, the optimal uniform worst-case rate is $\min_{\rho\in\overline{\mathcal X}}E_d(\rho)$. Its achievability follows from robustness, tomography, and a finite-cover argument on the compact closure. The protocol is a non-constructive asymptotic existence result, not an efficient distillation algorithm or a method for calculating $E_d$. It assumes finite dimension and i.i.d. inputs. Optimal LOCC tomography sample complexity and multipartite extensions remain open.
ChatGPT 5.5 was later used to improve the main result by refining one of the proofs suitably adapting our human-generated arguments.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 33 pages, 1 figure. See also the independent work by Takagi et al., which appeared on the arXiv today