The star graph maximizer conjecture for entanglement of formation
The star graph maximizer conjecture for entanglement of formation
Let be the set of all connected graphs on vertices, and let with . Star graph maximizer conjecture.
This asserts that the star graph maximizes the entanglement of formation among connected graph density matrices on 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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.