Families of complex tensor trace-invariants with tree-like dominant pairings factorize at large N, allowing computation of typical multipartite Rényi entropies for uniform random states.
Average Entropy of a Subsystem
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
abstract
It was recently conjectured by D. Page that if a quantum system of Hilbert space dimension $nm$ is in a random pure state then the average entropy of a subsystem of dimension $m$ where $m \leq n$ is $ S_{mn} = \sum^{mn}_{k=n+1}(1/k) - (m-1)/2n$. In this letter this conjecture is proved.
citation-role summary
background 2
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 2representative citing papers
Quantum systems reach a Maximal Entanglement Limit where entanglement geometry produces thermal reduced density matrices and probabilistic behavior in statistical and high-energy physics.
citing papers explorer
-
Large $N$ factorization of families of tensor trace-invariants
Families of complex tensor trace-invariants with tree-like dominant pairings factorize at large N, allowing computation of typical multipartite Rényi entropies for uniform random states.
-
The Maximal Entanglement Limit in Statistical and High Energy Physics
Quantum systems reach a Maximal Entanglement Limit where entanglement geometry produces thermal reduced density matrices and probabilistic behavior in statistical and high-energy physics.