⚛️ quantum physics

Revisiting the Page curve and its moments. A combinatorial approach

This paper presents a self-contained, combinatorial approach using Schur-Weyl duality and symmetric group character theory to derive simple closed-form expressions for all power moments of the von Neumann entropy of a random pure quantum state, offering an alternative to traditional random matrix theory methods.

Original authors: Gero von Gersdorff

Published 2026-07-01

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Gero von Gersdorff

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

The Big Picture: The "Black Hole" Puzzle

Imagine you have a giant, perfectly mixed smoothie (a pure quantum state) made of two ingredients: a tiny drop of blueberry (System A) and a massive ocean of vanilla (System B).

If you take a spoonful of just the blueberry part, it looks messy and mixed up because it's entangled with the vanilla ocean. Physicists call this "entropy" or "disorder." A famous idea called the Page Curve predicts how much disorder you see in that spoonful as the vanilla ocean slowly evaporates away.

At first: The ocean is huge, so the spoonful looks very messy (high entropy).
In the middle: As the ocean shrinks, the spoonful starts to look more like a pure blueberry again.
At the end: When the ocean is gone, the spoonful is pure blueberry again (zero entropy).

The paper asks: Can we calculate the exact average messiness (entropy) and how much it might vary, without doing impossible math?

The Old Way: The "Heavy Calculator"

Usually, to figure out this messiness, physicists use a method involving Random Matrix Theory. Think of this like trying to predict the weather by simulating every single air molecule in a storm. It works, but it requires heavy, complex integrals (a type of advanced math calculation) and special polynomials. It's like trying to count every grain of sand on a beach to find the average weight of a grain.

The New Way: The "Lego Master"

The authors of this paper say, "Let's try a different approach." Instead of counting grains of sand, they use combinatorics (the math of counting and arranging) and group theory (the math of symmetry).

They treat the problem like a Lego building game:

The Blocks: They imagine the quantum state as a tower of Lego bricks.
The Rules: They use a set of rules called Schur-Weyl duality. Think of this as a magical instruction manual that tells you exactly how the Lego tower can be rearranged without breaking it.
The Pattern: Instead of calculating the whole tower at once, they look at the "shapes" the bricks can form. They use a tool called the Murnaghan–Nakayama rule, which is like a specific recipe for taking a big Lego shape and peeling off layers (called "border strips") to see what's underneath.

The Core Discovery: From "Integers" to "Real Numbers"

The paper's main trick is that they calculate the answer for whole numbers first (like 1, 2, 3...).

Imagine you want to know the "messiness" of the smoothie. It's hard to calculate for a "half-spoon."
But it's easy to calculate for 1 spoon, 2 spoons, 3 spoons, etc.
The authors found a simple, closed formula (a neat equation) that works perfectly for 1, 2, 3... spoons.

Once they have this neat formula for whole numbers, they use a bit of mathematical "common sense" to stretch it out to cover any number (even fractions like 1.5). They argue that because the formula behaves so smoothly and follows strict rules (like always going down as the ocean shrinks), there is only one logical way to stretch it.

The Results: Simpler and Cleaner

The authors successfully calculated:

The Average: They confirmed the famous Page curve (the average messiness).
The Variance: They calculated how much the messiness fluctuates (the "wobble" around the average).
Higher Moments: They found a way to calculate even more complex statistics about the messiness.

Why is this better?

Simpler Math: Their formulas are much shorter. Where the old method might need a double-layered calculation (like a 4x4 grid of numbers), their method often just needs a single line or a double sum.
No Integrals: They never had to do the heavy "integration" (the calculus part). They just counted patterns and symmetries.
Self-Contained: They explained all the necessary math (like how to count Lego shapes) right in the paper, so you don't need to go to a library to understand the tools they used.

Summary

Think of the paper as a new, elegant way to solve a complex puzzle. Instead of brute-forcing the solution with heavy machinery (integrals and random matrices), the authors used a clever set of counting rules (combinatorics and symmetry) to find a shortcut. They built a simple "Lego" model that perfectly predicts the behavior of quantum entropy, making the math much easier to read and use.

Technical Summary: Revisiting the Page curve and its moments. A combinatorial approach

