The star graph maximizer conjecture for entanglement of formation

Let Gnc\mathcal{G}_{n}^{c} be the set of all connected graphs on nn vertices, and let GGncG\in\mathcal{G}_{n}^{c} with V=pq|V|=pq. Star graph maximizer conjecture.

maxGncEF(σ(G))=EF(σ(K1,n1)).\max_{\mathcal{G}_{n}^{c}} E_{F}(\sigma(G))=E_{F}(\sigma(K_{1,n-1})).

This asserts that the star graph maximizes the entanglement of formation among connected graph density matrices on nn vertices. The source provides no resolution, so the conjecture remains open.

Sources & referencesView supporting material

Primary source

Samuel L. Braunstein, Sibasish Ghosh and Simone Severini, “The laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states”, arXiv:quant-ph/0406165 (2006).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.