Quantifying entanglement in composite systems is a fundamental challenge, yet exact results are available in only a few special cases. This is because hard optimization problems are routinely involved, such as finding the convex decomposition of a mixed state with the minimal average pure-state entanglement, the so-called convex roof. We show that under certain conditions such a problem becomes trivial. Precisely, we prove by a geometric argument that polynomial entanglement measures of degree 2 are independent of the choice of pure-state decomposition of a mixed state, when the latter has only one pure unentangled state in its range. This allows for the analytical evaluation of convex roof extended entanglement measures in classes of rank-2 states obeying such a condition. We give explicit examples for the square root of the three-tangle in three-qubit states, and we show that several representative classes of four-qubit pure states have marginals that enjoy this property.
Coherence, the superposition of orthogonal quantum states, is indispensable in various quantum processes. Inspired by the polynomial invariant for classifying and quantifying entanglement, we first define polynomial coherence measure and systematically investigate its properties. Except for the qubit case, we show that there is no polynomial coherence measure satisfying the criterion that its value takes zero if and only if for incoherent states. Then, we release this strict criterion and obtain a necessary condition for polynomial coherence measure. Furthermore, we give a typical example of polynomial coherence measure for pure states and extend it to mixed states via a convex-roof construction. Analytical formula of our convex-roof polynomial coherence measure is obtained for symmetric states which are invariant under arbitrary basis permutation. Consequently, for general mixed states, we give a lower bound of our coherence measure.
An algorithm is proposed that serves to handle full-rank density matrices when coming from a lower-rank method to compute the convex roof. This is in order to calculate an upper bound for any polynomial SL-invariant multipartite entanglement measure
E. This study exemplifies how this algorithm works based on a method for calculating convex roofs of rank-2 density matrices. It iteratively considers the decompositions of the density matrix into two states each, exploiting the knowledge for the rank-2 case. The algorithm is therefore quasiexact as far as the rank-2 case is concerned, and it also hints where it should include more states in the decomposition of the density matrix. Focusing on the measure of three-way entanglement of qubits (called three-tangle), I show the results the algorithm gives for two states, one of which is the Greenberger-Horne-Zeilinger--Werner (GHZ-
W) state, for which the exact convex roof is known. It overestimates the three-tangle in the state, thereby giving insight into the optimal decomposition the GHZ-
W state has. As a proof of principle, I have run the algorithm for the three-tangle on the transverse quantum Ising model. I give qualitative and quantitative arguments why the convex roof should be close to the upper bound found here.
Entanglement, and quantum correlation, are precious resources for quantum technologies implementation based on quantum information science, such as quantum communication, quantum computing, and quantum interferometry. Nevertheless, to our best knowledge, a directly or numerically computable measure for the entanglement of multipartite mixed states is still lacking. In this work, (i) we derive a measure of the degree of quantum correlation for mixed multipartite states. The latter possesses a closed-form expression valid in the general case unlike, to our best knowledge, all other known measures of quantum correlation. (ii) We further propose an entanglement measure, derived from this quantum correlation measure using a novel regularization procedure for the density matrix. Therefore, a comparison of the proposed measures, of quantum correlation and entanglement, allows one to distinguish between quantum correlation detached from entanglement and the one induced by entanglement and, hence, to identify separable but non-classical states. We have tested our quantum correlation and entanglement measures, on states well-known in literature: a general Bell diagonal state and the Werner states, which are easily tractable with our regularization procedure, and we have verified the accordance between our measures and the expected results for these states. Finally, we validate the two measures in two cases of multipartite states. The first is a generalization to three qubits of the Werner state, the second is a one-parameter three qubits mixed state interpolating between a bi-separable state and a genuine multipartite state, passing through a fully separable state.
We generalize the notion of the best separable approximation (BSA) and best
W-class approximation (BWA) to arbitrary pure-state entanglement measures, defining the best zero-
E approximation (BEA). We show that for any polynomial entanglement measure
E, any mixed state $\ensuremath{\rho}$ admits at least one ``
S decomposition,'' i.e., a decomposition in terms of a mixed state on which
E is equal to zero, and a single additional pure state with (possibly) nonzero
E. We show that the BEA is not, in general, the optimal
S decomposition from the point of view of bounding the entanglement of $\ensuremath{\rho}$ and describe an algorithm to construct the entanglement-minimizing
S decomposition for $\ensuremath{\rho}$ and place an upper bound on $E(\ensuremath{\rho})$. When applied to the three-tangle, the cost of the algorithm is linear in the rank
d of the density matrix and has an accuracy comparable to a steepest-descent algorithm whose cost scales as
d8logd. We compare the upper bound to a lower-bound algorithm given by C. Eltschka and J. Siewert [Phys. Rev. Lett. 108, 020502 (2012)] for the three-tangle and find that on random rank-2 three-qubit density matrices, the difference between the upper and lower bounds is
0.14 on average. We also find that the three-tangle of random full-rank three-qubit density matrices is less than
0.023 on average.
New measures of multipartite entanglement are constructed based on two definitions of multipartite information and different methods of optimizing over extensions of the states. One is a generalization of the squashed entanglement where one takes the mutual information of parties conditioned on the state's extension and takes the infimum over such extensions. Additivity of the multipartite squashed entanglement is proved for both versions of the multipartite information which turn out to be related. The second one is based on taking classical extensions. This scheme is generalized, which enables to construct measures of entanglement based on the mixed convex roof of a quantity, which in contrast to the standard convex roof method involves optimization over all decompositions of a density matrix rather than just the decompositions into pure states. As one of the possible applications of these results we prove that any multipartite monotone is an upper bound on the amount of multipartite distillable key. The findings are finally related to analogous results in classical key agreement.