.png){kind=icon}
Return
Multi-entropy in random tensor networks
.png){kind=icon}
OA
AI
DOI：10.1007/jhep08(2026)136.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We study the evaluation of Rényi multi-entropies $$ {S}_n^{(q)} $$ in Random Tensor Network (RTN) states in the large bond-dimension limit. For the case of Rényi index n = 2 and arbitrary number of parties q, we prove that multi-entropies are determined by minimal multiway cuts through the network. When the minimal multiway cut is degenerate, we characterize the full minimizer set via compatible families of minimal cuts and give a criterion for all minimizers to come from ordinary cut partitions. For n = 2, this gives a natural generalization of the minimal cut description of bipartite entanglement to multipartite systems with arbitrarily many parties. For the case of integer n > 2, we show that the minimal multiway cut conjecture is in general not true by providing explicit counter examples for both the single random tensor and for the network built from isometric tilings. We discuss the implication for our results on the multipartite entanglement structures in RTN and holography.
Journal
IF:
5.5
Papers:
4.0W
Citations:
13.7W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave
View more