Multi-entropy in random tensor networks
Pith reviewed 2026-06-28 05:32 UTC · model grok-4.3
The pith
For Rényi index 2, multi-entropies in random tensor networks equal the minimal multiway cut through the network.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
In the large-bond-dimension limit the Rényi multi-entropy S_n^(q) of a random tensor network equals the minimal multiway cut for n=2 and arbitrary q. When the cut is degenerate the full set of minimizers is characterized by compatible families of ordinary minimal cuts, together with a criterion that decides whether every minimizer arises from a partition into ordinary cuts. For integer n>2 the equality does not hold in general; counterexamples are constructed for both a single random tensor and for networks formed by isometric tilings.
What carries the argument
The minimal multiway cut in the tensor network, which computes the multi-entropy exactly when the Rényi index equals 2.
If this is right
- Multipartite entanglement in random tensor networks admits a geometric description via multiway cuts when the Rényi index is 2.
- The minimal-cut picture for bipartite entanglement extends to arbitrarily many parties for this specific index.
- Degenerate multiway cuts can be classified by compatible families of ordinary cuts.
- For Rényi indices greater than 2, multi-entropies require structures beyond minimal cuts.
Where Pith is reading between the lines
- The n=2 case may correspond to a regime where entanglement is dominated by classical cut geometry, while higher n capture quantum correlations not reducible to cuts.
- Similar multiway-cut formulas could be tested in other tensor-network constructions such as holographic codes or MERA.
- The counterexamples indicate that any general formula for higher Rényi multi-entropies must incorporate additional non-geometric data.
Load-bearing premise
The tensor-network states are evaluated in the large bond-dimension limit.
What would settle it
Explicitly compute the multi-entropy of order 3 for the single-random-tensor counterexample and verify that its value differs from the minimal multiway cut.
Figures
read the original abstract
We study the evaluation of R\'enyi multi-entropies $S^{(q)}_n$ in Random Tensor Network (RTN) states in the large bond-dimension limit. For the case of R\'enyi index $n=2$ and arbitrary number of parties $q$, we prove that 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 \emph{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.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies the evaluation of Rényi multi-entropies S_n^{(q)} in random tensor network (RTN) states in the large bond-dimension limit. For Rényi index n=2 and arbitrary number of parties q, it proves that the multi-entropies are determined by minimal multiway cuts through the network. In degenerate cases it characterizes the full set of minimizers via compatible families of minimal cuts and supplies a criterion for when all minimizers arise from ordinary cut partitions. For integer n>2 it supplies explicit counterexamples (both for a single random tensor and for networks built from isometric tilings) showing that the minimal multiway cut description fails in general. Implications for multipartite entanglement structures in RTN states and holography are discussed.
Significance. The central result supplies a rigorous, parameter-free generalization of the minimal-cut description of bipartite entanglement entropy to multipartite Rényi multi-entropies for n=2. The explicit counterexamples for n>2 delineate the precise regime in which geometric minimal-cut interpretations remain valid. The characterization of degenerate minimizers via compatible cut families is a technically useful addition that clarifies the structure of the minimizer set.
minor comments (2)
- [Abstract] Abstract: the sentence beginning “we prove that that multi-entropies” contains a duplicated word; a minor typographical correction is needed.
- The large-bond-dimension limit is stated as the regime of the study, but the precise scaling of the bond dimension with system size or network depth is not restated in the main text when the proofs are invoked; adding a short reminder would improve readability.
Simulated Author's Rebuttal
We thank the referee for their positive summary and significance assessment of our work on Rényi multi-entropies in random tensor networks. We appreciate the recommendation for minor revision. No specific major comments were provided in the report, so we have no point-by-point responses to address. We will incorporate any minor editorial changes in the revised manuscript.
Circularity Check
No significant circularity; proof is self-contained
full rationale
The paper states its regime (large bond-dimension limit) explicitly and proves the n=2 multi-entropy = minimal multiway cut equivalence via direct mathematical argument, with explicit counterexamples for n>2. No parameters are fitted to data and then relabeled as predictions; no self-citation chain is invoked as the sole justification for the central claim; the derivation does not reduce to a renaming or self-definition. The result is therefore independent of its inputs and receives the default non-circularity score.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption Random tensor network states in the large bond-dimension limit allow multi-entropies to be evaluated via geometric cuts
Forward citations
Cited by 1 Pith paper
-
The Entanglement Wedge Polygon
The paper defines the entanglement wedge polygon as the intersection of entanglement wedges external to individual homology regions and studies its topological and geometric properties in AdS examples.
Reference graph
Works this paper leans on
-
[1]
S. Ryu and T. Takayanagi, Holographic derivation of entanglement entropy from AdS/CFT, Phys. Rev. Lett.96, 181602, 2006, [arXiv:hep-th/0603001]
Pith/arXiv arXiv 2006
-
[2]
S. Ryu and T. Takayanagi, Aspects of Holographic Entanglement Entropy, JHEP08, 045, 2006, [arXiv:hep-th/0605073]
Pith/arXiv arXiv 2006
-
[3]
V. E. Hubeny, M. Rangamani and T. Takayanagi, A Covariant holographic entanglement entropy proposal, JHEP07, 062, 2007, [arXiv:0705.0016 [hep-th]]
Pith/arXiv arXiv 2007
-
[4]
Dong, The Gravity Dual of Renyi Entropy, Nature Commun.7, 12472, 2016, [arXiv:1601.06788 [hep-th]]
X. Dong, The Gravity Dual of Renyi Entropy, Nature Commun.7, 12472, 2016, [arXiv:1601.06788 [hep-th]]
Pith/arXiv arXiv 2016
-
[5]
T. Takayanagi and K. Umemoto, Entanglement of purification through holographic duality, Nature Phys.14, 573–577, 2018, [arXiv:1708.09393 [hep-th]]
Pith/arXiv arXiv 2018
-
[6]
K. Umemoto and Y. Zhou, Entanglement of Purification for Multipartite States and its Holographic Dual, JHEP10, 152, 2018, [arXiv:1805.02625 [hep-th]]
Pith/arXiv arXiv 2018
- [7]
-
[8]
S. Dutta and T. Faulkner, A canonical purification for the entanglement wedge cross-section, JHEP03, 178, 2021, [arXiv:1905.00577 [hep-th]]. 53
Pith/arXiv arXiv 2021
-
[9]
X. Dong, X.-L. Qi and M. Walter, Holographic entanglement negativity and replica symmetry breaking, JHEP06, 024, 2021, [arXiv:2101.11029 [hep-th]]
arXiv 2021
- [10]
-
[11]
B. Collins, I. Nechita and K. Zyczkowski, Area law for random graph states, J. Phys. A46, 305302, 2013, [arXiv:1302.0709 [math-ph]]
Pith/arXiv arXiv 2013
-
[12]
P. Hayden, S. Nezami, X.-L. Qi, N. Thomas, M. Walter and Z. Yang, Holographic duality from random tensor networks, JHEP11, 009, 2016, [arXiv:1601.01694 [hep-th]]
Pith/arXiv arXiv 2016
- [13]
- [14]
-
[15]
N. Engelhardt, G. Penington and A. Shahbazi-Moghaddam, Twice upon a time: timelike-separated quantum extremal surfaces, JHEP01, 033, 2024, [arXiv:2308.16226 [hep-th]]
arXiv 2024
-
[16]
H. Apel, T. Kohler and T. Cubitt, Holographic duality between local Hamiltonians from random tensor networks, JHEP03, 052, 2022, [arXiv:2105.12067 [hep-th]]
arXiv 2022
-
[17]
T. Kohler and T. Cubitt, Toy Models of Holographic Duality between local Hamiltonians, JHEP08, 017, 2019, [arXiv:1810.08992 [hep-th]]
arXiv 2019
-
[18]
V. Balasubramanian and C. Cummings, Diffeomorphism invariant tensor networks for 3d gravity, 2025, [arXiv:2510.13941 [hep-th]]
arXiv 2025
-
[19]
C. Akers and P. Rath, Holographic Renyi Entropy from Quantum Error Correction, JHEP05, 052, 2019, [arXiv:1811.05171 [hep-th]]
Pith/arXiv arXiv 2019
-
[20]
X. Dong, D. Harlow and D. Marolf, Flat entanglement spectra in fixed-area states of quantum gravity, JHEP10, 240, 2019, [arXiv:1811.05382 [hep-th]]
arXiv 2019
-
[21]
C. Akers and P. Rath, Entanglement Wedge Cross Sections Require Tripartite Entanglement, JHEP04, 208, 2020, [arXiv:1911.07852 [hep-th]]
arXiv 2020
-
[22]
Harper, Hyperthreads in holographic spacetimes, JHEP09, 118, 2021, [arXiv:2107.10276 [hep-th]]
J. Harper, Hyperthreads in holographic spacetimes, JHEP09, 118, 2021, [arXiv:2107.10276 [hep-th]]
arXiv 2021
-
[23]
Z. Li, T. Mori and B. Yoshida, Tripartite Haar random state has no bipartite entanglement, 2025, [arXiv:2502.04437 [quant-ph]]
Pith/arXiv arXiv 2025
- [24]
- [25]
-
[26]
N. Iizuka and M. Nishida, Genuine multientropy and holography, Phys. Rev. D112, 026011, 2025, [arXiv:2502.07995 [hep-th]]
arXiv 2025
- [27]
-
[28]
Gadde, On genuine multipartite entanglement signals, 2026, [arXiv:2603.07680 [quant-ph]]
A. Gadde, On genuine multipartite entanglement signals, 2026, [arXiv:2603.07680 [quant-ph]]
arXiv 2026
- [29]
-
[30]
C. Berthi` ere and P. Gaudin, Genuine multientropy, dihedral invariants, and Lifshitz theory, Phys. Rev. D113, 065029, 2026, [arXiv:2509.00593 [hep-th]]
Pith/arXiv arXiv 2026
-
[31]
M.-K. Yuan, M. Li and Y. Zhou, Multi-entropy from Linking in Chern-Simons Theory, 2025, [arXiv:2510.18408 [hep-th]]
arXiv 2025
- [32]
-
[33]
T. Anegawa, S. Suzuki and K. Tamaoka, Black hole as a multipartite entangler: multi-entropy in AdS3/CFT2, 2025, [arXiv:2512.21037 [hep-th]]
arXiv 2025
- [34]
-
[35]
N. Iizuka and S. Lin, Symmetry-resolved genuine multientropy: Random Haar and graph states, Phys. Rev. D113, 026016, 2026, [arXiv:2511.00905 [hep-th]]
arXiv 2026
-
[36]
X. Chen, X. Ji and Y.-W. Sun, Multipartite entanglement characterizing topological phase transitions in holographic nodal line semimetals, 2026, [arXiv:2602.01545 [hep-th]]
arXiv 2026
-
[37]
M. Del Zotto, A. Gadde and P. Putrov, From Multipartite Entanglement to TQFT, 2026, [arXiv:2602.16770 [hep-th]]
arXiv 2026
-
[38]
N. Iizuka and A. Miyata, The Junction Law for Multipartite Entanglement in Confining Holographic Backgrounds, 2026, [arXiv:2604.10583 [hep-th]]
Pith/arXiv arXiv 2026
-
[39]
N. Iizuka and A. Miyata, Where Multipartite Entanglement Localizes: The Junction Law for Genuine Multi-Entropy, 2026, [arXiv:2602.16331 [hep-th]]
arXiv 2026
-
[40]
A. Lewkowycz and J. Maldacena, Generalized gravitational entropy, JHEP08, 090, 2013, [arXiv:1304.4926 [hep-th]]
Pith/arXiv arXiv 2013
-
[41]
G. Penington, M. Walter and F. Witteveen, Fun with replicas: tripartitions in tensor networks and gravity, JHEP05, 008, 2023, [arXiv:2211.16045 [hep-th]]. 55
arXiv 2023
- [42]
- [43]
-
[44]
S. Carrozza, J. Chevrier and L. Lionni, Tensor invariants for multipartite entanglement classification, 2026, [arXiv:2604.02269 [math-ph]]
arXiv 2026
-
[45]
S. Akella and N. Iizuka, Structural Obstruction to Replica Symmetry Breaking for Multi-Entropy in Random Tensor Networks, 2026, [arXiv:2604.13261 [hep-th]]
Pith/arXiv arXiv 2026
-
[46]
G. Vidal and R. F. Werner, Computable measure of entanglement, Phys. Rev. A65, 032314, 2002, [arXiv:quant-ph/0102117]
Pith/arXiv arXiv 2002
- [47]
-
[48]
Cheng, C
N. Cheng, C. Lancien, G. Penington, M. Walter and F. Witteveen, Random tensor networks with non-trivial links, Annales Henri Poincar´ e25, 2107–2212, 2024
2024
- [49]
- [50]
-
[51]
Swingle, Entanglement Renormalization and Holography, Phys
B. Swingle, Entanglement Renormalization and Holography, Phys. Rev. D86, 065007, 2012, [arXiv:0905.1317 [cond-mat.str-el]]
Pith/arXiv arXiv 2012
-
[52]
H. Shapourian, S. Liu, J. Kudler-Flam and A. Vishwanath, Entanglement Negativity Spectrum of Random Mixed States: A Diagrammatic Approach, PRXQuantum2, 030347, 2021, [arXiv:2011.01277 [cond-mat.str-el]]
arXiv 2021
- [53]
- [54]
- [55]
-
[56]
Biane, Representations of symmetric groups and free probability, Advances in Mathematics 138, 126–181, 1998
P. Biane, Representations of symmetric groups and free probability, Advances in Mathematics 138, 126–181, 1998
1998
-
[57]
Collins and I
B. Collins and I. Nechita, Gaussianization and eigenvalue statistics for random quantum channels (III), The Annals of Applied Probability 1136–1179, 2011. 56
2011
-
[58]
Collins, M
B. Collins, M. Fukuda and I. Nechita, Low entropy output states for products of random unitary channels, Random Matrices: Theory and Applications2, 1250018, 2013
2013
-
[59]
Banica, S
T. Banica, S. T. Belinschi, M. Capitaine and B. Collins, Free Bessel laws, Canadian Journal of Mathematics63, 3–37, 2011
2011
-
[60]
S. Liu, M. Cemri, S. Agarwal, A. Krentsel, A. Naren, Q. Mang, Z. Li, A. Gupta, M. Maheswaran, A. Cheng, M. Pan, E. Boneh, K. Ramchandran et al., Skydiscover: A flexible framework for ai-driven scientific and algorithmic discovery, 2026
2026
-
[61]
Gueron and R
S. Gueron and R. Tessler, The Fermat-Steiner problem, The American Mathematical Monthly 109, 443–451, 2002
2002
-
[62]
X. Dong, J. Kudler-Flam and P. Rath, A modified cosmic brane proposal for holographic Renyi entropy, JHEP06, 120, 2024, [arXiv:2312.04625 [hep-th]]. 57
arXiv 2024
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.