Pages that link to "Item:Q2802540"

The following pages link to SDP Relaxations for Non-Commutative Polynomial Optimization (Q2802540):

Displaying 10 items.

• Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization (Q1650765) (← links)
• Dual bounds for the positive definite functions approach to mutually unbiased bases (Q2098296) (← links)
• Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← links)
• Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting) (Q2693046) (← links)
• Convexity and Semidefinite Programming in Dimension-Free Matrix Unknowns (Q2802531) (← links)
• Algorithm 950 (Q2828144) (← links)
• RepLAB: A Computational/Numerical Approach to Representation Theory (Q5011846) (← links)
• A paradox in bosonic energy computations via semidefinite programming relaxations (Q5141427) (← links)
• A synchronous NPA hierarchy with applications (Q6122907) (← links)
• The moment-SOS hierarchy: applications and related topics (Q6598421) (← links)