Polynomial optimization on the sphere and quantum entanglement - PowerPoint PPT Presentation

Polynomial optimization on the sphere and quantum entanglement testing (Full paper will be online soon) Kun Fang Joint work with Hamza Fawzi Presented at QAS 2019, Shenzhen

Talk Outline ◎ Polynomial Optimization and SOS Hierarchy ◎ An improved Convergence Rate Main Result and Proof Strategy ◎ Relation to Entanglement Testing SOS Hierarchy (polynomial) v.s. DPS Hierarchy (quantum) ◎ Summary and Discussions

Polynomial Optimization on the Sphere

<latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> Polynomial Optimization on the Sphere Q Given a multivariate polynomial with p ( x ) x = ( x 1 , · · · , x d ) Computing the maximal value p max = max x ∈ S d − 1 p ( x ) Over the unit sphere S d − 1 = x ∈ R d : x 2 � 1 + · · · + x 2 d = 1 Applications: o the largest stable/independent set of a graph o Degree 3 polynomial opt. on the sphere (e.g. [Nesterov’03, De Klerk’08]) o 2 → 4 norm of a matrix A, p ( x ) = k Ax k 4 4 o Degree 4 polynomial opt. on the sphere (e.g. [Barak et al.’12]) o Best Separable State problem in quantum information theory o Degree 4 polynomial opt. on the product of spheres (e.g. [Barak-Kothari-Steurer’17]) o …

<latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> Polynomial Optimization on the Sphere Q Given a multivariate polynomial with p ( x ) x = ( x 1 , · · · , x d ) Computing the maximal value p max = max x ∈ S d − 1 p ( x ) Over the unit sphere S d − 1 = x ∈ R d : x 2 � 1 + · · · + x 2 d = 1 Difficulty: o Degree = 2, efficiently solved as an eigenvalue problem; o Degree > 2, NP-hard in general! Solution: o Sum-of-square (SOS) hierarchy [Parrilo’00; Lasserre’01] where each level is efficiently computable by semidefinite program

Polynomial optimization on the sphere and quantum entanglement - PowerPoint PPT Presentation

Polynomial optimization on the sphere and quantum entanglement testing (Full paper will be online soon) Kun Fang Joint work with Hamza Fawzi Presented at QAS 2019, Shenzhen Talk Outline Polynomial Optimization and SOS Hierarchy An

Polynomial optimization on the sphere and quantum entanglement testing Kun Fang Joint work with

Polynomial Optimzation in Quantum Information Theory Sabine Burgdorf University of Konstanz

Optimizing an homogeneous polynomial on the unit sphere Rima Khouja Advisors: Bernard Mourrain

Polynomial optimization and sums of squares Sums-of-squares hierarchy Semidefinite

Energy Optimization with Orthogonal Potentials on the Sphere Ryan W. Matzke University of

Using noncommutative polynomial optimization for matrix factorization ranks Sander Gribling

The NL-coflow polynomial (joint work with W. Hochstttler) MCW 2019 The NL-coflow polynomial

Discrepancy and energy optimization on the sphere Dmitriy Bilyk University of Minnesota

Halo Orbit Stationkeeping using Nonlinear Outline Introduction MPC and Polynomial Optimization

The quest of efficiency and certification in polynomial optimization Victor Magron , CNRSLAAS

Detecting optimality and extracting minimizers in polynomial optimization based on the Lasserre

A new polynomial algorithm for nested resource allocation, speed optimization and other related

Primary objectives: Convex optimization Ellipsoid method A polynomial algorithm for

Slide 7 / 39 Slide 8 / 39 6 What is the electric potential at point c if each side of the

Polynomial Optimization for Bounding Lipschitz Constants of Deep Networks Victor Magron , MAC

Introduction to Christoffel-Darboux kernels for polynomial optimization Edouard Pauwels POEMA

Structure theorems for compact K ahler manifolds Jean-Pierre Demailly joint work with Fr

Quasi-Statistical Manifolds and Geometry of Affine Distributions Hiroshi Matsuzoe Nagoya

Machine learning theory Model Selection Hamid Beigy Sharif University of Technology March 16,

succeed! Bill hancock! DRAMA KING!! MAYFIELD ! R E K A B CUTEST COUPLE!! ! D O O F

t ss rsss rt

A Two Fluid Model for Two-Phase A Two Fluid Model for Two-Phase Flows with Free Interface Flows

Codes correcteurs derreurs sur des surfaces Hermitiennes Fr ed eric Aka-Bil e EDOUKOU

The asymptotics of the holomorphic torsion form Martin Puchol Institut Camille Jordan