Pages that link to "Item:Q1650765"

The following pages link to Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization (Q1650765):

Displaying 11 items.

• Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization (Q1650765) (← links)
• \texttt{libCreme}: an optimization library for evaluating convex-roof entanglement measures (Q1947078) (← links)
• Optimization over trace polynomials (Q2068367) (← links)
• Quantum entanglement, symmetric nonnegative quadratic polynomials and moment problems (Q2144545) (← 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)
• The constant trace property in noncommutative optimization (Q6666550) (← links)