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.
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.
We study the task of localizing multipartite entanglement in pure quantum states onto a subsystem by measuring the remaining systems. To this end, we fix a multipartite entanglement measure and consider two quantities: the multipartite entanglement of assistance (MEA), defined as the entanglement measure averaged over the post-measurement states and maximized over arbitrary measurements; and the localizable multipartite entanglement (LME), defined in the same way but restricted to only local single-system measurements. Both quantities generalize previously considered bipartite entanglement localization measures. In our work we choose the n-tangle, the genuine multipartite entanglement concurrence and the concentratable entanglement (CE) as the underlying seed measure, and discuss the resulting MEA and LME quantities. First, we prove easily computable upper and lower bounds on MEA and LME and establish Lipschitz-continuity for the n-tangle and CE-based LME and MEA. Using these bounds we investigate the typical behavior of entanglement localization by deriving concentration inequalities for the MEA evaluated on Haar-random states and performing numerical studies for small tractable system sizes. We then turn our attention to protocols that transform graph states. We give a simple criterion based on a matrix equation to decided whether states with a specified n-tangle value can be obtained from a given graph state, providing no-go theorems for a broad class of such graph state transformations beyond the usual “local Clifford plus local Pauli measurement” framework. This analysis is generalized to weighted graph states, which provide a realistic error model in current experiments preparing graph state. Our entanglement localization framework certifies the near-optimality of recently discussed local-measurement protocols to transform uniformly weighted line graph states into GHZ states, even when considering arbitrary entangled measurements. Finally, we demonstrate how our MEA and LME quantities can be used to detect critical phenomena such as phase transitions in transversal field Ising models. Since entanglement localization is operationally relevant throughout quantum networking and measurement-based quantum computation, our framework of results based on the MEA and LME has the potential for broad applications in these fields.
Multipartite entanglement is the premier resource for quantum technologies. Yet, its exact quantification in the laboratory is notoriously challenging, typically requiring the full knowledge of high dimensional quantum states. Here, we construct observable bounds to multipartite entanglement for systems of arbitrary size, which are functions of the local and global state purities, and correlation functions. First, we derive experimentally accessible upper and lower limits to both the bipartite entanglement of formation and the squashed entanglement of bipartite systems, by leveraging cornerstone results of quantum information theory: the entropy strong subadditivity inequality and the Koashi-Winter monogamy relation. Then, we convert them into bounds to the entanglement up to degree k for arbitrary states, and to the genuine k-partite entanglement, by employing a recently proposed method. Finally, we analytically and numerically test these results, by bounding the multipartite entanglement of several relevant states and mixtures, including the important classes of GHZ, Dicke, W states, and random pure states.
We show how to estimate a broad class of multipartite entanglement measures from Bell-basis measurement data. In addition to lowering the experimental requirements relative to previously known methods of estimating these measures, our proposed scheme also enables a simpler analysis of the number of measurement repetitions required to achieve an $\ensuremath{\epsilon}$-close approximation of the measures, which we provide for each. We focus our analysis on the recently introduced concentratable entanglements [Beckey et al., Phys. Rev. Lett. 127, 140501 (2021)] because many other well-known multipartite entanglement measures are recovered as special cases of this family of measures. We extend the definition of the concentratable entanglements to mixed states and show how to construct lower bounds on the mixed state concentratable entanglements that can also be estimated using only Bell-basis measurement data. Finally, we demonstrate the feasibility of our methods by classically simulating their implementation on a noisy Rydberg atom quantum computer.
Detecting and characterizing quantum correlations are tasks of great relevance in quantum information. More specifically, quantifying the amount of multipartite entanglement is a known difficult task, even for pure states. To this end, several entanglement measures have been proposed, although there is currently no universal manner to do so. In this work, we propose the classical shadows technique to measure the generalized global entanglement introduced in Phys. Rev. A 74, 022314. This particular multipartite entanglement quantifier EG(n) relies on the linear entropies of all n-qubit partitions of a state. As the linear entropy can be written in terms of a complete set of observables of the subsystem, we employ classical shadows to estimate many observables with fewer measurements. We simulate the quantification of EG(n) for well-known entangled states and for random states, comparing shadow estimations and grouping techniques. Our results show a clear advantage of classical shadows over direct estimation approaches, indicating that it can be a useful tool to quantify entanglement without the need to reconstruct the density operator of the whole system.
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.
The experimental detection of multipartite entanglement usually requires a number of appropriately chosen local quantum measurements that are aligned with respect to a previously shared common reference frame. The latter, however, can be a challenging prerequisite, e.g., for satellite-based photonic quantum communication, making the development of alternative detection strategies desirable. One possibility for avoiding the distribution of classical reference frames is to perform a number of local measurements with settings distributed uniformly at random. In this Letter, we follow such a treatment and show that an improved detection and characterization of multipartite entanglement is possible by combining statistical moments of different order. To do so, we make use of designs that are pseudorandom processes allowing us to link the present entanglement criteria to ordinary reference frame independent ones. The strengths of our methods are illustrated in various cases, starting with two qubits and followed by more involved multipartite scenarios.