Let ketD^N_1 denote the N-qubit Dicke state with one excitation, and let (HC)_1,2 denote circuits generated by Hadamard and controlled-not gates acting on qubits 1 and 2. Write |s_N| for the number of unique entanglement entropies comprising all entropy vectors in the (HC)_1,2 orbit of ketD^N_1. Entanglement-entropy count conjecture. For N≥ 2, this number is |s_N|=lfloor frac5N-72rfloor. The conjecture predicts how the variety of individual entanglement entropies grows with the number of qubits, even though the orbit contains at most five distinct entropy vectors. Its status is not resolved in the supplied source context.

Entanglement-entropy count conjecture for Dicke-state orbits

A 2023 preprint formulates the conjecture for the number of distinct entanglement entropies in the $(HC)_{1,2}$ orbit of $\lvert D^N_1\rangle$ , predicting $\lvert s_N\rvert=\left\lfloor(5N-7)/2\right\rfloor$ for $N\geq 2$ . It also observes that, for $N\geq 3$ , the orbit has five entropy vectors even though their individual entropy values proliferate.

Known results

Explicit calculations in the relevant analysis cover $N\leq 10$ and support the stated pattern.
For $N\geq 3$ , five distinct entropy vectors are reported in the orbit.
The conjecture is stated without a proof or counterexample.

2023 Clifford-double-coset follow-up

A later study derives upper bounds for entropy-vector reachability graphs and discusses Dicke-state symmetry, but it does not prove, disprove, or otherwise resolve the individual-entropy count conjecture.

Current status (as of August 2026): The formula is supported by finite computations but remains an open conjecture, with no publicly reported proof, counterexample, or verification found.

Entanglement-entropy count conjecture for Dicke-state orbits

Primary source

Progress summary

Solutions 0