Taming multiparty entanglement at measurement-induced phase transitions
Liuke Lyu, James Allen, Yi Hong Teoh, Roger G Melko, William Witczak-Krempa
TL;DR
This paper tackles the problem of characterizing multiparty entanglement at measurement-induced phase transitions by simulating a trapped-ion native MIPT circuit that approaches Haar non-unitary CFT universality. The authors combine generalized multiparty mutual information and genuine multiparty negativity, computed via semidefinite programming, with conformal finite-size scaling around a critical point $p_c$ to reveal robust algebraic decay of correlations for $k=2,3,4$ parties, and to propose a conjecture $\alpha_k^{\rm MI}=k+2$. They demonstrate that mutual information exponents satisfy a monogamy-derived lower bound $\alpha_k^{\rm MI}\ge k$ and present strong evidence for monotonicity and subadditivity across party numbers, while GMN exponents show larger finite-size drifts and imply long-range quantum resources with entanglement halos in spacetime. Overall, the work advances understanding of non-unitary critical dynamics and entanglement organization, with implications for trapped-ion experiments and connections to holographic ideas.
Abstract
Measurement-induced phase transitions (MIPT) give rise to novel dynamical states of quantum matter realized by balancing unitary evolution and measurements. We present large-scale numerical simulations of a trapped-ion native MIPT, argued to belong to the universality class described by the Haar non-unitary conformal field theory. First, through a finite-size analysis we obtained the critical measurement rate, and correlation length exponent, which falls close to the percolation value. Second, by leveraging a monotone computable via semi-definite programming, we uncover robust algebraic decay of genuine multiparty entanglement (GME) versus separation for 2, 3, and 4 parties. The corresponding critical exponents are lower-bounded by those of the multiparty mutual information, which we determine up to 4 parties, and conjecture to be (k+2) for k parties. Additionally, we derive lower bounds for both GME and multiparty mutual information.
