Pages that link to "Item:Q1650765"
From MaRDI portal
The following pages link to Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization (Q1650765):
Displaying 8 items.
- Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization (Q1650765) (← links)
- Optimization over trace polynomials (Q2068367) (← links)
- Sparse noncommutative polynomial optimization (Q2144551) (← links)
- Exploiting term sparsity in noncommutative polynomial optimization (Q2231045) (← links)
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← links)
- Minimizer Extraction in Polynomial Optimization Is Robust (Q4561225) (← links)
- Lifting for Simplicity: Concise Descriptions of Convex Sets (Q5044992) (← links)
- Certifying optimality of Bell inequality violations: noncommutative polynomial optimization through semidefinite programming and local optimization (Q6490315) (← links)
