Certified bounds on optimization problems in quantum theory
Semidefinite relaxations of polynomial optimization have become a central tool for addressing the non-convex optimization problems over non-commutative operators that are ubiquitous in quantum information theory and, more in general, quantum physics. Yet, as these global relaxation methods are solved numerically, the b...
Younes Naceur, Jie Wang, Victor Magron et al.
· Quantum · 0 citations