Convergent relaxations of polynomial optimization problems with noncommuting variables
From MaRDI portal
(Redirected from Publication:3083282)
Abstract: We consider optimization problems with polynomial inequality constraints in non-commuting variables. These non-commuting variables are viewed as bounded operators on a Hilbert space whose dimension is not fixed and the associated polynomial inequalities as semidefinite positivity constraints. Such problems arise naturally in quantum theory and quantum information science. To solve them, we introduce a hierarchy of semidefinite programming relaxations which generates a monotone sequence of lower bounds that converges to the optimal solution. We also introduce a criterion to detect whether the global optimum is reached at a given relaxation step and show how to extract a global optimizer from the solution of the corresponding semidefinite programming problem.
Recommendations
- SDP relaxations for non-commutative polynomial optimization
- Algorithm 950: Ncpol2sdpa -- sparse semidefinite programming relaxations for polynomial optimization problems of noncommuting variables
- Sparse noncommutative polynomial optimization
- Constrained polynomial optimization problems with noncommuting variables
- Optimization of polynomials in non-commuting variables
Cited in
(63)- Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
- Limitations of semidefinite programs for separable states and entangled games
- A physical approach to Tsirelson's problem
- The tracial moment problem and trace-optimization of polynomials
- Noncommutative polynomials describing convex sets
- The weirdness theorem and the origin of quantum paradoxes
- Optimization over trace polynomials
- Sparse noncommutative polynomial optimization
- Semidefinite programming hierarchies for constrained bilinear optimization
- Exploiting term sparsity in noncommutative polynomial optimization
- A combinatorial approach to nonlocality and contextuality
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
- Canonical primal-dual algorithm for solving fourth-order polynomial minimization problems
- Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools
- Noncommutative polynomials nonnegative on a variety intersect a convex set
- The tracial Hahn-Banach theorem, polar duals, matrix convex sets, and projections of free spectrahedra
- Reinhardt free spectrahedra
- Maximizing concave piecewise affine functions on the unitary group
- Matrix convex hulls of free semialgebraic sets
- Convexity and semidefinite programming in dimension-free matrix unknowns
- SDP relaxations for non-commutative polynomial optimization
- Algorithm 950: Ncpol2sdpa -- sparse semidefinite programming relaxations for polynomial optimization problems of noncommuting variables
- On matrix algebras associated to sum-of-squares semidefinite programs
- Constrained polynomial optimization problems with noncommuting variables
- Can you compute the operator norm?
- NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
- Quantum bilinear optimization
- Operator Positivstellensätze for noncommutative polynomials positive on matrix convex sets
- Global completability with applications to self-consistent quantum tomography
- Using complete measurement statistics for optimal device-independent randomness evaluation
- Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials
- The convex Positivstellensatz in a free algebra
- Minimizer Extraction in Polynomial Optimization Is Robust
- Nonnegative Polynomial Optimization over Unit Spheres and Convex Programming Relaxations
- Noncommutative Christoffel-Darboux kernels
- On characterising assemblages in Einstein–Podolsky–Rosen scenarios
- 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
- Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
- Device-independent bit commitment based on the CHSH inequality
- Randomness in post-selected events
- Positive maps and trace polynomials from the symmetric group
- Constrained trace-optimization of polynomials in freely noncommuting variables
- 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
- A convergent inflation hierarchy for quantum causal structures
- Certifying optimality of Bell inequality violations: noncommutative polynomial optimization through semidefinite programming and local optimization
- Semi-definite programming and quantum information
- State polynomials: positivity, optimization and nonlinear Bell inequalities
- Matrix extreme points and free extreme points of free spectrahedra
- The constant trace property in noncommutative optimization
- Free extreme points span generalized free spectrahedra given by compact coefficients
- Two convergent NPA-like hierarchies for the quantum bilocal scenario
- The future of secure communications: device independence in quantum key distribution
- The polarization hierarchy for polynomial optimization over convex bodies, with applications to nonnegative matrix rank
- Extensions of \(\mathrm{S}\)-lemma for noncommutative polynomial
- Coarse-grained bootstrap of quantum many-body systems
- Quasi-polynomial time algorithms for free quantum games in bounded dimension
- Application of the level-2 quantum Lasserre hierarchy in quantum approximation algorithms
- Complete upper bound hierarchies for spectral minimum in noncommutative polynomial optimization
- A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming
This page was built for publication: Convergent relaxations of polynomial optimization problems with noncommuting variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083282)
