The sum-of-squares hierarchy on the sphere and applications in quantum information theory
From MaRDI portal
Publication:2235150
DOI10.1007/s10107-020-01537-7zbMath1478.90077arXiv1908.05155OpenAlexW2968911711MaRDI QIDQ2235150
Publication date: 20 October 2021
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.05155
Semidefinite programming (90C22) Entanglement measures, concurrencies, separability criteria (81P42) Polynomial optimization (90C23)
Related Items
Homogeneous polynomials and spurious local minima on the unit sphere ⋮ Extremal cubics on the circle and the 2-sphere ⋮ Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel--Darboux Kernel ⋮ Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere ⋮ Optimization on the Euclidean Unit Sphere ⋮ On the effective Putinar's Positivstellensatz and moment approximation ⋮ Homogenization for polynomial optimization with unbounded sets ⋮ Real algebraic geometry with a view toward Koopman operator methods. Abstracts from the workshop held March 12--17, 2023 ⋮ Optimality conditions for homogeneous polynomial optimization on the unit sphere ⋮ Approximate real symmetric tensor rank ⋮ An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization ⋮ Exponential Convergence of Sum-of-Squares Hierarchies for Trigonometric Polynomials ⋮ Harmonic Hierarchies for Polynomial Optimization ⋮ Degree Bounds for Putinar’s Positivstellensatz on the Hypercube ⋮ An effective version of Schmüdgen's Positivstellensatz for the hypercube ⋮ Sum-of-squares hierarchies for binary polynomial optimization ⋮ Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization ⋮ Sum-of-squares hierarchies for binary polynomial optimization ⋮ Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere
Cites Work
- Unnamed Item
- Unnamed Item
- Convexity properties of the cone of nonnegative polynomials
- Bounds for extreme zeros of some classical orthogonal polynomials
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey
- Positive maps of low dimensional matrix algebras
- Uniform denominators in Hilbert's seventeenth problem
- Quantum de Finetti theorems under local measurements with applications
- One-and-a-half quantum de Finetti theorems
- Remarks on the extreme eigenvalues of Toeplitz forms associated with orthogonal polynomials
- Global Optimization with Polynomials and the Problem of Moments
- Separability and distillability in composite quantum systems - a primer
- On the Field of Values of a Matrix
- Classical deterministic complexity of Edmonds' Problem and quantum entanglement
- A most compendious and facile quantum de Finetti theorem
- On the Equivalence of Algebraic Approaches to the Minimization of Forms on the Simplex
- Zeros of Gegenbauer and Hermite polynomials and connection coefficients
- Quantum entanglement, sum of squares, and the log rank conjecture
- Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization
- Hypercontractivity, sum-of-squares proofs, and their applications
- A quasipolynomial-time algorithm for the quantum separability problem
- Extreme Eigenvalues of Toeplitz Matrices Associated with Certain Orthogonal Polynomials
- A Survey of the S-Lemma
- Quantum information. An introduction to basic theoretical concepts and experiments
