Enlarging the notion of additivity of resource quantifiers
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 and a quantifier , both arbitrary, it is a hard task to determine . However, if the figure of merit turns out to be additive, we simply have , with . In this work we generalize this useful notion through the inner product , where is a vector whose entries are the figure of merit under study calculated for some numbers of copies smaller than (), where , is a string of numbers that depends only on and on the set of integers . 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 , require the preparation of a large number of copies of this state to be accomplished. In some situations, it turns out that employing and global operations over the large Hilbert-Schmidt space it inhabits proves to be advantageous in comparison with the isolated manipulation of copies of . 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 . Thus, additivity renders an otherwise hard problem trivial: the evaluation of the amount of resources contained in copies of a given state , , once we know . We remark that a stronger notion of additivity is , for all pairs of states and . 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 , we may find states , such that and , for some , as is the case of the distillable entanglement superact ; watrous .
The technical difficulty to determine 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 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 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 limit.
II Preliminaries: Scalable quantum functions
Let us initially formalize the notion of scalability scal1 . Consider an arbitrary function with argument , . In practice, the quantity 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 real numbers, namely, , , , . That is, once we know the value of for some smaller number of copies, is determined:
(1) |
where, for short, we collect the non-negative numbers as the components of a vector in the positive hyperoctant of ,
One of the main results of scal1 is that the possible functional forms of must satisfy the constraint
(2) |
for and , with , . So and take values on
the set of all non-negative integer powers of an arbitrary positive integer .
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 is a Hilbert-Schmidt space), for the right-hand side, this compliance must be imposed on the functional form of , which is defined on . More specifically, is a tautology, whenever
(3) |
Equation (2) guarantees that will not violate this rule. A figure of merit that can be expressed through (1) and satisfying the above consistency condition is referred to as a -scalable (-S) function.
In the simplest case, , the constraint relation reads
Note that, while , we have , 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 -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 (which is the simplest 1-S function), we will investigate -scalable functions which, in addition, present a linear dependence on the components of :
(4) |
This augmented notion of additivity, here referred to as -additivity, along with the general constraint (2), give rise to explicit recurrence relations that must be satisfied by the entries of , as will be shown in the next subsection, for (). For the only possible linear dependence is that of usual additivity, .
III.1 2-S Recurrence Relations
Here we will be concerned with functions , where, to simplify the notation, we set and . 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
(5) |
with , while the scalability condition, Eq.(2), simplifies to
(6) |
Gathering these two equations together gives
(7) | |||||
To determine the coefficients it is sufficient to set , such that and . Combining the terms proportional to and and using the fact that these variables are assumed to be independent, we get the following coupled recurrence relations:
where we used , , and defined and , with . By decoupling the above equations we get linear, homogeneous, second order recurrence relations with constant coefficients:
(8) |
Similarly for . The solution of the previous recurrence relation is given by the generalized hybrid Fibonacci polynomials fibonacci of two variables, and , and degree :
(9) |
These polynomials are a general form of the famous Fibonacci Numbers, which are obtained by setting .
Therefore, if is a 2-additive function such that depends only on , and , where , with and known, then, we must have:
(10) |
for arbitrary . Note that, in order to use this expression, in addition to the numeric values of and ( and respectively), it is necessary to know how the next-order quantity depends on and , that is, the coefficients and in . The value of and , for instance, are given by
The general, solution is given by the explicit form of the Fibonacci Polynomials fibonacci and reads
(11) | |||||
(12) |
where . Note that not all values of and are permitted, the inequality 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 -additivity. We replace the variables and with and , through:
(13) |
where . Since , by substituting (13) into (11) and (12) we get final expressions in terms of the number of copies :
(14) | |||||
(15) |
We, thus, can state that any 2-additive function must be of the form:
(16) |
where
(17) |
The change of variables (13) determines and for a 2-additive function (16). By inverting the expressions (13) we get:
(18) |
Thus, is always a negative number. Then, because of equations (11) and (12), these coefficients must satisfy for (16) to be a physically acceptable quantity. A different constraint can be obtained as follows. Since , for , we must have , i. e., . 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 and . The regularized function vanishes for , while it diverges whenever either or . In both cases we assumed and . However, if either (with ) or (with ), the regularized function turns out to be finite and non-zero. Given the symmetry , without loss of generality, we take and . In this case. it is easy to verify that
where and . 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 can be determined from it and from .
The only remaining case is , which leads to an indefinite limit of the kind “”. By setting and and expanding to first order for small we get:
(19) |
In particular, for , diverges logarithmically as .
IV Generalization: -additvity
We now set to obtain the general constraints that must be satisfied by -additive functions, for arbitrary , that we express as
(20) |
In this case, the general scalability constraint (2) reads
(21) |
Comparing equations (20) and (21) we get
(22) |
Therefore, expression (20) represents a -additive function whenever (22) is satisfied. In the simplest case we have with and . Again, we remark that to obtain the general solution it suffices to set .
Let us simplify the notation using (), then:
(23) |
Note that, by definition, except for (denoted by in previous section) and except for ( copies) and for (denoted by in previous section). Following the same reasoning we may generally write:
(24) |
This relation states that every coefficient is null except if it satisfies the consistency conditions , , etc, up to . In addition, for copies we define new values , , etc. That is why the Kronecker delta symbols are labeled for an index or for . Substituting (24) into (23) we get:
(25) | |||||
Expression (24) can be put into the following matrix form:
(26) |
Note that the first line is null except for the last entry , while the following lines compose a identity matrix on the left-down block and the last column is given by the numbers . Let us denote this matrix by :
(27) |
It is instructive to test this matrix approach in the 2-additive case:
(28) |
which indeed leads to the generalized hybrid Fibonacci polynomials (9).
The advantage of this formalism, especially for larger values of , is that one can diagonalize through the operation ( is ): , , where is the diagonalized matrix with being the eigenvalues. In this basis the solution of the -additivity problem is multiplicative:
(29) |
and as is the result of a matrix operation on the vector , we can expand it in a sum of coefficients . These coefficients will be the solutions of determined systems of equations related to expression (24).
(30) |
IV.1 Eigenvalues and Coefficients Equations
The eigenvalues of the -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:
(31) |
where is the th eigenvalue of (So goes from 1 to ), therefore being a root of the -order characteristic polynomial. Then the general solution, by making the change of variables (31) is:
(32) |
where the coefficients are functions of the eigenvalues of and must satisfy the defined boundary conditions, , for . As each coefficient is a sum (32) with coefficients these boundary conditions give rise to systems of coupled, but linear equations to be solved. After one solves these systems of equations the problem is finished:
V 3-additivity
The next simpler case is that of 3-additivity, for which we have:
(39) |
One can find the three eigenvalues of this matrix, change variables , , and write:
(40) |
Now we have boundary conditions , and . So, there are three systems of equations to be solved:
These systems can be easily dealt with through some software capable of symbolic manipulations, like mathematica. The nine coefficients we obtained read:
In these solutions we initially assume that all three exponents should be different from each other . However, as we will see, as in the 2-additive case, the way they are combined to compose the solution, relation (32), leads to , for which no divergence appears for .
The previous results can be sumarized as the following statement.
Proposition: Let and . If is a 3-additive function such that , with , where , with , and (equivalently , and ) known, then, we have:
where , , with being the -th eigenvalue of matrix (26).
The 3-additive function normalized per copy, , is unbounded if any of the and vanishes if , in the limit of large . Again, we have permutation symmetry throughout, i. e., invariance under , or . The cases in which two or three coincide must be dealt with care. For instance, if we make , , and , take first the limit and afterwards the limit , we get:
(42) |
for . In particular, for and in the limit of large , diverges as .
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 -error distillable entanglement of a bipartite state , with respect to PPT operations, is defined as the following optimization ieee :
(43) |
where is the fidelity of distillation defined in rains ,
being the maximally entangled state of two -dimensional systems: (). The maximization is over all PPT operations.
We will calculate the OSD entanglement of copies of two entangled -dimensional states , where
(44) |
being the fidelity of the state and is the maximally entangled state of two qudits. Although, presently, there is no closed analytical expression for the OSD entanglement of , 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 ( and ) we address here, that is, we find for and for We will take this into account, in the framework of 3-additivity, by setting and . In addition, in scal1 , it was demonstrated that the OSD entanglement of a family of Bell states has terms proportional to and . 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 . For these reasons we use the parameters , where the ordering of the exponents is irrelevant due to the aforementioned permutation symmetry. The regularized expression, then, becomes completely determined and reads
(45) |
with and . The, finite, regularized asymptotic limit becomes simply:
(46) |
We will test expression (45) for entangled qubits, qutrits and ququarts, where, in all cases, we set the error tolerance to , as in ieee . We stress that, although our formal statements only refer to powers of a given integer , the results below indicate that the 3-additive expression serves as a good approximation to the OSD entanglement of arbitrary .

