We provide a fine-grained definition for monogamous measure of entanglement that does not invoke any particular monogamy relation. Our definition is given in terms an equality, as oppose to inequality, that we call the "disentangling condition". We relate our definition to the more traditional one, by showing that it generates standard monogamy relations. We then show that all quantum Markov states satisfy the disentangling condition for any entanglement monotone. In addition, we demonstrate that entanglement monotones that are given in terms of a convex roof extension are monogamous if they are monogamous on pure states, and show that for any quantum state that satisfies the disentangling condition, its entanglement of formation equals the entanglement of assistance. We characterize all bipartite mixed states with this property, and use it to show that the G-concurrence is monogamous. In the case of two qubits, we show that the equality between entanglement of formation and assistance holds if and only if the state is a rank 2 bipartite state that can be expressed as the marginal of a pure 3-qubit state in the W class.
Although many different entanglement measures have been proposed so far, much less is known in the multipartite case, which leads to the previous monogamy relations in the literature being not complete. We establish here a strict framework for defining the multipartite entanglement measure (MEM): apart from the postulates of the bipartite measure, i.e., vanishing on separable measures and nonincreasing under local operations and classical communication, a complete MEM should additionally satisfy the unification condition and the hierarchy condition. We then come up with a complete monogamy formula for the unified MEM (an MEM is called a unified MEM if it satisfies the unification condition) and a tightly complete monogamy relation for the complete MEM (an MEM is called a complete MEM if it satisfies both the unification condition and the hierarchy condition). Consequently, we propose MEMs which are multipartite extensions of entanglement of formation (EoF), concurrence, tangle, Tsallis
q entropy of entanglement, R\'enyi $\ensuremath{\alpha}$ entropy of entanglement, the convex-roof extension of negativity, and negativity. We show that (i) the extensions of EoF, concurrence, tangle, and Tsallis
q entropy of entanglement are complete MEMs; (ii) multipartite extensions of R\'enyi $\ensuremath{\alpha}$ entropy of entanglement, negativity, and the convex-roof extension of negativity are unified MEMs but not complete MEMs; and (iii) all these multipartite extensions are completely monogamous, and the ones which are defined by the convex-roof structure (except for the R\'enyi $\ensuremath{\alpha}$ entropy of entanglement and the convex-roof extension of negativity) are not only completely monogamous but also tightly completely monogamous. In addition, as a byproduct, we find a class of states that satisfy the additivity of EoF. We also find a class of tripartite states one part of which can be maximally entangled with the other two parts simultaneously according to the definition of mixed maximally entangled state (MMES) in Li et al. [Z. Li, M. Zhao, S. Fei, H. Fan, and W. Liu, Quantum Inf. Comput. 12, 0063 (2012)]. Consequently, we improve the definition of maximally entangled state (MES) and prove that the only MES is the pure MES.
We establish entanglement monotones in terms of an operational approach, which is closely connected with the state conversion from pure states to the objective state by the local operations and classical communications. It is shown that any good entanglement quantifier defined on pure states can induce an entanglement monotone for all density matrices. Particularly, we show that our entanglement monotone is the maximal one among all those having the same form for pure states. In some special cases, our proposed entanglement monotones turn to be equivalent to the convex roof construction, which hence gain an operational meaning. Some examples are given to demonstrate different cases.
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.
Gudder, in a recent paper, defined a candidate entanglement measure which is called the entanglement number. The entanglement number is first defined on pure states and then it extends to mixed states by the convex roof construction. In Gudder's article it was left as an open problem to show that Optimal Pure State Ensembles (OPSE) exist for the convex roof extension of the entanglement number from pure to mixed states. We answer Gudder's question in the affirmative, and therefore we obtain that the entanglement number vanishes only on the separable states. More generally we show that OPSE exist for the convex roof extension of any function that is norm continuous on the pure states of a finite dimensional Hilbert space. Further we prove that the entanglement number is an LOCC monotone, (and thus an entanglement measure), by using a criterion that was developed by Vidal in 2000. We present a simplified proof of Vidal's result where moreover we use an interesting point of view of tree representations for LOCC communications. Lastly, we generalize Gudder's entanglement number by producing a monotonic family of entanglement measures which converge in a natural way to the entropy of entanglement. Quanta 2020; 9: 22–36.
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.