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.
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.
In this work, we study the asymptotic behavior of protocols that localize entanglement in large multi-qubit states onto a subset of qubits by measuring the remaining qubits. We use the maximal average n-tangle that can be generated on a fixed subsystem by measuring its complement -- either with local or global measurements -- as our key figure of merit. These quantities are known respectively as the localizable entanglement (LE) and the entanglement of assistance (EA). We build upon the work of [arXiv:2411.04080] that proposed a polynomial-time test, based on the EA, for whether it is possible to transform certain graph states into others using local measurements. We show, using properties of the EA, that this test is effective and useful in large systems for a wide range of sizes of the measured subsystem. In particular, we use this test to demonstrate the surprising result that general local unitaries and global measurements will typically not provide an advantage over the more experimentally feasible local Clifford unitaries and local Pauli measurements in transforming large linear cluster states into GHZ states. Finally, we derive concentration inequalities for the LE and EA over Haar-random states which indicate that the localized entanglement structure has a striking dependence on the locality of the measurement. In deriving these concentration inequalities, we develop several technical tools that may be of independent interest.
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.
Characterizing large noisy multiparty quantum states using genuine multipartite entanglement is a challenging task. In this paper, we calculate lower bounds of genuine multipartite entanglement localized over a chosen multiparty subsystem of multiqubit stabilizer states in the noiseless and noisy scenarios. In the absence of noise, adopting a graph-based technique, we perform the calculation for arbitrary graph states as representatives of the stabilizer states and show that the graph operations required for the calculation have a polynomial scaling with the system size. As demonstrations, we compute the localized genuine multipartite entanglement over subsystems of large graphs having linear, ladder, and square structures. We also extend the calculation for graph states subjected to single-qubit Markovian or non-Markovian Pauli noise on all qubits and demonstrate, for a specific lower bound of the localizable genuine multipartite entanglement corresponding to a specific Pauli measurement setup, the existence of a critical noise strength beyond which all of the postmeasured states are biseparable. The calculation is also useful for arbitrary large stabilizer states under noise due to the local unitary connection between stabilizer states and graph states. We demonstrate this by considering a toric code defined on a square lattice and computing a lower bound of localizable genuine multipartite entanglement over a nontrivial loop of the code. Similar to the graph states, we show the existence of the critical noise strength in this case also and discuss its interesting features.
We investigate the relation between the amount of entanglement localized on a chosen subsystem of a multiqubit system via local measurements on the rest of the system, and the bipartite entanglement that is lost during this measurement process. We study a number of paradigmatic pure states, including the generalized Greenberger--Horne--Zeilinger (GHZ), the generalized W (gW), Dicke, and the generalized Dicke states. For the generalized GHZ and W states, we analytically derive bounds on localizable entanglement in terms of the entanglement present in the system prior to the measurement. Also, for the Dicke and the generalized Dicke states, we demonstrate that with increasing system size, localizable entanglement tends to be equal to the bipartite entanglement present in the system over a specific partition before measurement. We extend the investigation numerically in the case of arbitrary multiqubit pure states. We also analytically determine the modification of these results, including the proposed bounds, in situations where these pure states are subjected to single-qubit phase-flip noise on all qubits. Additionally, we study one-dimensional paradigmatic quantum spin models, namely, the transverse-field XY model and the XXZ model in an external field, and numerically demonstrate a cubic dependence of the localized entanglement on the lost entanglement. We show that this relation is robust even in the presence of disorder in the strength of the external field.
ABSTRACT Characterizing the entanglement in multipartite quantum systems remains a central challenge in the theory of quantum entanglement. We establish a comprehensive framework for constructing ‐entanglement measures by leveraging bipartite entanglement measures and general ‐entanglement measures () with arithmetic and geometric averaging schemes. Numerical examples demonstrate that these measures outperform the existing ones, such as ‐ME concurrence, geometric mean (k‐GM) concurrence, and the generalized ‐entanglement measure by inducing distinct entanglement orderings and offering superior resolution. Furthermore, we reveal the operational relationship between the ‐entanglement and the local quantum coherence, verifying that the persistence of entanglement is intrinsically constrained by the system's capacity to maintain the local coherence. Finally, to overcome the inherent limitation of the conventional three‐tangle in characterizing the genuine multipartite entanglement of the GHZ‐W mixed states, we design a novel GME measure. Numerical results confirm that this measure effectively eliminates the detection blind spots where vanishes, providing a complete and practical mathematical tool for the quantitative analysis of genuine multipartite quantum correlations.
Organising the space of entanglement structures of a multipartite quantum system is a much more challenging task than its bipartite version: while the local unitary (LU) orbit of a bipartite pure state can be conveniently characterized by its entanglement spectrum, invariants of multipartite entanglement structures are comparatively difficult to define and work with. The root cause of this difference is that the bipartite problem can be reduced to the analysis of matrix invariants, while its multipartite version is governed by a much richer space of tensor invariants. The present work explores the latter through the lens of so-called trace-invariants, which are in one-to-one correspondence with combinatorial objects known as colored graphs. We first explain why trace-invariant evaluations can serve as labels of LU-orbits of multipartite pure states, how this strategy extends to random states, and how the effect of local operations (LO) can be analyzed through such data. We then focus on entanglement classification within an (infinite-dimensional) subspace of reference states, whose basic building blocks are GHZ states of various dimensions. We show that relatively simple subclasses of trace-invariants are sufficient to separate the LU-orbits of reference states, and enable a complete (resp. an incomplete) characterization of their relations in the LO (resp. LOCC) resource theory of entanglement. Finally, we investigate how a (still infinite) subclass of reference states of local dimension N can be efficiently distinguished at leading and subleading orders in an asymptotic large-N expansion (among themselves, or from Haar-random states). This analysis relies crucially on combinatorial quantities associated to colored graphs, some of which have already played instrumental roles in the recent literature on random tensors. Results of broader relevance are reported along the way.