We start with the simplest scenario of two entangled qubits (), with . Despite the high fidelity, superactivation occurs only at copies. The input parameters, obtained from the mentioned linear program, are and . In figure 1, the corresponding numeric results (bullets) are shown, up to , 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 () with . With these parameters, the OSD entanglement is also superactivated for copies. The input parameters are and . We reproduce the numeric results of ieee up to and compare them to the corresponding 3-additive function in figure 2. In addition, the asymptotic limit given by the simple expression (46) is , while the actual result, determined in ieee is , an accuracy of . Note that, as it was discussed in the introduction, the asymptotic regime may become dominant only for very high . In the present case, for asymptotic expressions would not be a good description, since the points still do not show a tendency to saturation. Indeed, for , the OSD entanglement per copy is bellow , while the approximate saturation should occur around . This feature is qualitatively valid for the other cases studied here.

Finally, we go to higher dimensional states: with (superactivation for 5 copies). The input parameters are and . We use the linear program given in ieee to calculate the OSD entanglement, up to . Again, the continuous line represents expression (45). Although for we have , the points do not show a tendency to saturate. Indeed, the asymptotic value of is around , as predicted by (46). Differently from the case (and obviously from the case ), for and more than a singlet can be distilled per ququart, asymptotically, according to the 3-additive formula.

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 imply:
(47) |
If the numeric determination of and 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 [ being a decreasing function of ].
VI Closing remarks
For several resource quantifiers whose domains are high-dimensional Hilbert-Schmidt spaces, , there is a “gray zone” between small values of and the asymptotic regime , for which the evaluation of 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 -additivity by considering a natural extension of the notion of additive measures, thus, going from to .
The formalism naturally accommodates the phenomenon of superactivation, by setting one of the components of to zero. Although we derived explicit expressions for 2- and 3-additive functions only, the general framework of -additivity can be addressed via linear systems of equations. Therefore, the problem is amenable to computational treatment for larger values of . 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 , can one prove (or disprove) -additivity (or more generally -scalability scal1 ) directly from the definition of , without actually calculating ? 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 -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).