arXiv · 1810.04640
Energy Minimization in $CP^n$: Some Numerical and Analytical Results
Abstract
We study the problem of minimizing the energy function $M^p(m,n) := \min \sum_{1\le i 0$ are integers and $p$ is even. This problem has implications on finding nice polyhedra in projective spaces, and on quantum random access codes. We conduct experimental search in the complex case which suggests nice patterns on the minimum values. In some cases($p=2$ and partially $n=2$) we supply analytical proofs and give full descriptions of the minimal configurations. We also show that as $m\to \infty$, nearly equidistributed configurations points nearly give the minimal values we expect from our patterns.
Explore related subjects
Keep this discovery
Radel Ben Av, Assaf Goldberger, Giora Dula, Yossi Strassler. 2018-10-10. Energy Minimization in $CP^n$: Some Numerical and Analytical Results. https://arxiv.org/abs/1810.04640
Cite the original work for its findings. Save a collection to share your selection of sources.