This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Enlarging the notion of additivity of resource quantifiers

L. F. Melo, Thiago Melo, and Fernando Parisio [email protected] Departamento de Física, Universidade Federal de Pernambuco, Recife, Pernambuco 50670-901 Brazil
Abstract

Whenever a physical quantity becomes essential to the realization of useful tasks, it is desirable to define proper measures or monotones to quantify it. In quantum mechanics, coherence, entanglement, and Bell nonlocality are examples of such quantities. Given a quantum state ϱ\varrho and a quantifier (ϱ){\cal E}(\varrho), both arbitrary, it is a hard task to determine (ϱN){\cal E}(\varrho^{\otimes N}). However, if the figure of merit \cal{E} turns out to be additive, we simply have (ϱN)=Ne{\cal E}(\varrho^{\otimes N})=Ne, with e=(ϱ)e={\cal E}(\varrho). In this work we generalize this useful notion through the inner product (ϱN)=Ne{\cal E}(\varrho^{\otimes N})=\vec{N}\cdot\vec{e}, where e=((ϱi1),(ϱi2),,(ϱiq))\vec{e}=({\cal E}(\varrho^{\otimes i_{1}}),{\cal E}(\varrho^{\otimes i_{2}}),\dots,{\cal E}(\varrho^{\otimes i_{q}})) is a vector whose qq entries are the figure of merit under study calculated for some numbers of copies smaller than NN (1i1<i2<<iq<N1\leq i_{1}<i_{2}<\dots<i_{q}<N), where N=(Ni1,Ni2,,Niq)\vec{N}=(N_{i_{1}},N_{i_{2}},\dots,N_{i_{q}}), is a string of numbers that depends only on NN and on the set of integers {ij}\{{i_{j}}\}. We show that the one shot distillable entanglement of certain spherically symmetric states can be quantitatively approximated by such an augmented additivity.

I Introduction

Many quantum mechanical tasks of either foundational or practical relevance, involving a particular state ϱ\varrho, require the preparation of a large number of copies of this state to be accomplished. In some situations, it turns out that employing ϱN\varrho^{\otimes N} and global operations over the large Hilbert-Schmidt space it inhabits proves to be advantageous in comparison with the isolated manipulation of NN copies of ϱ\varrho. This is an instance of the nonadditivity of the figure of merit that embodies the ability to execute the task under consideration.

Additivity is a special property satisfied only by a handful of measures or monotones of quantum resources comm0 , as for instance, the logarithmic negativity vidal and squashed entanglement squashed , for non separability horodecki . For these special quantifiers (ϱN)=N(ϱ){\cal E}(\varrho^{\otimes N})=N{\cal E}(\varrho). Thus, additivity renders an otherwise hard problem trivial: the evaluation of the amount of resources contained in NN copies of a given state ϱ\varrho, (ϱN){\cal E}(\varrho^{\otimes N}), once we know (ϱ){\cal E}(\varrho). We remark that a stronger notion of additivity is (ϱσ)=(ϱ)+(σ){\cal E}(\varrho\otimes\sigma)={\cal E}(\varrho)+{\cal E}(\sigma), for all pairs of states ϱ\varrho and σ\sigma. In this manuscript, whenever we refer to additivity, we mean the weaker condition.

The majority of quantum-resource quantifiers, however, is nonadditive. Examples regarding nonseparability are the entanglement of formation formation ; hastings and the geometric measure of entanglement geom , among others nonadd ; dafa ; dafa2 . An extreme example of such a behavior is the phenomenon of superactivation, for which, given a particular quantifier {\cal E}, we may find states ϱ\varrho, such that (ϱ)=0{\cal E}(\varrho)=0 and (ϱN)>0{\cal E}(\varrho^{\otimes N})>0, for some N>1N>1, as is the case of the distillable entanglement superact ; watrous .

The technical difficulty to determine (ϱN){\cal E}(\varrho^{\otimes N}) is an important motivation behind the search for asymptotic limits, which are useful whenever one can assume that the number of states is large enough to make the limit NN\rightarrow\infty an acceptable approximation. However, often, the asymptotic regime dominates only for a unpractically high number of copies oneshot ; natcomm ; ieee . Therefore, one cannot always evade the question of evaluating {\cal E} for a large, but finite number of copies.

An alternative attempt to deal with the problem comes from the concept of scalable quantifiers, introduced in scal1 , which is summarized in the next section. The remanining sections of this work explore a generalization of the additivity notion, stemming from scalability, which can prove useful in the evaluation of some relevant figures of merit in the large NN limit.

II Preliminaries: Scalable quantum functions

Let us initially formalize the notion of scalability scal1 . Consider an arbitrary function {\cal E} with argument ϱN\varrho^{\otimes N}, :()N+{\cal E}:{\cal B(H)}^{\otimes N}\mapsto\mathds{R}_{+}. In practice, the quantity (ϱN){\cal E}(\varrho^{\otimes N}) can be a measure or monotone of a quantum resource, or some cost function, for instance. Now, suppose we either know by definition or find out that this function is completely (or approximately) determined by qq real numbers, namely, ei1=(ϱi1)e_{i_{1}}={\cal E}(\varrho^{\otimes i_{1}}), ei2=(ϱi2),,eiq=(ϱiq)e_{i_{2}}={\cal E}(\varrho^{\otimes i_{2}}),\dots,e_{i_{q}}={\cal E}(\varrho^{\otimes i_{q}}), ij<Ni_{j}<N, j=1,,qj=1,\dots,q. That is, once we know the value of {\cal E} for some smaller number of copies, (ϱN){\cal E}(\varrho^{\otimes N}) is determined:

(ϱN)=E(N)(e),{\cal E}(\varrho^{\otimes N})=E^{(N)}(\vec{e}), (1)

where, for short, we collect the non-negative numbers eije_{i_{j}} as the components of a vector in the positive hyperoctant of q\mathds{R}^{q},

e(ei1,ei2,,eiq).\vec{e}\equiv(e_{i_{1}},e_{i_{2}},\dots,e_{i_{q}}).

One of the main results of scal1 is that the possible functional forms of E(N)(e)E^{(N)}(\vec{e}) must satisfy the constraint

E(N)(e)=E(N/K)(E(i1K)(e),E(i2K)(e),,E(iqK)(e)),E^{(N)}(\vec{e})=E^{(N/K)}\left(E^{(i_{1}K)}(\vec{e}),E^{(i_{2}K)}(\vec{e}),\dots,E^{(i_{q}K)}(\vec{e})\right), (2)

for N=anN=a^{n} and K=akK=a^{k}, with n,k{0,1,2,}=n,k\in\{0,1,2,\dots\}=\mathds{N}, knk\leq n. So NN and KK take values on

a={1,a,a2,},\mathds{P}_{a}=\{1,a,a^{2},\dots\},

the set of all non-negative integer powers of an arbitrary positive integer aa.

The restriction embodied by (2) stems from the fact that, while the left-hand side of (1) automatically comply with the structure of tensor products (the domain of {\cal E} is a Hilbert-Schmidt space), for the right-hand side, this compliance must be imposed on the functional form of EE, which is defined on q\mathds{R}^{q}. More specifically, (ϱN)=(σ(N/K)){\cal E}(\varrho^{\otimes N})={\cal E}(\sigma^{\otimes(N/K)}) is a tautology, whenever

σ(N/K)=ϱN,withσϱK.\sigma^{\otimes(N/K)}=\varrho^{\otimes N},\;\mbox{with}\;\sigma\equiv\varrho^{\otimes K}. (3)

