A Max-Flow approach to Random Tensor Networks
Khurshed Fitter, Faedi Loulidi, Ion Nechita

TL;DR
This paper analyzes the entanglement entropy of random tensor networks using free probability theory, providing explicit formulas for eigenvalue distributions and insights into quantum entanglement in complex network models.
Contribution
It introduces a new model for RTNs, derives the eigenvalue distribution in the large dimension limit, and connects entanglement properties to a maximum flow problem on the network graph.
Findings
Eigenvalue distribution derived for large local dimensions.
Explicit formulas for series-parallel graphs.
Insights into finite-size corrections to entanglement entropy.
Abstract
We study the entanglement entropy of a random tensor network (RTN) using tools from free probability theory. Random tensor networks are simple toy models that help the understanding of the entanglement behavior of a boundary region in the ADS/CFT context. One can think of random tensor networks are specific probabilistic models for tensors having some particular geometry dictated by a graph (or network) structure. We first introduce our model of RTN, obtained by contracting maximally entangled states (corresponding to the edges of the graph) on the tensor product of Gaussian tensors (corresponding to the vertices of the graph). We study the entanglement spectrum of the resulting random spectrum along a given bipartition of the local Hilbert spaces. We provide the limiting eigenvalue distribution of the reduced density operator of the RTN state, in the limit of large local dimension. The…
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 many-body systems · Cosmology and Gravitation Theories · Advanced Thermodynamics and Statistical Mechanics
