3,631 research outputs found
Interiors of completely positive cones
A symmetric matrix is completely positive (CP) if there exists an
entrywise nonnegative matrix such that . We characterize the
interior of the CP cone. A semidefinite algorithm is proposed for checking
interiors of the CP cone, and its properties are studied. A CP-decomposition of
a matrix in Dickinson's form can be obtained if it is an interior of the CP
cone. Some computational experiments are also presented
Efficient algorithms for tensor scaling, quantum marginals and moment polytopes
We present a polynomial time algorithm to approximately scale tensors of any
format to arbitrary prescribed marginals (whenever possible). This unifies and
generalizes a sequence of past works on matrix, operator and tensor scaling.
Our algorithm provides an efficient weak membership oracle for the associated
moment polytopes, an important family of implicitly-defined convex polytopes
with exponentially many facets and a wide range of applications. These include
the entanglement polytopes from quantum information theory (in particular, we
obtain an efficient solution to the notorious one-body quantum marginal
problem) and the Kronecker polytopes from representation theory (which capture
the asymptotic support of Kronecker coefficients). Our algorithm can be applied
to succinct descriptions of the input tensor whenever the marginals can be
efficiently computed, as in the important case of matrix product states or
tensor-train decompositions, widely used in computational physics and numerical
mathematics.
We strengthen and generalize the alternating minimization approach of
previous papers by introducing the theory of highest weight vectors from
representation theory into the numerical optimization framework. We show that
highest weight vectors are natural potential functions for scaling algorithms
and prove new bounds on their evaluations to obtain polynomial-time
convergence. Our techniques are general and we believe that they will be
instrumental to obtain efficient algorithms for moment polytopes beyond the
ones consider here, and more broadly, for other optimization problems
possessing natural symmetries
Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone
We investigate the completely positive semidefinite cone ,
a new matrix cone consisting of all matrices that admit a Gram
representation by positive semidefinite matrices (of any size). In particular
we study relationships between this cone and the completely positive and doubly
nonnegative cones, and between its dual cone and trace positive non-commutative
polynomials.
We use this new cone to model quantum analogues of the classical independence
and chromatic graph parameters and , which are roughly
obtained by allowing variables to be positive semidefinite matrices instead of
scalars in the programs defining the classical parameters. We can
formulate these quantum parameters as conic linear programs over the cone
. Using this conic approach we can recover the bounds in
terms of the theta number and define further approximations by exploiting the
link to trace positive polynomials.Comment: Fixed some typo
- …