Equation (2) guarantees that EE will not violate this rule. A figure of merit (ϱN){\cal E}(\varrho^{\otimes N}) that can be expressed through (1) and satisfying the above consistency condition is referred to as a qq-scalable (qq-S) function.

In the simplest case, q=1q=1, the constraint relation reads

E(N)(e1)=E(N/K)(E(K)(e1)).E^{(N)}(e_{1})=E^{(N/K)}\left(E^{(K)}(e_{1})\right).

Note that, while :()N+{\cal E}:{\cal B(H)}^{\otimes N}\mapsto\mathds{R}_{+}, we have E:+q+E:\mathds{R}_{+}^{q}\mapsto\mathds{R}_{+}, so that, typically, the domain of the latter has a dimension which is much lower than that of the former. In general, the functional dependencies that satisfy the constraint imposed by relation (2), may be nonlinear, the 1\ell_{1}-norm of coherence coh being a simple but nontrivial example of a 1-scalable function scal2 .

III Augmented additivity

Inspired by the additivity property as expressed by E(N)(e)=NeE^{(N)}(e)=Ne (which is the simplest 1-S function), we will investigate qq-scalable functions which, in addition, present a linear dependence on the components of e\vec{e}:

(ϱN)=E(N)(e)=Ne.{\cal E}(\varrho^{\otimes N})=E^{(N)}(\vec{e})=\vec{N}\cdot\vec{e}. (4)

This augmented notion of additivity, here referred to as qq-additivity, along with the general constraint (2), give rise to explicit recurrence relations that must be satisfied by the entries of N\vec{N}, as will be shown in the next subsection, for e=(ei1,ei2)2\vec{e}=(e_{i_{1}},e_{i_{2}})\in\mathds{R}^{2} (q=2q=2). For q=1q=1 the only possible linear dependence is that of usual additivity, E(N)(e)=NeE^{(N)}(e)=Ne.

III.1 2-S Recurrence Relations

Here we will be concerned with functions (ϱN)=E(N)(e,f){\cal E}(\varrho^{\otimes N})=E^{(N)}(e,f), where, to simplify the notation, we set ei1=ee_{i_{1}}=e and ei2=fe_{i_{2}}=f. Although this case has been considered in scal1 as a first order approximation for general 2-scalable functions, our procedure here is distinct, and will serve as a basis for the general results to be developed. Also, the strict linearity hypothesis leads to closed analytical asymptotic results, presented in the end of this section.

Assuming 2-additivity, Eq. (IV), we write

E(N)(e,f)=𝒜Ne+Nf,E^{(N)}(e,f)={\cal A}_{N}e+{\cal B}_{N}f, (5)

with N=(𝒜N,N)\vec{N}=({\cal A}_{N},{\cal B}_{N}), while the scalability condition, Eq.(2), simplifies to

E(N)(e)=E(N/K)[E(K)(e,f),E(aK)(e,f)].\displaystyle E^{(N)}(\vec{e})=E^{(N/K)}\left[E^{(K)}(e,f),E^{(aK)}(e,f)\right]. (6)

Gathering these two equations together gives

𝒜Ne+Nf\displaystyle{\cal A}_{N}e+{\cal B}_{N}f =\displaystyle= 𝒜N/KE(K)(e,f)+N/KE(aK)(e,f)\displaystyle{\cal A}_{N/K}E^{(K)}(e,f)+{\cal B}_{N/K}E^{(aK)}(e,f) (7)
=\displaystyle= 𝒜N/K[𝒜Ke+Kf]\displaystyle{\cal A}_{N/K}\left[{\cal A}_{K}e+{\cal B}_{K}f\right]
+\displaystyle+ N/K[𝒜aKe+aKf].\displaystyle{\cal B}_{N/K}\left[{\cal A}_{aK}e+{\cal B}_{aK}f\right].

To determine the coefficients it is sufficient to set K=aK=a, such that 𝒜a=0{\cal A}_{a}=0 and a=1{\cal B}_{a}=1. Combining the terms proportional to ee and ff and using the fact that these variables are assumed to be independent, we get the following coupled recurrence relations:

An\displaystyle A_{n} =\displaystyle= x Bn1,\displaystyle x\text{ }B_{n-1},
Bn\displaystyle B_{n} =\displaystyle= An1+y Bn1,\displaystyle A_{n-1}+y\text{ }B_{n-1},

where we used 𝒜a2=x{\cal A}_{a^{2}}=x, a2=y{\cal B}_{a^{2}}=y, and defined 𝒜N=An{\cal A}_{N}=A_{n} and N=Bn{\cal B}_{N}=B_{n}, with N=anN=a^{n}. By decoupling the above equations we get linear, homogeneous, second order recurrence relations with constant coefficients:

Bn=y Bn1+x Bn2\displaystyle B_{n}=y\text{ }B_{n-1}+x\text{ }B_{n-2} (8)

Similarly for AnA_{n}. The solution of the previous recurrence relation is given by the generalized hybrid Fibonacci polynomials Bn=Fn(x,y)B_{n}=F_{n}(x,y) fibonacci of two variables, xx and yy, and degree nn:

Fn(x,y)=k=0(n1)/2(n1kk)xn12kyk.F_{n}(x,y)=\sum_{k=0}^{\lfloor{(n-1)/2}\rfloor}\left(\begin{array}[]{c}n-1-k\\ k\end{array}\right)x^{n-1-2k}y^{k}. (9)

These polynomials are a general form of the famous Fibonacci Numbers, which are obtained by setting x=y=1x=y=1.

Therefore, if EE is a 2-additive function such that E(ϱan)E(\varrho^{\otimes a^{n}}) depends only on e=(ϱ)e={\cal E}(\varrho), f=(ϱa)f={\cal E}(\varrho^{\otimes a}) and nn, where E(ϱa2)=xe+yfE(\varrho^{\otimes a^{2}})=xe+yf, with xx and yy known, then, we must have:

E(an)(e)=[xFn1(x,y),Fn(x,y)](e,f)\displaystyle E^{(a^{n})}(\vec{e})=\left[xF_{n-1}(x,y),F_{n}(x,y)\right]\cdot(e,f)
=xFn1(x,y)e+Fn(x,y)f,\displaystyle=xF_{n-1}(x,y)e+F_{n}(x,y)f, (10)

for arbitrary nn. Note that, in order to use this expression, in addition to the numeric values of (ϱ){\cal E}(\varrho) and (ϱa){\cal E}(\varrho^{\otimes a}) (ee and ff respectively), it is necessary to know how the next-order quantity (ϱa2)=E(a2)(e,f){\cal E}(\varrho^{\otimes a^{2}})=E^{(a^{2})}(e,f) depends on ee and ff, that is, the coefficients xx and yy in E(a2)(e,f)=xe+yfE^{(a^{2})}(e,f)=xe+yf. The value of (ϱa3){\cal E}(\varrho^{\otimes a^{3}}) and (ϱa4){\cal E}(\varrho^{\otimes a^{4}}), for instance, are given by

E(a3)(e,f)\displaystyle E^{(a^{3})}(e,f) =\displaystyle= xye+(x+y2)f,\displaystyle xye+\left(x+y^{2}\right)f,
E(a4)(e,f)\displaystyle E^{(a^{4})}(e,f) =\displaystyle= x(x+y2)e+y(2x+y2)f.\displaystyle x\left(x+y^{2}\right)e+y\left(2x+y^{2}\right)f.