Problem Statement
The paper addresses the statistical properties of the entanglement entropy of a subsystem within a bipartite pure quantum state. Specifically, it considers a system $A$ of dimension $m$ and a system $B$ of dimension $n$ , where the total state is drawn uniformly at random from the Hilbert space of dimension $d=mn$. The central object of study is the reduced density matrix $\rho_A = \text{tr}_B(|\psi\rangle\langle\psi|)$ . While the average entanglement entropy (the Page curve) is well-established, calculating higher moments of the entropy distribution requires evaluating complex integrals over the unitary group or utilizing random matrix theory techniques involving Laguerre polynomials. The authors aim to derive simple, closed-form expressions for all power moments of the subsystem density matrix, $\text{tr}[\rho_A^\lambda]$ , from which the moments of the entropy can be obtained via differentiation.

Methodology
The authors propose a purely algebraic and combinatorial approach, distinct from the standard integration-based methods. The core of their methodology relies on:

$U(d)$ Invariance: The uniform measure on the space of pure states is invariant under unitary rotations. This allows the authors to express the moments of the density matrix as sums over permutations without explicitly evaluating integrals.
Schur-Weyl Duality: By interpreting the tensor product spaces involved in the moments as representations of the symmetric group $S_N$ and the unitary group $U(n)$ , the authors decompose the problem into irreducible representations labeled by Young diagrams.
Character Theory of $S_N$ : The calculation reduces to summing characters of the symmetric group over specific conjugacy classes. The authors utilize the Murnaghan–Nakayama (MN) rule to compute these characters. This rule involves decomposing Young diagrams into "border strips" (connected sets of boxes with no $2\times2$ block).
Beta Sets and Hook Lengths: To handle the summation over Young diagrams explicitly, the authors employ "beta sets" (a combinatorial encoding of partitions) to parametrize the diagrams. This allows for the closed-form evaluation of hook length products and content polynomials, which appear in the dimension formulas for the representations.

Key Contributions and Results
The paper derives explicit, finite-sum expressions for the power moments $Z_\lambda = \sum_{p \in S_N} \text{tr}(T_n(p)) \text{tr}(T_m(pq))$ , where $q$ is a permutation of cycle type $\lambda$ .

Single Cycle Case ( $\lambda = (N)$ ): For the mean entropy (Page curve), the authors show that only hook-shaped partitions contribute. They derive a single-sum expression (Eq. 27) involving factorials and rising factorials, which is significantly simpler than previous double-sum or integral representations.
Two-Cycle Case ( $\lambda = (P, Q)$ ): For the variance and second moments, the authors introduce a coordinate system based on the "contents" of the lower-left corners of two border strips. This leads to a double-sum expression (Eq. 33) involving a cross-ratio term $X(r,s,P,Q)$ that accounts for the interaction between the strips.
General Case ( $\lambda = (\lambda_1, \dots, \lambda_k)$ ): The authors generalize the result to arbitrary integer partitions. They define a $k$ -dimensional map and a recursive operator $L$ that relates the sum over the restricted domain of valid Young diagrams to a sum over the entire positive orthant, corrected by lower-dimensional terms. The final result (Eq. 41) expresses the moment as a sum over set partitions of the index set $\{1, \dots, k\}$ .
Analytic Continuation: While the derivation is strictly valid for integer powers, the authors argue that the resulting expressions can be analytically continued to real positive $\lambda_i$ by interpreting factorials as Gamma functions. They support this continuation by noting that the resulting functions are completely monotone and reproduce known limiting cases (e.g., $n=1$ ).

Significance and Claims
The paper claims to provide a "self-contained" and "purely algebraic" alternative to the standard random matrix theory approach. The primary significance lies in the simplicity and explicitness of the derived formulas:

The expressions involve fewer nested sums compared to previous literature (e.g., reducing a quadruple sum to a double sum for the variance).
The method avoids the evaluation of difficult integrals, relying instead on combinatorial identities and group theory.
The authors verify their results numerically against existing literature (specifically Ref. [21]) for moments up to $k=3$ , finding agreement.

The authors remain modest regarding the analytic continuation, acknowledging that while consistency checks and monotonicity constraints strongly fix the continuation from integers to reals, the mathematical uniqueness of this continuation is not rigorously proven within the paper. They note that deriving closed-form expressions for all higher moments of the entropy (via differentiation) remains a complex task due to cancellations, and they leave the explicit derivation of these higher-order entropy moments to future work. The paper does not propose new experimental applications or extensions to black hole physics beyond the context of verifying the statistical properties of the Page curve.