Holographic multipartite entanglement from the upper bound of $n$-partite information
Xin-Xiang Ju, Wen-Bin Pan, Ya-Wen Sun, Yang Zhao

TL;DR
This paper investigates the upper bounds of holographic n-partite information, revealing fundamental differences across dimensions and proposing that multipartite entanglement can be fully characterized at these bounds.
Contribution
It introduces the concept of the entanglement of state-constrained purification and analyzes the upper bounds of n-partite information in holographic CFTs across different dimensions.
Findings
Upper bounds of $-I_3$ relate to entanglement of state-constrained purification.
Finite upper bounds for $I_n$ in 1+1 dimensions; divergences in higher dimensions.
At upper bounds, $I_n$ fully captures multipartite entanglement.
Abstract
To analyze the holographic multipartite entanglement structure, we study the upper bound for holographic -partite information that fixed boundary subregions participate together with an arbitrary region . In general cases, we could find regions that make approach the upper bound. For , we show that the upper bound of is given by a quantity that we name the entanglement of state-constrained purification . For , we find that the upper bound of is finite in holographic CFT but has UV divergences in higher dimensions, which reveals a fundamental difference in the entanglement structure in different dimensions. When reaches the information-theoretical upper bound, we argue that ( I_n ) fully accounts for multipartite global entanglement in these upper bound critical points, in contrast to usual cases…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Computability, Logic, AI Algorithms · Quantum Information and Cryptography
