arXiv:2610.27080
Rényi multi-entropy of graph states and the $n -> 1$ limit
Sriram Akella, Abhijit Gadde
Abstract
Rényi multi-entropy extends the Rényi entropy to pure states of more than two parties. It is defined by a replica contraction at integer replica number $n$, and the multi-entropy is its $n\to1$ limit. In holography this limit is conjectured to compute the area of a minimal soap-film web in the bulk. Understanding multi-entropy for general states, however, is harder. Unlike the bipartite case, the replica contraction is not a moment of a density matrix, and the continuation to $n=1$ has to be found by other means. We study this problem for qubit graph states. We show that at every odd $n$ the contraction equals $2^{-k/2}$, where $k$ is a sum of ranks of matrices over a finite field, one row and one column per qubit. We define a class of graphs that we call collision-controlled, for which the rank sum is a polynomial in $n$. This class includes graphs without even cycles and all complete bipartite graphs. The natural polynomial $n \to 1$ continuation is a finite sum over partitions of the parties. While the Rényi multi-entropy is non-increasing under single-qubit Pauli measurements at every odd integer $n>1$, the continuation to $n=1$ is not. A $Z$ measurement on one qubit of an odd ring with $2r + 1 \geq 7$ qubits raises it from $(r+1)\log 2$ to $(2r-1) \log 2$. Thus the continuation is not an entanglement monotone.
AI Summary
Rényi multi-entropy generalizes the bipartite replica construction to multipartite pure states, but its replica contraction is not generally a density-matrix moment, leaving the $n\to1$ continuation unspecified. This paper studies that continuation for qubit graph states and tests whether it defines an entanglement monotone. For every odd integer $n$, the replica contraction is shown to be $Z_n=2^{-r_G(n)/2}$. Fourier transformation of the replica lattice over finite extensions of $\mathbb F_2$ expresses $r_G(n)$ as a sum of ranks of matrices with one row and column per qubit. A finite-field Gauss-sum analysis establishes positivity. For “collision-controlled” graphs, these ranks depend only on which party momenta coincide, making $r_G(n)$ polynomial in $n$ and yielding a finite partition-sum formula for the continued entropy. Matching and Pfaffian arguments establish collision control for graphs without even cycles; complete bipartite graphs and local-complementation invariance are also treated. With one qubit per party, the continuation gives $m\log2$ for a forest with $m$ edges and $(r+1)\log2$ for $C_{2r+1}$. Although every odd-integer Rényi multi-entropy is non-increasing under single-qubit Pauli measurements, deleting one vertex of $C_{2r+1}$ raises the continuation to $(2r-1)\log2$ for $r\ge3$, disproving LOCC monotonicity for this prescription. The continuation is unique only within a specified analytic growth class. Even-replica formulas have numerical support but no proof; a general-state continuation prescription and the corresponding qudit phase analysis remain unresolved.
The appendices were first drafted using LLMs and later edited by the authors. The main text was written by the authors.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 11 pages, 5 figures. Comments are welcome!