Entanglement dilution

Entanglement dilution uses local operations and classical communication to prepare partially entangled states from maximally entangled states, such as Bell pairs. For many identical bipartite pure targets, the asymptotic cost in Bell pairs per target, allowing a vanishing approximation error, is their entanglement entropy in bits. The quantum typical subspace of the target's Schmidt coefficients has almost all its weight and dimension at most $2^{m(S+\delta )}$. A maximally entangled state of this dimension can be converted to the normalized truncated target by Nielsen's pure-state conversion theorem. The resulting state approaches the full target as the retained weight tends to one. Average monotonicity of pure-state entanglement entropy and entropy continuity give the converse lower bound. This is the reverse asymptotic task to entanglement concentration.

For $0<p<1$, every bipartition of ${\Psi }_p^{\otimes n}$ has Schmidt rank $2^n$, while $m$ copies of a GHZ state have Schmidt rank $2^m$. Schmidt-rank contraction under product operators therefore forbids any exact successful LOCC branch when $m<n$. Approximate entanglement dilution avoids this obstruction by retaining only a high-weight quantum typical subspace, whose dimension has logarithm $n{h}_2(p)+o(n)$. Exact finite-block conversion and asymptotically faithful conversion are different tasks.

For nonnegative $u,v$ with $u^2+v^2=1$, Alice applies Kraus operators $M_0=\mathrm{diag}(u,v)$ and $M_1=\mathrm{diag}(v,u)$ to one half of a Bell state. Their squared effects sum to the identity, and both outcomes have probability one half. The first branch is the target; the second becomes the target after both parties apply Pauli X gates. Sending the outcome by classical communication makes this exact deterministic entanglement dilution, rather than a postselected conversion.