arXiv:2609.20698
Multinegativity and single-letter formulas for asymptotic entanglement
Raphael Brinster, Tulja Varun Kondra, Hermann Kampermann, Dagmar Bruß, Nikolai Wyderka
Abstract
The study of entanglement inevitably leads to the concept of regularization, where measures are evaluated on infinitely many copies of a state. Single-letter formulas try to make these asymptotic entanglement quantities accessible through a calculation on one copy of a state, but are rarely available. We introduce a decreasing hierarchy of computable upper bounds on the asymptotic relative entropy of entanglement with respect to positive-partial-transpose (PPT) states. The regularization of every fixed hierarchy level equals this asymptotic quantity. Additivity at any level therefore yields a single-letter formula, even when the usual one-copy relative entropy is nonadditive. We establish such additivity at the first nontrivial level for two broad multiparameter families, both containing all Werner states. The upper-bound construction also extends to sandwiched Renyi divergences. The hierarchy motivates $k$-multinegative states, a generalization of binegative states and the associated $k$-multinegativity, which gives explicit upper bounds on both the asymptotic relative entropy and exact PPT entanglement cost. We construct states which are $k$-multinegative at arbitrarily large depths $k$ that separate consecutive levels of the previously introduced entanglement-cost hierarchy, disproving its conjectured finite collapse. These results provide state-dependent single-letter formulas while identifying a limitation of universal finite-level characterizations.
AI Summary
The paper asks when regularized PPT entanglement quantities admit computable single-copy characterizations, focusing on the asymptotic PPT relative entropy of entanglement $E_R^\infty$ and exact PPT entanglement cost. It constructs decreasing convex-optimization upper bounds $U_k$ with semidefinite-representable feasible sets, satisfying $E_R^\infty\leq U_k\leq U_0=E_R$. Every fixed level regularizes to $E_R^\infty$, so additivity at any level gives an exact single-letter formula. The upper-bound proof uses tensor-stable operator inequalities to construct PPT trial states with overhead at most $\log(k+1)$, which vanishes per copy. Matching established measured-relative-entropy lower bounds through symmetry reduction proves $U_1=E_R^\infty$ for two multiparameter families: canonical symmetric–antisymmetric mixtures and hyperoctahedral states, both containing all Werner states. The upper-bound construction extends to sandwiched Rényi divergences for $\alpha\geq1/2$. Iterating $\mathcal N(X)=|X|^\Gamma$ defines multinegativity. If $\mathcal N_k(\rho)\geq0$, its logarithmic trace upper-bounds exact PPT cost and hence $E_R^\infty$. A recursive product-Bell-diagonal construction, analyzed through linear programming, gives states $\rho_m$ satisfying $\chi_{m-1}(\rho_m)=2^m/\binom{m}{\lfloor m/2\rfloor}$ and $\chi_{m-2}(\rho_m)\leq(2^m-1)/\binom{m}{\lfloor m/2\rfloor}$. Thus the lower-bound cost hierarchy has strict gaps at arbitrarily high levels, disproving its conjectured finite collapse. These states remain multinegative through depth $m$ and have local dimension $2^m$. The construction does not establish noncollapse of the upper-bound $\kappa$ hierarchy; a universal finite-level formula there remains open. Generic tightness and convergence behavior of the relative-entropy upper bounds are also unresolved.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 7 + 12 pages, 1 figure