SDP Relaxations for Non-Commutative Polynomial Optimization
From MaRDI portal
Publication:2802540
DOI10.1007/978-1-4614-0769-0_21zbMath1334.90113OpenAlexW251229954MaRDI QIDQ2802540
Miguel Navascués, Stefano Pironio, Antonio Acín
Publication date: 26 April 2016
Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-0769-0_21
Semidefinite programming (90C22) Applications of mathematical programming (90C90) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (9)
Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization ⋮ A synchronous NPA hierarchy with applications ⋮ Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting) ⋮ A paradox in bosonic energy computations via semidefinite programming relaxations ⋮ Convexity and Semidefinite Programming in Dimension-Free Matrix Unknowns ⋮ Algorithm 950 ⋮ Lower bounds on matrix factorization ranks via noncommutative polynomial optimization ⋮ RepLAB: A Computational/Numerical Approach to Representation Theory ⋮ Dual bounds for the positive definite functions approach to mutually unbiased bases
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A generalized Grothendieck inequality and nonlocal correlations that require high entanglement
- Free probability theory. Papers from a workshop on random matrices and operator algebra free products, Toronto, Canada, Mars 1995
- Large-scale semidefinite programs in electronic structure calculation
- A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming
- An introduction to commutative and noncommutative Gröbner bases
- Symmetries of the Bell correlation inequalities
- Semidefinite programming relaxations for semialgebraic problems
- A strict Positivstellensatz for the Weyl algebra
- ``Positive noncommutative polynomials are sums of squares.
- Unbounded induced representations of \(\ast \)-algebras
- A nichtnegativstellensatz for polynomials in noncommuting variables
- Non-negative hereditary polynomials in a free \(*\)-algebra
- On rings of operators. Reduction theory
- Global Optimization with Polynomials and the Problem of Moments
- Convergent Relaxations of Polynomial Optimization Problems with Noncommuting Variables
- NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
- Testing the Dimension of Hilbert Spaces
- On the positivstellensatz in Weyl’s algebra
- ON MUTUALLY UNBIASED BASES
- A relevant two qubit Bell inequality inequivalent to the CHSH inequality
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- A positivstellensatz for non-commutative polynomials
- Solution of the truncated complex moment problem for flat data
- Maximal sets of mutually unbiased quantum states in dimension 6
- A glance beyond the quantum model
- Connes' embedding problem and Tsirelson's problem
- Unique Games with Entangled Provers Are Easy
- Semidefinite Approximations for Global Unconstrained Polynomial Optimization
This page was built for publication: SDP Relaxations for Non-Commutative Polynomial Optimization
