Based on the idea of measuring the factorizability of a given density matrix, we propose a pairwise analysis strategy for quantifying and understanding multipartite entanglement. The methodology proves very effective as it immediately guarantees, in addition to the usual entanglement properties, additivity and strong super additivity. We give a specific set of quantities that fulfill the protocol and which, according to our numerical calculations, make the entanglement measure an LOCC non-increasing function.
Based on the idea of measuring the factorizability of a given density matrix, we propose a pairwise analysis strategy for quantifying and understanding multipartite entanglement. The methodology proves very effective as it immediately guarantees, in addition to the usual entanglement properties, additivity and strong super additivity. We give a specific set of quantities that fulfill the protocol and which, according to our numerical calculations, make the entanglement measure an LOCC non-increasing function. The strategy allows a redefinition of the structural concept of global entanglement.
Multipartite entanglement is an essential resource for quantum communication, quantum computing, quantum sensing, and quantum networks. The utility of a quantum state |ψ⟩ for these applications is often directly related to the degree or type of entanglement present in |ψ⟩. Therefore, efficiently quantifying and characterizing multipartite entanglement is of paramount importance. In this work, we introduce a family of multipartite entanglement measures, called concentratable entanglements. Several well-known entanglement measures are recovered as special cases of our family of measures, and hence we provide a general framework for quantifying multipartite entanglement. We prove that the entire family does not increase, on average, under local operations and classical communications. We also provide an operational meaning for these measures in terms of probabilistic concentration of entanglement into Bell pairs. Finally, we show that these quantities can be efficiently estimated on a quantum computer by implementing a parallelized SWAP test, opening up a research direction for measuring multipartite entanglement on quantum devices.
In this paper, we investigate the characterization of multipartite entanglement based on the unified
(q,s)-entropy framework. For bipartite quantum states, we propose an entanglement measure
Eq,sA∣B(ρ) based on unified entropy and derive several analytical lower bounds for it using local orthonormal observables. We demonstrate with concrete examples that our lower bounds provide tighter estimates of quantum entanglement than several existing analytical bounds. For multipartite quantum states, based on unified entropy, we propose two measures
Aq,sk(ρ) and
Gq,sk(ρ) for quantifying
k-nonseparability, and prove that these measures satisfy several desirable properties, such as faithfulness, local unitary invariance, and convexity. Moreover, we rigorously prove that when the parameters
q and
s are in certain ranges,
Aq,sk(ρ) and
Gq,sk(ρ) also satisfy monotonicity and strong monotonicity. Furthermore, we establish the order relations of the measures
Aq,sk(ρ) and
Gq,sk(ρ) with respect to the parameters
q and
s for fixed quantum states. In addition, for fixed
q and
s, we also give their order relations for any two pure states.
Despite multipartite entanglement being a global property of a quantum state, a number of recent works have made it clear that it can be quantified using only local measurements. This is appealing because local measurements are the easiest to implement on current quantum hardware. However, it remains an open question what protocol one should use in order to minimize the resources required to estimate multipartite entanglement from local measurements alone. In this work, we construct and compare several estimators of multipartite entanglement based solely on the data from local measurements. We first construct statistical estimators for a broad family of entanglement measures using local randomized measurement (LRM) data before providing a general criterion for the construction of such estimators in terms of projective 2-designs. Importantly, this allows us to derandomize the multipartite estimation protocol based on LRMs. In particular, we show how local symmetric, informationally complete positive operator-valued measures enable multipartite entanglement quantification with only a single measurement setting. For all estimators, we provide both the classical postprocessing cost and rigorous performance guarantees in the form of analytical upper bounds on the number of measurements needed to estimate the measures to any desired precision.