Convergent Relaxations of Polynomial Optimization Problems with Noncommuting Variables
From MaRDI portal
Publication:3083282
DOI10.1137/090760155zbMath1228.90073arXiv0903.4368OpenAlexW3105661328MaRDI QIDQ3083282
Miguel Navascués, Stefano Pironio, Antonio Acín
Publication date: 21 March 2011
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0903.4368
Semidefinite programming (90C22) General mathematical topics and methods in quantum theory (81Q99) Mathematical programming (90C99)
Related Items (45)
Noncommutative Christoffel-Darboux kernels ⋮ The tracial Hahn-Banach theorem, polar duals, matrix convex sets, and projections of free spectrahedra ⋮ On characterising assemblages in Einstein–Podolsky–Rosen scenarios ⋮ Sparse noncommutative polynomial optimization ⋮ Operator Positivstellensätze for noncommutative polynomials positive on matrix convex sets ⋮ Semidefinite programming hierarchies for constrained bilinear optimization ⋮ Global completability with applications to self-consistent quantum tomography ⋮ Quantum Bilinear Optimization ⋮ Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization ⋮ Minimizer Extraction in Polynomial Optimization Is Robust ⋮ Canonical primal-dual algorithm for solving fourth-order polynomial minimization problems ⋮ Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials ⋮ Can you compute the operator norm? ⋮ Reinhardt free spectrahedra ⋮ A physical approach to Tsirelson's problem ⋮ Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools ⋮ Real algebraic geometry with a view toward Koopman operator methods. Abstracts from the workshop held March 12--17, 2023 ⋮ The inflation hierarchy and the polarization hierarchy are complete for the quantum bilocal scenario ⋮ Entropy constraints for ground energy optimization ⋮ The tracial moment problem and trace-optimization of polynomials ⋮ A convergent inflation hierarchy for quantum causal structures ⋮ The convex Positivstellensatz in a free algebra ⋮ Information-causality and extremal tripartite correlations ⋮ Lower bounds for ground states of condensed matter systems ⋮ A paradox in bosonic energy computations via semidefinite programming relaxations ⋮ Limitations of semidefinite programs for separable states and entangled games ⋮ Exploiting term sparsity in noncommutative polynomial optimization ⋮ A combinatorial approach to nonlocality and contextuality ⋮ A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming ⋮ Matrix convex hulls of free semialgebraic sets ⋮ Noncommutative polynomials describing convex sets ⋮ Noncommutative polynomials nonnegative on a variety intersect a convex set ⋮ Constrained trace-optimization of polynomials in freely noncommuting variables ⋮ Convexity and Semidefinite Programming in Dimension-Free Matrix Unknowns ⋮ SDP Relaxations for Non-Commutative Polynomial Optimization ⋮ Using complete measurement statistics for optimal device-independent randomness evaluation ⋮ NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials ⋮ The weirdness theorem and the origin of quantum paradoxes ⋮ Algorithm 950 ⋮ Optimization over trace polynomials ⋮ Lower bounds on matrix factorization ranks via noncommutative polynomial optimization ⋮ Device-independent bit commitment based on the CHSH inequality ⋮ Randomness in post-selected events ⋮ Positive maps and trace polynomials from the symmetric group ⋮ On matrix algebras associated to sum-of-squares semidefinite programs
Uses Software
This page was built for publication: Convergent Relaxations of Polynomial Optimization Problems with Noncommuting Variables