The general, solution is given by the explicit form of the Fibonacci Polynomials fibonacci and reads

An\displaystyle A_{n} =\displaystyle= x𝒵[(y+𝒵2)n1(y𝒵2)n1],\displaystyle\frac{x}{\sqrt{\cal Z}}\left[\left(\frac{y+\sqrt{\cal Z}}{2}\right)^{n-1}-\left(\frac{y-\sqrt{\cal Z}}{2}\right)^{n-1}\right], (11)
Bn\displaystyle B_{n} =\displaystyle= 1𝒵[(y+𝒵2)n(y𝒵2)n],\displaystyle\frac{1}{\sqrt{\cal Z}}\left[\left(\frac{y+\sqrt{\cal Z}}{2}\right)^{n}-\left(\frac{y-\sqrt{\cal Z}}{2}\right)^{n}\right], (12)

where 𝒵=4x+y2{\cal Z}=4x+y^{2}. Note that not all values of xx and yy are permitted, the inequality y24xy^{2}\geq-4x must be satisfied. Several such inequalities apear in the formalism of scalable quantifiers and constitute necessary conditions for the application of the theory.

We now proceed to a change of variables that will be useful to formalize the generalization of these results to qq-additivity. We replace the variables xx and yy with ν1\nu_{1} and ν2\nu_{2}, through:

y+𝒵2=aν1,y𝒵2=aν2,\frac{y+\sqrt{\cal Z}}{2}=a^{\nu_{1}},\;\;\frac{y-\sqrt{\cal Z}}{2}=a^{\nu_{2}}, (13)

where 𝒵=4x+y2=aν1aν2\sqrt{\cal Z}=\sqrt{4x+y^{2}}=a^{\nu_{1}}-a^{\nu_{2}}. Since an=Na^{n}=N, by substituting (13) into (11) and (12) we get final expressions in terms of the number of copies NN:

𝒜N\displaystyle{\cal A}_{N} =\displaystyle= aν1+ν2aν1aν2[(Na)ν1(Na)ν2],\displaystyle\frac{-a^{\nu_{1}+\nu_{2}}}{a^{\nu_{1}}-a^{\nu_{2}}}\left[\left(\frac{N}{a}\right)^{\nu_{1}}-\left(\frac{N}{a}\right)^{\nu_{2}}\right], (14)
N\displaystyle{\cal B}_{N} =\displaystyle= (Nν1Nν2aν1aν2).\displaystyle\left(\frac{N^{\nu_{1}}-N^{\nu_{2}}}{a^{\nu_{1}}-a^{\nu_{2}}}\right). (15)

We, thus, can state that any 2-additive function must be of the form:

E(N)(e,f)=(Nν2aν1Nν1aν2aν1aν2)e+(Nν1Nν2aν1aν2)f,E^{(N)}(e,f)=\left(\frac{N^{\nu_{2}}a^{\nu_{1}}-N^{\nu_{1}}a^{\nu_{2}}}{a^{\nu_{1}}-a^{\nu_{2}}}\right)e+\left(\frac{N^{\nu_{1}}-N^{\nu_{2}}}{a^{\nu_{1}}-a^{\nu_{2}}}\right)f, (16)

where

ν1=loga(y+𝒵2),ν2=loga(y𝒵2).\nu_{1}=\log_{a}{\left(\frac{y+\sqrt{\cal Z}}{2}\right)},\;\;\nu_{2}=\log_{a}{\left(\frac{y-\sqrt{\cal Z}}{2}\right)}. (17)

The change of variables (13) determines xx and yy for a 2-additive function (16). By inverting the expressions (13) we get:

