Positive maps and separable matrices
From MaRDI portal
Abstract: A linear map between real symmetric matrix spaces is positive if all positive semidefinite matrices are mapped to positive semidefinite ones. A real symmetric matrix is separable if it can be written as a summation of Kronecker products of positive semidefinite matrices. This paper studies how to check if a linear map is positive or not and how to check if a matrix is separable or not. We propose numerical algorithms, based on Lasserre type semidefinite relaxations, for solving such questions. To check the positivity of a linear map, we construct a hierarchy of semidefinite relaxations for minimizing the associated bi-quadratic forms over the unit spheres. We show that the positivity can be detected by solving a finite number of such semidefinite relaxations. To check the separability of a matrix, we construct a hierarchy of semidefinite relaxations. If it is not separable, we can get a mathematical certificate for that; if it is, we can get a decomposition for the separability.
Recommendations
Cites work
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- A bounded degree SOS hierarchy for polynomial optimization
- A practical method for computing the largest \(M\)-eigenvalue of a fourth-order partially symmetric tensor
- A semidefinite hierarchy for containment of spectrahedra
- A successive approximation method for quantum separability
- A tensor product matrix approximation problem in quantum physics
- An exact Jacobian SDP relaxation for polynomial optimization
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Classical deterministic complexity of Edmonds' Problem and quantum entanglement
- Conditions for strong ellipticity and M-eigenvalues
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Global optimization with polynomials and the problem of moments
- GloptiPoly 3: moments, optimization and semidefinite programming
- Linear optimization with cones of moments and nonnegative polynomials
- On strong ellipticity and the Legendre-Hadamard condition
- On the Lasserre hierarchy of semidefinite programming relaxations of convex polynomial optimization problems
- On the role of the strong ellipticity condition in nonlinear elasticity
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Polynomial optimization with real varieties
- Positive semidefinite biquadratic forms
- Sums of squares, moment matrices and optimization over polynomials
- The \(\mathcal A\)-truncated \(K\)-moment problem
- Truncated \(K\)-moment problems in several variables
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(20)- Separability of Hermitian tensors and PSD decompositions
- Preserver problems on infinite divisibility and separability
- Positive weights and self-maps
- Completely positive mappings and mean matrices
- A universal framework for entanglement detection under group symmetry
- Positive definiteness of paired symmetric tensors and elasticity tensors
- A semidefinite relaxation algorithm for checking completely positive separable matrices
- Hermitian tensor decompositions
- A practical approach to SOS relaxations for detecting quantum entanglement
- Bounding the separable rank via polynomial optimization
- Quantum entanglement, symmetric nonnegative quadratic polynomials and moment problems
- Bi-block positive semidefiniteness of bi-block symmetric tensors
- Finite convergence of moment-SOS relaxations with nonreal radical ideals
- Positively factorizable maps
- New examples of extremal positive linear maps
- Symmetric Hermitian decomposability criterion, decomposition, and its applications
- Some recent developments in spectrahedral computation
- Best nonnegative rank-one approximations of tensors
- Semidefinite descriptions of low-dimensional separable matrix cones
- Rank properties of exposed positive maps
This page was built for publication: Positive maps and separable matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2810548)
