We show that multipartite entanglement can be used as an efficient way of identifying the critical points of 1+1D systems. We demonstrate this with the quantum Ising model, lattice $λϕ^4$ approximated with qutrits, and arrays of Rydberg atoms. To do so we make use of multipartite compositions of entanglement quantities for different parts combined to form the strong subadditivity, weak monotonicity, and a convex combination of these with conformal properties. These quantities display some remarkable properties. We will demonstrate how the entanglement of individual parts together displays behavior at phase boundaries, but the combination of these in the aforementioned quantities sharpens and localizes this behavior to the boundaries even better. We will show that we can extend a scheme for approximating the entanglement with the mutual information, and that this acts as a lower bound which will also follow the changes in the entanglement for the above quantities, despite the additional contributions of different signs. This mutual information approximation to the identifying quantities can have its lower probabilities removed in a process we call filtering, and despite the combination of terms will respond well to the filtering and offer improvements to the lower bound.
We show that multipartite entanglement can be used as an efficient way of identifying the critical points of 1+1D systems. We demonstrate this with the quantum Ising model, lattice λϕ4 approximated with qutrits, and arrays of Rydberg atoms. To do so we make use of multipartite compositions of entanglement quantities for different parts combined to form the strong subadditivity, weak monotonicity, and a convex combination of these with conformal properties. These quantities display some remarkable properties. We will demonstrate how the entanglement of individual parts together displays behavior at phase boundaries, but the combination of these in the aforementioned quantities sharpens and localizes this behavior to the boundaries even better. We will show that we can extend a scheme for approximating the entanglement with the mutual information, and that this acts as a lower bound which will also follow the changes in the entanglement for the above quantities, despite the additional contributions of different signs. This mutual information approximation to the identifying quantities can have its lower probabilities removed in a process we call filtering, and despite the combination of terms will respond well to the filtering and offer improvements to the lower bound.
Using the bitstring probabilities of ground states of bipartitioned ladders of Rydberg atoms, we calculate the mutual information, which is a lower bound on the corresponding bipartite von Neumann quantum entanglement entropy SAvN. We show that in many cases these lower bounds can be improved by removing the bitstrings with a probability lower than some value pmin and renormalizing the remaining probabilities (filtering). We propose a heuristic based on the change of the conditional entropy under filtering that very effectively improves the estimate of SAvN. We consider various sizes, lattice spacings and bipartitions. Our numerical investigation suggest that the filtered mutual information obtained with samples having just a few thousand bitstrings can provide reasonably close estimates of SAvN. We briefly discuss practical implementations with QuEra's Aquila device.
Quantifying entanglement of multiple subsystems is a challenging open problem in interacting quantum systems. Here, we focus on two subsystems of length $\ensuremath{\ell}$ separated by a distance $r=\ensuremath{\alpha}\ensuremath{\ell}$ and quantify their entanglement negativity (E) and mutual information (I) in critical random Ising chains. We find universal constant $\mathcal{E}(\ensuremath{\alpha})$ and $\mathcal{I}(\ensuremath{\alpha})$ over any distances, using the asymptotically exact strong disorder renormalization group method. Our results are qualitatively different from both those in the clean Ising model and random spin chains of a singlet ground state, like the spin-21 random Heisenberg chain and the random XX chain. While for random singlet states $\mathcal{I}(\ensuremath{\alpha})/\mathcal{E}(\ensuremath{\alpha})=2$, in the random Ising chain this universal ratio is strongly $\ensuremath{\alpha}$ dependent. This deviation between systems contrasts with the behavior of the entanglement entropy of a single subsystem, for which the various random critical chains and clean models give the same qualitative behavior. The reason is that E and I are sensitive to higher order correlations in the ground-state structure. Therefore, studying multipartite entanglement provides additional universal information in random quantum systems, beyond what we can learn from a single subsystem.
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.
Entanglement microscopy reveals the true quantum correlations among the microscopic building blocks of many-body systems [Nat. Commun. 16, 96 (2025)]. Using this approach, we study the multipartite entanglement of the quantum Ising model in 1D, 2D, and 3D. We first obtain the full reduced density matrix (tomography) of subregions that have at most four sites via quantum Monte Carlo, exact diagonalization, and the exact solution in 1D. We then analyze both bipartite and genuine multipartite entanglement (GME) among the sites in the subregion. To do so, we use a variety of measures including the negativity, as well as a true measure of GME: the genuinely multipartite concurrence (or GME concurrence), and its computationally cheaper lower bound I2. We provide a complete proof that I2 bounds the GME concurrence, and show how the symmetries of the state simplify its evaluation. For adjacent sites, we find three- and four-spin GME present across large portions of the phase diagram, reaching a maximum near the quantum critical point. In 1D, we identify the singular scaling of the derivative dI2/dh approaching the critical point. We observe a sharp decrease in GME with increasing dimensionality, consistent with the monogamous nature of entanglement. Furthermore, we find that GME vanishes for subregions consisting of nonadjacent sites in both 2D and 3D, offering a stark illustration of the short-ranged nature of entanglement in equilibrium quantum matter [arXiv:2402.06677]. Finally, we analyze the most collective form of entanglement by evaluating the GME concurrence among all spins in the lattice, which can be obtained from a simple observable: the single-site transverse magnetization. This global concurrence is larger in 1D compared to 2D and 3D, but it is relatively less robust against perturbations such as local measurements.
We discuss the possibility of estimating experimentally the von Neumann entanglement entropy S A v N of a symmetric bipartite quantum system A B by using the basic measurement counts (bitstrings) for a single copy of a prepared state. Using exact diagonalization and analog simulations performed with the publicly available QuEra facilities for chains and ladders of Rydberg atoms, we calculate the Shannon entropy S A B X associated with the bitstrings of adiabatically prepared ground states and the reduced entropies S A X and S B X obtained from the marginal probabilities in A and B . We then calculate the classical mutual information I A B X = S A X + S B X − S A B X , which is a lower bound on S A v N . We show that for a broad range of lattice spacing and detuning, I A B X is typically 20% below S A v N in regions where S A v N is large and a less close bound in regions where S A v N is low. We argue that this use of the easily available bitstrings provides a robust and efficient way to explore empirically the phase diagram of qubit-based quantum simulators and identify critical regions.
This paper defines the fidelity of recovery of a tripartite quantum state on systems A,B, and C as a measure of how well one can recover the full state on all three systems if system A is lost and a recovery operation is performed on system C alone. The surprisal of the fidelity of recovery (its negative logarithm) is an information quantity which obeys nearly all of the properties of the conditional quantum mutual information I(A;B∣C), including non-negativity, monotonicity with respect to local operations, duality, invariance with respect to local isometries, a dimension bound, and continuity. We then define a (pseudo) entanglement measure based on this quantity, which we call the ``geometric squashed entanglement.'' We prove that the geometric squashed entanglement is a 1-LOCC monotone (i.e., monotone nonincreasing with respect to local operations and classical communication from Bob to Alice), that it vanishes if and only if the state on which it is evaluated is unentangled, and that it reduces to the geometric measure of entanglement if the state is pure. We also show that it is invariant with respect to local isometries, subadditive, continuous, and normalized on maximally entangled states. We next define the surprisal of measurement recoverability, which is an information quantity in the spirit of quantum discord, characterizing how well one can recover a share of a bipartite state if it is measured. We prove that this discordlike quantity satisfies several properties, including non-negativity, faithfulness on classical-quantum states, invariance with respect to local isometries, a dimension bound, and normalization on maximally entangled states. This quantity, combined with a recent breakthrough of Fawzi and Renner, makes it possible to characterize states with discord nearly equal to zero as being approximate fixed points of entanglement-breaking channels (equivalently, they are recoverable from the state of a measuring apparatus). Finally, we discuss a multipartite fidelity of recovery and several of its properties.