Rényi multi-entropy of stabilizer graph states
Rényi multi-entropy measures correlations shared among several parts of a quantum state. For stabilizer graph states, replicated copies of the state lead to sums over finite fields. Which features of the graph determine the coefficients in these sums?
Why it matters and what counts as progress
Why it matters: Explicit coefficients make the multi-entropy computable for graph families and identify how loops change the result.
What counts as progress: Compute coefficients for a specified graph core and replica index, or give a proof that handles a wider class of cores.
How the problem developed
- 19 Oct 2026 · AI-assisted result [1]
Bartlomiej Czech, Yichen Feng, Jonathan Harper, Xin-Xiang Ju, Yang Zhao with AI assistance The paper gives explicit coefficients for four connected loop cores on four vertices.
AI contribution
Rényi Multi-entropy for Stabilizer States: A Finite Field Gauss Sum Problem
Computes the four connected four-vertex loop-core coefficients that enter Rényi multi-entropy for the specified stabilizer graph states, for integer replica index and positive GHZ-block sizes. Table 1 gives the square, triangle plus leaf, diamond and complete graph cases.
Sources
Publication history
Rényi Multi-entropy for Stabilizer States: A Finite Field Gauss Sum Problem
Daily emails by default, only when there’s an update.