arXiv:2609.40215
Universal distillation of quantum entanglement
Ryuji Takagi, Kaito Watanabe, Takaya Matsuura, Hayato Arai, Masahito Hayashi
Abstract
Distillable entanglement---the maximum rate of Bell states extractable from the given noisy entangled states via local operations and classical communication (LOCC)---has been a central quantity to characterize the operational value of entangled states. However, this operational meaning had been known to be valid only under a crucial assumption: both parties know the description of the input state and can choose the protocol tailored to it, which does not necessarily reflect the natural operational setting. Here, we show that the distillable entanglement is the fundamental operational quantity even without this assumption. We present a universal LOCC protocol---whose description does not depend on the input state and thus works universally for any input---that achieves the distillable entanglement of an arbitrary unknown input state. Our result therefore lifts the distillable entanglement to a robust notion of an operationally meaningful quantity and clarifies that input-state knowledge is not necessary to achieve the optimal rate of entanglement distillation. Our protocol is based on state merging for compound states, together with the uniform convergence property of the finite-block quantity toward distillable entanglement.
AI Summary
Can a fixed LOCC protocol distill entanglement from an unknown bipartite state at the same asymptotic rate as a protocol designed with full knowledge of that state? This paper answers affirmatively for arbitrary finite-dimensional i.i.d. inputs: $E_d(\rho_{AB})$ is universally achievable. The protocol has a measurement-dependent, announced output length; for every state, its average trace-distance error vanishes and the probability of obtaining a rate below $E_d(\rho_{AB})-\delta$ tends to zero for every $\delta>0$. The construction combines tomography on a sublinear number of copies with state merging for compound sources. First, it establishes universal achievability of the hashing bound $I_c(A|B)_\rho$, requiring only $O(\log d_A+\log d_B+\log n)$ bits of backward classical communication. To reach $E_d$, it uses LOCC preprocessing followed by compound-source merging. A canonical measurement representation controls coherent-information continuity without bounding Bob’s output dimension. The main technical result is uniform convergence of regularized, LOCC-optimized coherent information to $E_d$ on compact subsets of full-rank distillable states. Vanishing depolarizing noise handles rank-deficient inputs. As a channel application, $E_d(J_{\mathcal N})$ is universally achievable with LOCC assistance, attaining the two-way quantum capacity for teleportation-covariant channels. The result is information-theoretic, not computationally efficient, and concerns first-order asymptotic rates with statewise convergence. Non-i.i.d. sources, second-order rates, and optimal error exponents remain open. Universal achievement of the one-way distillable rate still uses backward communication, albeit at vanishing rate.
ChatGPT 5.6 Sol and 6 Astra were used to find technical mistakes and their revision, which were reviewed by the authors.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 7+17 pages; See also an independent work by Tirone et al. posted concurrently on arXiv with this manuscript