arXiv:2610.16215
Minimal Subsystems for Characterizing Genuine Multipartite Entanglement
Shashank Shekhar, Siddhartha Santra
Shashank ShekharAbstract
Genuine multipartite entanglement (GME) is a valuable resource for quantum technologies, but quantifying it in many-body systems can be demanding since measures defined through optimizations over bipartitions are often assumed to require large joint measurements and many measurement settings. We introduce the concepts of GME evaluation length and GME evaluation number, which capture, respectively, the largest subsystem that must be jointly measured and the number of distinct subsystems that need to be measured to evaluate multipartite entanglement measures defined via bipartition optimizations. Taking the genuine multipartite concurrence (GMC) as a canonical example, we show that, for $N$-qubit Haar-random pure states, the GMC can be evaluated using only $N$ single-qubit purity measurements. Thus, for typical many-body states, evaluating the GMC requires considering only the $N$ single-site bipartitions, rather than the exponentially many distinct bipartitions. We further corroborate this behavior numerically for physically accessible states generated by local random quantum circuits. Our results show that the practical cost of quantifying GME can be dramatically lower than suggested by its formal definition, establishing measurement complexity as a complementary operational lens for multipartite entanglement.
AI Summary
The paper asks when evaluating a genuine multipartite entanglement (GME) measure defined by optimization over bipartitions can avoid examining exponentially many cuts. It introduces GME evaluation length and evaluation number: the smallest achievable maximum subsystem size and, subject to that, the number of subsystems whose bipartition quantities suffice for every state in a known family. Probabilistic versions allow an ensemble failure probability $\varepsilon$. The main application is genuine multipartite concurrence, $C_g=\min_{A|B}\sqrt{2(1-\operatorname{Tr}\rho_A^2)}$. For $N$-qubit Haar-random pure states, the minimizing cut is a single-qubit cut with probability at least $1-O(2^{-N})$. Consequently, measuring the $N$ single-qubit purities suffices with that probability, rather than evaluating $2^{N-1}-1$ bipartitions involving subsystems of up to $\lfloor N/2\rfloor$ qubits. The proof combines known Haar purity means and variances, a Chebyshev bound comparing single-qubit and larger-subsystem purities, and a union bound over cuts. Numerical simulations of one-dimensional random circuits, constructed by applying Haar-random two-qubit gates on randomly selected adjacent pairs, show increasing single-qubit-cut dominance as scrambling develops. The framework assumes prior knowledge of the state family or preparation ensemble. Its resource counts exclude copies, repetitions, and precision-dependent sampling costs. The rigorous typicality result concerns Haar-random pure states; the circuit extension is numerical. Mixed-state applicability is restricted to families admitting suitable bipartition-extremized or marginal-reconstructible expressions. Other many-body families and resource measures are left for future study.
Error found: The claimed finite-N approximation to the average genuine multipartite concurrence uses fixed-qubit purity moments instead of the statistics of the maximum single-qubit purity, omitting the selection of the least-entangled qubit cut.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.