Optimization over trace polynomials
From MaRDI portal
Publication:2068367
DOI10.1007/S00023-021-01095-4zbMATH Open1483.90106OpenAlexW3193079914MaRDI QIDQ2068367FDOQ2068367
semidefinite programmingvon Neumann algebraPositivstellensatznoncommutative polynomialsemialgebraic settrace optimization(pure) trace polynomial
Semidefinite programming (90C22) Applications of functional analysis in quantum physics (46N50) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Computational methods for problems pertaining to quantum theory (81-08) Programming in abstract spaces (90C48) Semialgebraic sets and related spaces (14P10) Real algebra (13J30) Polynomial optimization (90C23)
Abstract: Motivated by recent progress in quantum information theory, this article aims at optimizing trace polynomials, i.e., polynomials in noncommuting variables and traces of their products. A novel Positivstellensatz certifying positivity of trace polynomials subject to trace constraints is presented, and a hierarchy of semidefinite relaxations converging monotonically to the optimum of a trace polynomial subject to tracial constraints is provided. This hierarchy can be seen as a tracial analog of the Pironio, Navascu'es and Ac'in scheme [New J. Phys., 2008] for optimization of noncommutative polynomials. The Gelfand-Naimark-Segal (GNS) construction is applied to extract optimizers of the trace optimization problem if flatness and extremality conditions are satisfied. These conditions are sufficient to obtain finite convergence of our hierarchy. The results obtained are applied to violations of polynomial Bell inequalities in quantum information theory. The main techniques used in this paper are inspired by real algebraic geometry, operator theory, and noncommutative algebra.
Recommendations
- The tracial moment problem and trace-optimization of polynomials
- Constrained polynomial optimization problems with noncommuting variables
- Convergent relaxations of polynomial optimization problems with noncommuting variables
- Sparse noncommutative polynomial optimization
- Constrained trace-optimization of polynomials in freely noncommuting variables
Cites work
- scientific article; zbMATH DE number 3155079 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 1061192 (Why is no real title available?)
- scientific article; zbMATH DE number 1860211 (Why is no real title available?)
- A noncommutative moment problem
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
- A positivstellensatz for non-commutative polynomials
- Asymptotically well-behaved input states do not violate additivity for conjugate pairs of random quantum channels
- Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
- Characterization of equivariant maps and application to entanglement detection
- Configuration of separability and tests for multipartite entanglement in Bell-type experiments
- Connes' embedding conjecture and sums of Hermitian squares
- Constrained polynomial optimization problems with noncommuting variables
- Convergent relaxations of polynomial optimization problems with noncommuting variables
- Differential equations, difference equations and matrix theory
- Engineering systems and free-semi-algebraic geometry
- Equivalent forms of the Bessis-Moussa-Villani conjecture
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Factoriality and Connes' invariant T(M) for free products of von Neumann algebras.
- Factorization of operator-valued polynomials in several non-commuting variables
- Flat extensions of positive moment matrices: recursively generated relations
- Free Function Theory Through Matrix Invariants
- Generalized log-majorization and multivariate trace inequalities
- Global optimization with polynomials and the problem of moments
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Handbook on semidefinite, conic and polynomial optimization
- Hyperbolic polynomials and generalized Clifford algebras
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
- Minimizer Extraction in Polynomial Optimization Is Robust
- Monotonic converging variational approximations to the functional integrals in quantum statistical mechanics
- Multivariate trace inequalities
- NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
- Optimization of polynomials in non-commuting variables
- Polynomial Bell inequalities
- Positive maps and trace polynomials from the symmetric group
- Positive polynomials and sums of squares
- Positive trace polynomials and the universal Procesi-Schacher conjecture
- Problems and theorems in analysis II. Theory of functions, zeros, polynomials, determinants, number theory, geometry. Transl. from the German by C. E. Billigheimer.
- Proof of the BMV conjecture
- Proper analytic free maps
- Proposed experiment to test local hidden-variable theories
- Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Separability of \(n\)-particle mixed states: necessary and sufficient conditions in terms of linear maps
- Separability properties of tripartite states with \(U\otimes u\otimes U\) symmetry
- Sums of squares, moment matrices and optimization over polynomials
- The \(K\)-moment problem for compact semi-algebraic sets
- The invariant theory of \(n\times n\) matrices
- The tracial moment problem and trace-optimization of polynomials
- Theory of operator algebras I.
- ``Positive noncommutative polynomials are sums of squares.
Cited in
(14)- Real algebraic geometry with a view toward Koopman operator methods. Abstracts from the workshop held March 12--17, 2023
- Globally trace-positive noncommutative polynomials and the unbounded tracial moment problem
- Certifying optimality of Bell inequality violations: noncommutative polynomial optimization through semidefinite programming and local optimization
- Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
- State polynomials: positivity, optimization and nonlinear Bell inequalities
- Positive maps and trace polynomials from the symmetric group
- Positive maps from the walled Brauer algebra
- Optimization via Chebyshev polynomials
- Noncommutative Christoffel-Darboux kernels
- Positive univariate trace polynomials
- A Characterization of Perfect Strategies for Mirror Games
- Dimension-free entanglement detection in multipartite Werner states
- Partial isospectrality of a matrix pencil and circularity of the \(c\)-numerical range
- The tracial moment problem and trace-optimization of polynomials
This page was built for publication: Optimization over trace polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2068367)