{x=aν1+ν2y=aν1+aν2\left\{\begin{array}[]{rll}x&=&-a^{\nu_{1}+\nu_{2}}\\ y&=&a^{\nu_{1}}+a^{\nu_{2}}\end{array}\right. (18)

Thus, xx is always a negative number. Then, because of equations (11) and (12), these coefficients must satisfy y24|x|y^{2}\geq 4|x| for (16) to be a physically acceptable quantity. A different constraint can be obtained as follows. Since (ϱN)(ϱM){\cal E}(\varrho^{\otimes N})\geq{\cal E}(\varrho^{\otimes M}), for NMN\geq M, we must have xe+yffxe+yf\geq f, i. e., f/e|x|/(y1)f/e\geq|x|/(y-1). If these inequalities are not observed, the figure of merit cannot possibly be 2-additive.

Note that expression (16) is symmetric under exchange of the exponents ν1\nu_{1} and ν2\nu_{2}. The regularized function limN(E(N)(e)/N)\lim_{N\rightarrow\infty}(E^{(N)}(\vec{e})/N) vanishes for ν1,ν2<1\nu_{1},\nu_{2}<1, while it diverges whenever either ν1>1\nu_{1}>1 or ν2>1\nu_{2}>1. In both cases we assumed ν11\nu_{1}\neq 1 and ν21\nu_{2}\neq 1. However, if either ν1=1\nu_{1}=1 (with ν2<1\nu_{2}<1) or ν2=1\nu_{2}=1 (with ν1<1\nu_{1}<1), the regularized function turns out to be finite and non-zero. Given the symmetry ν1ν2\nu_{1}\leftrightarrow\nu_{2}, without loss of generality, we take ν1=1\nu_{1}=1 and ν2ν<1\nu_{2}\equiv\nu<1. In this case. it is easy to verify that

limNE(N)(e,f)N=faνeaaν,\lim_{N\rightarrow\infty}\frac{E^{(N)}(e,f)}{N}=\frac{f-a^{\nu}e}{a-a^{\nu}},

where ν<1\nu<1 and f>aνef>a^{\nu}e. So, if we know that a quantity of interest is 2-additive and, also, has a finite asymptotic value per copy, then, the above relation must hold. In fact, if this asymptotic value is known in advance, then the value of ff can be determined from it and from ee.

The only remaining case is ν1=ν2\nu_{1}=\nu_{2}, which leads to an indefinite limit of the kind “0/00/0”. By setting ν1=ν\nu_{1}=\nu and ν2=ν+δ\nu_{2}=\nu+\delta and expanding to first order for small δ\delta we get:

E(N)(e,f)=Nν(logaN1)e+NνaνlogaNf.E^{(N)}(e,f)=-N^{\nu}\left(\log_{a}N-1\right)e+\frac{N^{\nu}}{a^{\nu}}\log_{a}Nf. (19)

In particular, for ν1=ν2=1\nu_{1}=\nu_{2}=1, E(N)(e,f)/NE^{(N)}(e,f)/N diverges logarithmically as NN\rightarrow\infty.

IV Generalization: qq-additvity

We now set to obtain the general constraints that must be satisfied by qq-additive functions, for arbitrary qq, that we express as

E(N)(e)=Ne=jηij(N)eij.E^{(N)}(\vec{e})=\vec{N}\cdot\vec{e}=\sum_{j}\eta^{i_{j}}(N)e_{i_{j}}. (20)

In this case, the general scalability constraint (2) reads

E(N)(e)==1qηi(N/K)E(iK)(e)\displaystyle E^{(N)}(\vec{e})=\sum_{\ell=1}^{q}\eta^{i_{\ell}}(N/K)E^{(i_{\ell}K)}(\vec{e})
==1qηi(N/K)j=1qηij(iK)eij\displaystyle=\sum_{\ell=1}^{q}\eta^{i_{\ell}}(N/K)\;\sum_{j=1}^{q}\eta^{i_{j}}(i_{\ell}K)e_{i_{j}}
=j=1q(=1qηij(iK)ηi(N/K))eij.\displaystyle=\sum_{j=1}^{q}\left(\sum_{\ell=1}^{q}\eta^{i_{j}}(i_{\ell}K)\eta^{i_{\ell}}(N/K)\right)e_{i_{j}}. (21)

Comparing equations (20) and (21) we get

ηij(N)==1qηij(iK)ηi(N/K).\eta^{i_{j}}(N)=\sum_{\ell=1}^{q}\eta^{i_{j}}(i_{\ell}K)\eta^{i_{\ell}}(N/K). (22)

Therefore, expression (20) represents a qq-additive function whenever (22) is satisfied. In the simplest case we have q=1q=1 with i1=1i_{1}=1 and η1(N)=η1(K)η1(N/K)\eta_{1}(N)=\eta_{1}(K)\eta_{1}(N/K). Again, we remark that to obtain the general solution it suffices to set K=aK=a.

Let us simplify the notation using ηi(N)=ηn\eta^{i_{\ell}}(N)=\eta^{\ell}_{n} (N=anN=a^{n}), then:

ηnj==1qηjηn1.\eta^{j}_{n}=\sum_{\ell=1}^{q}\eta^{j}_{\ell}\eta^{\ell}_{n-1}. (23)

Note that, by definition, η1=0\eta^{1}_{\ell}=0 except for =q\ell=q (denoted by xx in previous section) and η2=0\eta^{2}_{\ell}=0 except for =1\ell=1 (aa copies) and for =q\ell=q (denoted by yy in previous section). Following the same reasoning we may generally write:

ηj=δj1for <q+δqηqj.\eta^{j}_{\ell}=\underbrace{\delta^{j-1}_{\ell}}_{\text{for $\ell<q$}}+\delta^{q}_{\ell}\eta^{j}_{q}. (24)

This relation states that every coefficient is null except if it satisfies the consistency conditions E(1)=e1E^{(1)}=e_{1}, E(a)=e2E^{(a)}=e_{2}, etc, up to <q\ell<q. In addition, for aqa^{q} copies we define new values ηq1(aq)=x\eta^{1}_{q}(a^{q})=x, ηq2(aq)=y\eta^{2}_{q}(a^{q})=y, etc. That is why the Kronecker delta symbols are labeled for an index <q\ell<q or for =q\ell=q. Substituting (24) into (23) we get:

ηnj\displaystyle\eta^{j}_{n} =\displaystyle= =1q(δj1for <q+δqηqj)ηn1\displaystyle\sum_{\ell=1}^{q}(\underbrace{\delta^{j-1}_{\ell}}_{\text{for $\ell<q$}}+\delta^{q}_{\ell}\eta^{j}_{q})\;\eta^{\ell}_{n-1} (25)
=\displaystyle= ηn1j1+ηn1qηqj\displaystyle\eta^{j-1}_{n-1}+\eta^{q}_{n-1}\eta^{j}_{q}

Expression (24) can be put into the following matrix form:

(ηn1ηnq) = (0000ηq11000ηq20010ηqq10001ηqq) (ηn11ηn1q)\left(\begin{matrix}\eta^{1}_{n}\\ \vdots\\ \vdots\\ \eta^{q}_{n}\\ \end{matrix}\right)\text{ }=\text{ }\left(\begin{matrix}0&0&\dots&0&0&\eta^{1}_{q}\\ 1&0&\dots&0&0&\eta^{2}_{q}\\ \vdots&\vdots&\ddots&\vdots&\vdots&\vdots&\\ 0&0&\dots&1&0&\eta^{q-1}_{q}\\ 0&0&\dots&0&1&\eta^{q}_{q}\\ \end{matrix}\right)\text{ }\left(\begin{matrix}\eta^{1}_{n-1}\\ \vdots\\ \vdots\\ \eta^{q}_{n-1}\\ \end{matrix}\right) (26)

Note that the first line is null except for the last entry ηq1\eta^{1}_{q}, while the following lines compose a (q1)×(q1)(q-1)\times(q-1) identity matrix on the left-down block and the last column is given by the numbers ηqm\eta^{m}_{q}. Let us denote this matrix by 𝒬\mathcal{Q}:

ηn=𝒬ηn1.\mathcal{\eta}_{n}=\mathcal{Q}\mathcal{\eta}_{n-1}. (27)

It is instructive to test this matrix approach in the 2-additive case:

(ηn1ηn2) = (η11η21η12η22) (ηn11ηn12) = (0x1y) (ηn11ηn12),\left(\begin{matrix}\eta^{1}_{n}\\ \eta^{2}_{n}\\ \end{matrix}\right)\text{ }=\text{ }\left(\begin{matrix}\eta^{1}_{1}&\eta^{1}_{2}\\ \eta^{2}_{1}&\eta^{2}_{2}\\ \end{matrix}\right)\text{ }\left(\begin{matrix}\eta^{1}_{n-1}\\ \eta^{2}_{n-1}\\ \end{matrix}\right)\text{ }=\text{ }\left(\begin{matrix}0&x\\ 1&y\\ \end{matrix}\right)\text{ }\left(\begin{matrix}\eta^{1}_{n-1}\\ \eta^{2}_{n-1}\\ \end{matrix}\right), (28)

which indeed leads to the generalized hybrid Fibonacci polynomials (9).

The advantage of this formalism, especially for larger values of qq, is that one can diagonalize 𝒬\mathcal{Q} through the operation ηn=D1ζn\mathcal{\eta}_{n}=D^{-1}\mathcal{\zeta}_{n} (DD is q×qq\times q): D1ζn=𝒬D1ζn1D^{-1}\zeta_{n}=\mathcal{Q}D^{-1}\zeta_{n-1}, DD1ζn=D𝒬D1ζn1DD^{-1}\zeta_{n}=D\mathcal{Q}D^{-1}\zeta_{n-1}, where [D𝒬D1]kl=λkδkl[D\mathcal{Q}D^{-1}]_{kl}=\lambda_{k}\delta_{kl} is the diagonalized matrix with λk\lambda_{k} being the eigenvalues. In this basis the solution of the qq-additivity problem is multiplicative:

ζnk=(λk)n,\zeta^{k}_{n}=(\lambda_{k})^{n}, (29)

and as ηn\eta_{n} is the result of a matrix operation D1D^{-1} on the vector ζn\zeta_{n}, we can expand it in a sum of coefficients CkmC^{m}_{k}. These coefficients will be the solutions of determined systems of equations related to expression (24).

ηnm=k=1qCkmζnk=k=1qCkm(λk)n\eta^{m}_{n}=\sum_{k=1}^{q}C^{m}_{k}\zeta^{k}_{n}=\sum_{k=1}^{q}C^{m}_{k}(\lambda_{k})^{n} (30)

IV.1 Eigenvalues and Coefficients Equations

The eigenvalues of the 𝒬\mathcal{Q}-matrix in (26) are the key ingredients of the method. Note that the eigenvalues of (28) are exactly the values we used in the change of variables (13). So we can generalize this step to:

νk=logaλk,\nu_{k}=\log_{a}{\lambda_{k}}, (31)

where λi\lambda_{i} is the iith eigenvalue of 𝒬\mathcal{Q} (So ii goes from 1 to qq), therefore being a root of the qq-order characteristic polynomial. Then the general solution, by making the change of variables (31) is:

ηnm=k=1qCkm(λ1,,λq)(λk)n    \displaystyle\eta^{m}_{n}=\sum_{k=1}^{q}C^{m}_{k}(\lambda_{1},\dots,\lambda_{q})(\lambda_{k})^{n}\text{ }\text{ }\text{ }\text{ }\text{ }
    ηm(N)=k=1qCkm(aν1,,aνq)Nνk,\displaystyle\Rightarrow\text{ }\text{ }\text{ }\text{ }\eta^{m}(N)=\sum_{k=1}^{q}C^{m}_{k}(a^{\nu_{1}},\dots,a^{\nu_{q}})N^{\nu_{k}}, (32)

where the coefficients CkmC^{m}_{k} are functions of the eigenvalues of 𝒬\mathcal{Q} and must satisfy the defined boundary conditions, ηlm=δlm1\eta^{m}_{l}=\delta^{m-1}_{l}, for l=0,,q1l=0,\dots,q-1. As each coefficient ηm(al)\eta^{m}(a^{l}) is a sum (32) with coefficients Ckm(aν1,,aνq)C^{m}_{k}(a^{\nu_{1}},\dots,a^{\nu_{q}}) these boundary conditions give rise to qq systems of qq coupled, but linear equations to be solved. After one solves these systems of equations the problem is finished:

E(N)(e)\displaystyle E^{(N)}(\vec{e}) =\displaystyle= m=1qk=1qCkmNνkem\displaystyle\sum_{m=1}^{q}\sum_{k=1}^{q}C^{m}_{k}N^{\nu_{k}}e_{m}
k=1qCkmalνk\displaystyle\sum_{k=1}^{q}C^{m}_{k}a^{l\nu_{k}} =\displaystyle= δlm1   ,   l=0,,q1.\displaystyle\delta^{m-1}_{l}\text{ }\text{ }\text{ },\text{ }\text{ }\text{ }l=0,...,q-1.

Let us resume the 2-additive case, using the matrix formalism. The eigenvalues of:

𝒬=(0x1y)\mathcal{Q}=\left(\begin{matrix}0&x\\ 1&y\\ \end{matrix}\right) (33)

are λ1=(y+𝒵)/2\lambda_{1}=(y+\sqrt{\cal Z})/2 and λ2=(y𝒵)/2\lambda_{2}=(y-\sqrt{\cal Z})/2. Then:

ηm(N)=C1mNν1+C2mNν2,\eta^{m}(N)=C^{m}_{1}N^{\nu_{1}}+C^{m}_{2}N^{\nu_{2}}, (34)

where ν1=logaλ1\nu_{1}=\log_{a}\lambda_{1} and ν2=logaλ2\nu_{2}=\log_{a}\lambda_{2}, with boundary conditions η1(1)=1,η1(a)=0\eta^{1}(1)=1,\eta^{1}(a)=0 and η2(1)=0,η2(a)=1\eta^{2}(1)=0,\eta^{2}(a)=1. We get two systems of equations to solve:

{C11+C21=1C11aν1+C21aν2=0\displaystyle\left\{\begin{array}[]{rll}C^{1}_{1}+C^{1}_{2}&=&1\\ C^{1}_{1}a^{\nu_{1}}+C^{1}_{2}a^{\nu_{2}}&=&0\end{array}\right.

implying

C11(aν1,aν2)=aν2aν1aν2=1C21(aν1,aν2),C^{1}_{1}(a^{\nu_{1}},a^{\nu_{2}})=\frac{-a^{\nu_{2}}}{a^{\nu_{1}}-a^{\nu_{2}}}=1-C^{1}_{2}(a^{\nu_{1}},a^{\nu_{2}}),

and

{C12+C22=0C12aν1+C22aν2=1\displaystyle\left\{\begin{array}[]{rll}C^{2}_{1}+C^{2}_{2}&=&0\\ C^{2}_{1}a^{\nu_{1}}+C^{2}_{2}a^{\nu_{2}}&=&1\end{array}\right.

with solution

C12(aν1,aν2)=1aν1aν2=C22(aν1,aν2).C^{2}_{1}(a^{\nu_{1}},a^{\nu_{2}})=\frac{1}{a^{\nu_{1}}-a^{\nu_{2}}}=-C^{2}_{2}(a^{\nu_{1}},a^{\nu_{2}}).

These lead, exactly, to the results we have found in (14) and (15).

V 3-additivity

The next simpler case is that of 3-additivity, for which we have:

𝒬=(00x10y01z).\mathcal{Q}=\left(\begin{matrix}0&0&x\\ 1&0&y\\ 0&1&z\end{matrix}\right). (39)

One can find the three eigenvalues of this matrix, change variables νk=logaλk\nu_{k}=\log_{a}\lambda_{k}, k=1,2,3k=1,2,3, and write:

ηm(N)=C1mNν1+C2mNν2+C3mNν3\eta^{m}(N)=C^{m}_{1}N^{\nu_{1}}+C^{m}_{2}N^{\nu_{2}}+C^{m}_{3}N^{\nu_{3}} (40)

Now we have boundary conditions η1(1)=1,η1(a)=η1(a2)=0\eta^{1}(1)=1,\eta^{1}(a)=\eta^{1}(a^{2})=0, η2(1)=η2(a2)=0,η2(a)=1\eta^{2}(1)=\eta^{2}(a^{2})=0,\eta^{2}(a)=1 and η3(1)=η3(a2)=0,η3(a2)=1\eta^{3}(1)=\eta^{3}(a^{2})=0,\eta^{3}(a^{2})=1. So, there are three systems of equations to be solved:

{C1m+C2m+C3m=δ0m1C1maν1+C2maν2+C3maν3=δ1m1C1ma2ν1+C2ma2ν2+C3ma2ν3=δ2m1\displaystyle\left\{\begin{array}[]{rll}C^{m}_{1}+C^{m}_{2}+C^{m}_{3}&=&\delta^{m-1}_{0}\\ C^{m}_{1}a^{\nu_{1}}+C^{m}_{2}a^{\nu_{2}}+C^{m}_{3}a^{\nu_{3}}&=&\delta^{m-1}_{1}\\ C^{m}_{1}a^{2\nu_{1}}+C^{m}_{2}a^{2\nu_{2}}+C^{m}_{3}a^{2\nu_{3}}&=&\delta^{m-1}_{2}\end{array}\right.

These systems can be easily dealt with through some software capable of symbolic manipulations, like mathematica. The nine coefficients we obtained read:

C11\displaystyle C^{1}_{1} =\displaystyle= aν2+ν3(aν1aν2)(aν1aν3),\displaystyle\frac{a^{\nu_{2}+\nu_{3}}}{(a^{\nu_{1}}-a^{\nu_{2}})(a^{\nu_{1}}-a^{\nu_{3}})},
C21\displaystyle C^{1}_{2} =\displaystyle= aν1+ν3(aν2aν1)(aν2aν3),\displaystyle\frac{a^{\nu_{1}+\nu_{3}}}{(a^{\nu_{2}}-a^{\nu_{1}})(a^{\nu_{2}}-a^{\nu_{3}})},
C31\displaystyle C^{1}_{3} =\displaystyle= aν1+ν2(aν3aν1)(aν3aν2)\displaystyle\frac{a^{\nu_{1}+\nu_{2}}}{(a^{\nu_{3}}-a^{\nu_{1}})(a^{\nu_{3}}-a^{\nu_{2}})}
C12\displaystyle C^{2}_{1} =\displaystyle= (aν2+aν3)(aν1aν2)(aν1aν3),\displaystyle\frac{-(a^{\nu_{2}}+a^{\nu_{3}})}{(a^{\nu_{1}}-a^{\nu_{2}})(a^{\nu_{1}}-a^{\nu_{3}})},
C22\displaystyle C^{2}_{2} =\displaystyle= (aν1+aν3)(aν2aν1)(aν2aν3),\displaystyle\frac{-(a^{\nu_{1}}+a^{\nu_{3}})}{(a^{\nu_{2}}-a^{\nu_{1}})(a^{\nu_{2}}-a^{\nu_{3}})},
C32\displaystyle C^{2}_{3} =\displaystyle= (aν1+aν2)(aν3aν1)(aν3aν2),\displaystyle\frac{-(a^{\nu_{1}}+a^{\nu_{2}})}{(a^{\nu_{3}}-a^{\nu_{1}})(a^{\nu_{3}}-a^{\nu_{2}})},
C13\displaystyle C^{3}_{1} =\displaystyle= 1(aν1aν2)(aν1aν3),\displaystyle\frac{1}{(a^{\nu_{1}}-a^{\nu_{2}})(a^{\nu_{1}}-a^{\nu_{3}})},
C23\displaystyle C^{3}_{2} =\displaystyle= 1(aν2aν1)(aν2aν3),\displaystyle\frac{1}{(a^{\nu_{2}}-a^{\nu_{1}})(a^{\nu_{2}}-a^{\nu_{3}})},
C33\displaystyle C^{3}_{3} =\displaystyle= 1(aν3aν1)(aν3aν2).\displaystyle\frac{1}{(a^{\nu_{3}}-a^{\nu_{1}})(a^{\nu_{3}}-a^{\nu_{2}})}.

In these solutions we initially assume that all three exponents should be different from each other ν1ν2ν3ν1\nu_{1}\neq\nu_{2}\neq\nu_{3}\neq\nu_{1}. However, as we will see, as in the 2-additive case, the way they are combined to compose the solution, relation (32), leads to E(N)(e)=(C11e1+C12e2+C13e3)Nν1+(C21e1+C22e2+C23e3)Nν2+(C31e1+C32e2+C33e3)Nν3E^{(N)}(\vec{e})=(C^{1}_{1}e_{1}+C^{2}_{1}e_{2}+C^{3}_{1}e_{3})N^{\nu_{1}}+(C^{1}_{2}e_{1}+C^{2}_{2}e_{2}+C^{3}_{2}e_{3})N^{\nu_{2}}+(C^{1}_{3}e_{1}+C^{2}_{3}e_{2}+C^{3}_{3}e_{3})N^{\nu_{3}}, for which no divergence appears for νi=νj\nu_{i}=\nu_{j}.

The previous results can be sumarized as the following statement.

Proposition: Let ϱ()\varrho\in\mathcal{B}\left(\mathcal{H}\right) and NaN\in\mathds{P}_{a}. If \mathcal{E} is a 3-additive function such that (ϱN)=E(N)(e)=Ne\mathcal{E}(\varrho^{\otimes N})=E^{(N)}(\vec{e})=\vec{N}\cdot\vec{e}, with e=(e1,e2,e3)=((ϱ),(ϱa),(ϱa2))\vec{e}=(e_{1},e_{2},e_{3})=(\mathcal{E}(\varrho),\mathcal{E}(\varrho^{\otimes a}),\mathcal{E}(\varrho^{\otimes a^{2}})), where E(a3)(e)=x e1+y e2+z e3E^{(a^{3})}(\vec{e})=x\text{ }e_{1}+y\text{ }e_{2}+z\text{ }e_{3}, with xx, yy and zz (equivalently ν1\nu_{1}, ν2\nu_{2} and ν3\nu_{3}) known, then, we have:

E(N)(e)=aν2+ν3e1(aν2+aν3)e2+e3(aν1aν2)(aν1aν3)Nν1\displaystyle E^{(N)}(\vec{e})=\frac{a^{\nu_{2}+\nu_{3}}e_{1}-(a^{\nu_{2}}+a^{\nu_{3}})e_{2}+e_{3}}{(a^{\nu_{1}}-a^{\nu_{2}})(a^{\nu_{1}}-a^{\nu_{3}})}N^{\nu_{1}}
+aν1+ν3e1(aν1+aν3)e2+e3(aν2aν1)(aν2aν3)Nν2\displaystyle+\frac{a^{\nu_{1}+\nu_{3}}e_{1}-(a^{\nu_{1}}+a^{\nu_{3}})e_{2}+e_{3}}{(a^{\nu_{2}}-a^{\nu_{1}})(a^{\nu_{2}}-a^{\nu_{3}})}N^{\nu_{2}}
+aν1+ν2e1(aν1+aν2)e2+e3(aν3aν1)(aν3aν2)Nν3,\displaystyle+\frac{a^{\nu_{1}+\nu_{2}}e_{1}-(a^{\nu_{1}}+a^{\nu_{2}})e_{2}+e_{3}}{(a^{\nu_{3}}-a^{\nu_{1}})(a^{\nu_{3}}-a^{\nu_{2}})}N^{\nu_{3}},

where νk=logaλk\nu_{k}=\log_{a}\lambda_{k}, k=1,2,3k=1,2,3, with λk\lambda_{k} being the kk-th eigenvalue of matrix (26).

The 3-additive function normalized per copy, E(N)(e)/NE^{(N)}(\vec{e})/N, is unbounded if any of the νj>1\nu_{j}>1 and vanishes if ν1,ν2,ν3<1\nu_{1},\nu_{2},\nu_{3}<1, in the limit of large NN. Again, we have permutation symmetry throughout, i. e., invariance under ν1ν2\nu_{1}\leftrightarrow\nu_{2}, ν2ν3\nu_{2}\leftrightarrow\nu_{3} or ν1ν3\nu_{1}\leftrightarrow\nu_{3}. The cases in which two or three νj\nu_{j} coincide must be dealt with care. For instance, if we make ν1=ν\nu_{1}=\nu, ν2=ν+δ\nu_{2}=\nu+\delta, and ν3=ν+ϵ\nu_{3}=\nu+\epsilon, take first the limit δ0\delta\rightarrow 0 and afterwards the limit ϵ0\epsilon\rightarrow 0, we get:

E(N)(e)=Nν[132logaN+12(logaN)2]e1\displaystyle E^{(N)}(\vec{e})=N^{\nu}\left[1-\frac{3}{2}\log_{a}N+\frac{1}{2}(\log_{a}N)^{2}\right]e_{1}
(Na)ν[2logaN+12(logaN)2]e2\displaystyle-\left(\frac{N}{a}\right)^{\nu}\left[2\log_{a}N+\frac{1}{2}(\log_{a}N)^{2}\right]e_{2}
+(Na2)ν[12logaN+12(logaN)2]e3,\displaystyle+\left(\frac{N}{a^{2}}\right)^{\nu}\left[\frac{1}{2}\log_{a}N+\frac{1}{2}(\log_{a}N)^{2}\right]e_{3}, (42)

for ν1=ν2=ν3\nu_{1}=\nu_{2}=\nu_{3}. In particular, for ν=1\nu=1 and in the limit of large NN, E(N)(e)/NE^{(N)}(\vec{e})/N diverges as (logaN)2\sim(\log_{a}N)^{2}.

In the next subsection we use a 3-additive function to describe the one-shot-distillable (OSD) entanglement of a family of isotropic two-qudit states. We assess the effectiveness of our framework by comparison with computational data obtained via linear program reported in ieee .

V.1 Comparison with numeric data on One Shot Distillable (OSD) entanglement

In this section we compare an appropriate 3-additive function with the OSD entanglement of a family of symmetric states (see below). The OSD entanglement can be defined for several inequivalent classes of operations as, for instance, Local Operations and Classical Communications (LOCC) and Positive Partial Transpose (PPT) preserving operations. Throughout this work, whenever we mention the OSD entanglement, we are referring to PPT operations. Thus, we do not make this explicit in the notation. The one shot ε\varepsilon-error distillable entanglement of a bipartite state ϱ\varrho, with respect to PPT operations, is defined as the following optimization ieee :

EOSDε=log2max{k|F(ϱ,k)1ε},E_{OSD}^{\varepsilon}=\log_{2}\max\{k\in\mathds{N}|F(\varrho,k)\geq 1-\varepsilon\}, (43)

where FF is the fidelity of distillation defined in rains ,

F(ϱ,k)=maxΠPPTTr[Π(ϱ)Ψk],F(\varrho,k)=\max_{\tiny\Pi\in PPT}{\rm Tr}[\Pi(\varrho)\Psi_{k}],

Ψk\Psi_{k} being the maximally entangled state of two kk-dimensional systems: Ψk=|ψkψk|\Psi_{k}=|\psi_{k}\rangle\langle\psi_{k}| (|ψk=1/ki=0k|i|i|\psi_{k}\rangle=1/\sqrt{k}\sum_{i=0}^{k}|i\rangle|i\rangle). The maximization is over all PPT operations.

We will calculate the OSD entanglement of NN copies of two entangled dd-dimensional states ϱFN\varrho^{\otimes N}_{F}, where

ϱF=FΨd+(1F)𝟙Ψdd21,   with  0F1,\varrho_{F}=F\Psi_{d}+(1-F)\frac{\mathds{1}-\Psi_{d}}{d^{2}-1},\text{ }\text{ }\text{ with }\text{ }0\leq F\leq 1, (44)

FF being the fidelity of the state and Ψd\Psi_{d} is the maximally entangled state of two qudits. Although, presently, there is no closed analytical expression for the OSD entanglement of ϱF\varrho_{F}, the authors of ieee showed that the problem can be written as a linear program.

Superactivation is a common trait of OSD entanglement and will show up for all parameters (FF and dd) we address here, that is, we find OSD(ϱFN)=0\mathcal{E}_{OSD}(\varrho_{F}^{\otimes N})=0 for N<NS.A.N<N_{S.A.} and OSD(ϱFN)>0\mathcal{E}_{OSD}(\varrho_{F}^{\otimes N})>0 for NNS.A.N\geq N_{S.A.} We will take this into account, in the framework of 3-additivity, by setting e1=0e_{1}=0 and a=NS.A.a=N_{S.A.}. In addition, in scal1 , it was demonstrated that the OSD entanglement of a family of Bell states has terms proportional to NN and N\sqrt{N}. Also in this reference, it was shown that the same terms plus an additive constant that corresponds to the asymptotic value of the regularized OSD entanglement, provide a good description of the OSD entanglement of ϱF\varrho_{F}. For these reasons we use the parameters (ν1,ν2,ν3)=(1,12,0)(\nu_{1},\nu_{2},\nu_{3})=(1,\frac{1}{2},0), where the ordering of the exponents is irrelevant due to the aforementioned permutation symmetry. The regularized expression, then, becomes completely determined and reads

E(N)(e)N=[(a+1)(aa)(a1)+(a+1)(aa)(a1)N+(a+a)(1a)(1a)N]e2\displaystyle\frac{E^{(N)}(\vec{e})}{N}=-\left[\frac{(\sqrt{a}+1)}{(a-\sqrt{a})(a-1)}+\frac{(a+1)}{(\sqrt{a}-a)(\sqrt{a}-1)\sqrt{N}}+\frac{(a+\sqrt{a})}{(1-a)(1-\sqrt{a})N}\right]e_{2}
+[1(aa)(a1)+1(aa)(a1)N+1(1a)(1a)N]e3,\displaystyle+\left[\frac{1}{(a-\sqrt{a})(a-1)}+\frac{1}{(\sqrt{a}-a)(\sqrt{a}-1)\sqrt{N}}+\frac{1}{(1-a)(1-\sqrt{a})N}\right]e_{3}, (45)

with e2=(ϱa)e_{2}=\mathcal{E}(\varrho^{\otimes a}) and e3=(ϱa2)e_{3}=\mathcal{E}(\varrho^{\otimes a^{2}}). The, finite, regularized asymptotic limit becomes simply:

limNE(N)(e)N=(a+1)e2+e3(aa)(a1).\lim_{N\rightarrow\infty}\frac{E^{(N)}(\vec{e})}{N}=\frac{-(\sqrt{a}+1)e_{2}+e_{3}}{(a-\sqrt{a})(a-1)}. (46)

We will test expression (45) for entangled qubits, qutrits and ququarts, where, in all cases, we set the error tolerance to ε=0.001\varepsilon=0.001, as in ieee . We stress that, although our formal statements only refer to powers of a given integer aa, the results below indicate that the 3-additive expression serves as a good approximation to the OSD entanglement of arbitrary NN.

Refer to caption
Figure 1: The regularized 3-additive function of Eq. (45) for two entangled qubits (d=2d=2) with F=0.96F=0.96 (superactivation at a=6a=6) is shown as a continuous curve to facilitate visualization. The bullets represent the numeric results obtained via linear programming, up to N=50N=50.

We start with the simplest scenario of two entangled qubits (d=2d=2), with F=0.96F=0.96. Despite the high fidelity, superactivation occurs only at N=6=aN=6=a copies. The input parameters, obtained from the mentioned linear program, are e2=(ϱ6)=1e_{2}={\cal E}(\varrho^{\otimes 6})=1 and e3=(ϱ36)=36×0.405e_{3}={\cal E}(\varrho^{\otimes 36})=36\times 0.405. In figure 1, the corresponding numeric results (bullets) are shown, up to N=50N=50, and compared with the corresponding 3-additive function, equation (45).

Next we address, in more detail, the exact system and parameters used in ieee : two entangled qutrits (d=3d=3) with F=0.9F=0.9. With these parameters, the OSD entanglement is also superactivated for a=6a=6 copies. The input parameters are e2=(ϱ6)=1e_{2}={\cal E}(\varrho^{\otimes 6})=1 and e3=(ϱ36)=36×0.518e_{3}={\cal E}(\varrho^{\otimes 36})=36\times 0.518. We reproduce the numeric results of ieee up to N=40N=40 and compare them to the corresponding 3-additive function in figure 2. In addition, the asymptotic limit given by the simple expression (46) is 0.86\approx 0.86, while the actual result, determined in ieee is 0.81\approx 0.81, an accuracy of 94%\sim 94\%. Note that, as it was discussed in the introduction, the asymptotic regime may become dominant only for very high NN. In the present case, for N=40N=40 asymptotic expressions would not be a good description, since the points still do not show a tendency to saturation. Indeed, for N=40N=40, the OSD entanglement per copy is bellow 0.550.55, while the approximate saturation should occur around 0.810.81. This feature is qualitatively valid for the other cases studied here.

Refer to caption
Figure 2: The regularized 3-additive function of Eq. (45) for two entangled qutrits (d=3d=3) with F=0.9F=0.9 (superactivation at a=6a=6) is shown as a continuous curve to facilitate visualization. The bullets represent the numeric results obtained via linear programming, up to N=40N=40.

Finally, we go to higher dimensional states: d=4d=4 with F=0.9F=0.9 (superactivation for 5 copies). The input parameters are e2=(ϱ5)=1e_{2}={\cal E}(\varrho^{\otimes 5})=1 and e3=(ϱ25)=25×0.659e_{3}={\cal E}(\varrho^{\otimes 25})=25\times 0.659. We use the linear program given in ieee to calculate the OSD entanglement, up to N=30N=30. Again, the continuous line represents expression (45). Although for N30N\sim 30 we have E(N)(e)/N0.7E^{(N)}(\vec{e})/N\approx 0.7, the points do not show a tendency to saturate. Indeed, the asymptotic value of E(N)(e)/NE^{(N)}(\vec{e})/N is around 1.1971.197, as predicted by (46). Differently from the case d=3d=3 (and obviously from the case d=2d=2), for d=4d=4 and F=0.9F=0.9 more than a singlet can be distilled per ququart, asymptotically, according to the 3-additive formula.

Refer to caption
Figure 3: The regularized 3-additive function of Eq. (45) for two entangled ququarts (d=4d=4) with F=0.9F=0.9 (superactivation at a=5a=5) is shown as a continuous curve to facilitate visualization. The bullets represent the numeric results obtained via linear programming, up to N=30N=30.

It is clear from these examples that the simple 3-additive expression provides a good qualitative description, with a quantitative accuracy which is typically above 90%\%. We stress that there is no free fitting parameter to be adjusted in formula (45).

It is worth mentioning that several internal consistency condition can be derived. For instance, Eq. (46) and the positivity of {\cal E} imply:

e3(a+1)e2.e_{3}\geq(\sqrt{a}+1)e_{2}. (47)

If the numeric determination of e2e_{2} and e3e_{3} leads to a violation of the above condition, equation (45) can be dismissed as a possible description of the figure of merit under investigation. It is clear that this corresponds to a nontrivial constraint only for sub-additive quantifiers [(ϱN)/N{\cal E}(\varrho^{\otimes N})/N being a decreasing function of NN].

VI Closing remarks

For several resource quantifiers whose domains are high-dimensional Hilbert-Schmidt spaces, (ϱN):()N+{\cal E}(\varrho^{\otimes N}):{\cal B(H)}^{\otimes N}\mapsto\mathds{R}_{+}, there is a “gray zone” between small values of NN and the asymptotic regime NN\rightarrow\infty, for which the evaluation of {\cal E} becomes a prohibitive task. In this regard, any method that helps to circumvent the direct evaluation of these figures of merit, avoiding or reducing the need of optimization processes, may be useful in quantum information science. In this work we have introduced the concept of qq-additivity by considering a natural extension of the notion of additive measures, thus, going from (ϱN)=Ne{\cal E}(\varrho^{\otimes N})=Ne to (ϱN)=Ne{\cal E}(\varrho^{\otimes N})=\vec{N}\cdot\vec{e}.

The formalism naturally accommodates the phenomenon of superactivation, by setting one of the components of e\vec{e} to zero. Although we derived explicit expressions for 2- and 3-additive functions only, the general framework of qq-additivity can be addressed via linear systems of equations. Therefore, the problem is amenable to computational treatment for larger values of qq. It is hoped that this framework can provide a useful tool to deal with the mentioned gray-zone problem.

Regarding the usefulness prospects of the presented formalism, in a broader scenario, a key question is: Given a resource quantifier {\cal E}, can one prove (or disprove) qq-additivity (or more generally qq-scalability scal1 ) directly from the definition of {\cal E}, without actually calculating {\cal E}? A positive answer for a given quantifier, at least for a particular class of states, would mean a huge simplification. Another research direction that may be interesting is the possibility to define computable measures by using qq-additivity as an ingredient, from the outset.

We mostly referred to entanglement measures. The presented results, however, are equally valid for coherence measures coh ; coh2 ; coh3 ; coh4 ; coh5 ; coh6 ; coherence , for instance, and for the evaluation of other quantum figures of merit.

Acknowledgements.
This work received financial support from the Brazilian agencies Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES), Fundação de Amparo à Ciência e Tecnologia do Estado de Pernambuco (FACEPE), and Conselho Nacional de Desenvolvimento Científico e Tecnológico through its program CNPq INCT-IQ (Grant 465469/2014-0).

References

  • (1) The term “resource” is employed in the general sense, since the results to be derived do not rely on all the requirements for a quantity to be a resource (in the resource-theoretic sense).
  • (2) G. Vidal and R. F. Werner, Phys. Rev. A 65, 032314 (2002).
  • (3) M. Christandl and A. Winter, J. Math. Phys. 45, 829 (2004).
  • (4) R. Horodecki, P. Horodecki, M. Horodecki, K. Horodecki, Rev. Mod. Phys. 81, 865 (2009).
  • (5) C. H. Bennett, D. P. DiVincenzo, J. Smolin, and W. K. Wootters, Phys. Rev. A 54, 3824 (1996).
  • (6) M. B. Hastings, Nature Phys. 5, 255 (2009).
  • (7) H. Barnum and N. Linden, J. Phys. A: Math. Gen. 34, 6787 (2001).
  • (8) H. Zhu, L. Chen, and M. Hayashi, New J. Phys. 12, 083002 (2010).
  • (9) D. Li, X. Li, H. Huang, and X. Li, J. Math. Phys. 50, 012104 (2009).
  • (10) D. Li, X. Li, H. Huang, and X. Li, Phys. Rev A 76, 032304 (2007).
  • (11) P. W. Shor, J. A. Smolin, and A. Thapliyal, Phys. Rev. Lett. 90, 107901 (2003).
  • (12) J. Watrous, Phys. Rev. Lett. 93, 010502 (2004).
  • (13) F. Buscemi and N. Datta, J. Math. Phys. 51, 102201 (2010).
  • (14) M. Tomamichel, M. Berta, and J. M. Renes, Nature Comm. 7, 11419 (2016).
  • (15) K. Fang, X. Wang, M. Tomamichel, and R. Duan, IEEE Transactions on Information Theory 65, 6454 (2019).
  • (16) F. Parisio, Phys. Rev. A 102, 012413 (2020).
  • (17) T. Baumgratz, M. Cramer, and M. B. Plenio, Phys. Rev. Lett. 113, 140401 (2014).
  • (18) L. F. Melo and F. Parisio, Quantum Inf Process 20, 355 (2021).
  • (19) T. Koshy, Fibonacci and Lucas numbers with applications, New York: Wiley (2001).
  • (20) E. Rains, IEEE Trans. Inform. Theory 47, 2921 (2001). [Online].
  • (21) D. Girolami, Phys. Rev. Lett. 113, 170401 (2014).
  • (22) A. Streltsov, U. Singh, H. S. Dhar, M. N. Bera, and G. Adesso, Phys. Rev. Lett. 115, 02403 (2015).
  • (23) X. Yuan, H. Zhou, Z. Cao, and X. Ma, Phys. Rev. A 92, 022124 (2015).
  • (24) S. Rana, P. Parashar, and M. Lewenstein, Phys. Rev. A 93, 012110 (2016).
  • (25) C. Napoli, T. R. Bromley, M. Cianciaruso, M. Piani, N. Johnston, and G. Adesso, Phys. Rev. Lett. 116, 150502 (2016).
  • (26) Z. Xi, Y. Li, and H. Fan, Scientific Reports 5, 10922 (2015).