CHSH mod 3 reaches its exact maximal quantum value only with maximally entangled qutrit pairs (unique up to symmetry) and any strategy within ε of the optimum is O(√ε)-close to a direct sum of those optimal strategies.
A more efficient reformulation of complex SDP as real SDP
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
abstract
This note proposes a new reformulation of complex semidefinite programs (SDPs) as real SDPs. As an application, we present an economical reformulation of complex SDP relaxations of complex polynomial optimization problems as real SDPs and derive some further reductions by exploiting inner structure of the complex SDP relaxations. Various numerical examples demonstrate that our new reformulation runs significantly faster than the usual popular reformulation.
citation-role summary
method 1
citation-polarity summary
fields
math.OC 2years
2026 2verdicts
UNVERDICTED 2roles
method 1polarities
use method 1representative citing papers
A new Moment-QSOS hierarchy delivers SDP relaxations for quaternion polynomial optimization that incorporate correlative sparsity and a strengthened monomial basis for tighter bounds.
citing papers explorer
-
Robust self-testing with CHSH mod 3
CHSH mod 3 reaches its exact maximal quantum value only with maximally entangled qutrit pairs (unique up to symmetry) and any strategy within ε of the optimum is O(√ε)-close to a direct sum of those optimal strategies.
-
A Moment-QSOS Hierarchy for a Class of Quaternion Polynomial Optimization Problems
A new Moment-QSOS hierarchy delivers SDP relaxations for quaternion polynomial optimization that incorporate correlative sparsity and a strengthened monomial basis for tighter bounds.