arXiv:2609.30246
The Moreau-Yosida approximation of the Entanglement of Formation: basic properties and accuracy estimates
M. E. Shirokov
Abstract
We describe a family of convex uniformly continuous functions $E^λ_F$, $λ>0$, on the set of states of a bipartite quantum system (consisting of finite-dimensional or infinite-dimensional subsystems), which monotonically increase and converge pointwise to the Entanglement of Formation (EoF) as $λ\to0$. These functions are "nonselective" entanglement monotones defined in a way close to the construction of the Moreau-Yosida regularization (the Moreau envelope) of a convex function on a convex set used in the modern convex analysis. So, we call the functions $E^λ_F$ the Moreau-Yosida approximations of the EoF and describe their equivalent definitions and basic properties. The semicontinuity bounds for the EoF (presented in [Lob.J.Math., 46(6), 2632-2658]) allow us to obtain easily computable upper bounds on the difference $E_F(ρ)-E^λ_F(ρ)$ for a given state $ρ$. These bounds give easily computable bounds on the rate of uniform convergence of the function $E^λ_F$ to the EoF as $λ\to0^+$ on the sets of states with bounded rank/energy of one of the marginal states. We also discuss sufficient conditions for the coincidence of $E_F(ρ)$ and $E^λ_F(ρ)$ at a given state $ρ$ for all $λ$ small enough and consider several classes of states for which such coincidence takes place. The conjectured selective LOCC-monotonicity of the functions $E^λ_F$ and a possible way to prove it are briefly discussed. Secondary parts of the article are written with the help of ChatGPT-5.6.
AI Summary
The paper studies whether entanglement of formation (EoF), particularly in infinite dimensions, can be approximated by better-behaved functions with controlled error. It defines the trace-norm infimal convolution $E_F^\lambda(\rho)=\inf_\sigma\{E_F(\sigma)+\|\rho-\sigma\|_1/(2\lambda)\}$, using the continuous convex-roof definition of EoF. Unlike the standard Moreau envelope, the penalty is linear rather than quadratic in the norm. For every $\lambda>0$, the approximation is convex, faithful, nonincreasing under nonselective LOCC, and Lipschitz with constant $1/\lambda$ in trace distance. It satisfies $E_F^\lambda\leq1/\lambda$ and increases pointwise to $E_F$ as $\lambda\downarrow0$. Equivalent formulations use discrete pure-state ensembles or entanglement witnesses with spectral diameter at most $1/\lambda$. The proofs combine convex analysis, trace-norm contractivity, lower semicontinuity, and minimax duality. Previously established EoF semicontinuity bounds yield explicit one-variable optimization bounds on the approximation error. For marginal rank $d$, the bound maximizes $x\ln(d-1)+h(x)-(1-\sqrt{1-x^2})/\lambda$ over $0<x\leq1-1/d$. An energy-constrained analogue replaces the entropy term by $xF_H(E/x)+h^\uparrow(x)$. These establish uniform convergence under bounded marginal rank or energy, with the latter requiring the Gibbs condition. Exact agreement for sufficiently small $\lambda$ is characterized by bounded affine supporting functionals and illustrated for several state classes. The construction does not provide an efficient computational algorithm. Selective LOCC monotonicity remains conjectural. The functions are subadditive but not additive, and their fixed-$\lambda$ tensor-power regularization vanishes identically. The general coincidence of discrete and continuous infinite-dimensional EoF also remains unresolved.
Secondary parts of the article are written with the help of ChatGPT-5.6.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 25 pages, 2 figures, preliminary version, any comments are welcome