Pages that link to "Item:Q2144234"
From MaRDI portal
The following pages link to Bounding the separable rank via polynomial optimization (Q2144234):
Displaying 8 items.
- Limitations of semidefinite programs for separable states and entangled games (Q1731116) (← links)
- The set of separable states has no finite semidefinite representation except in dimension \(3\times 2\) (Q2050062) (← links)
- The convex sum of product states for a separable state (Q2383324) (← links)
- Positive maps and separable matrices (Q2810548) (← links)
- Computer Algebra in Scientific Computing (Q5479247) (← links)
- Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks (Q6126663) (← links)
- State polynomials: positivity, optimization and nonlinear Bell inequalities (Q6608047) (← links)
- Finite convergence of moment-SOS relaxations with nonreal radical ideals (Q6622756) (← links)