Related papers: State polynomials: positivity, optimization and no…
Let X be a finite set of points in R^n. A polynomial p nonnegative on X can be written as a sum of squares of rational functions modulo the vanishing ideal I(X). From the point of view of applications, such as polynomial optimization, we…
This paper deals with the quantum optimal discrimination among mixed quantum states enjoying geometrical uniform symmetry with respect to a reference density operator $\rho_0$. It is well-known that the minimal error probability is given by…
Topology optimization of frame structures under free-vibration eigenvalue constraints constitutes a challenging nonconvex polynomial optimization problem with disconnected feasible sets. In this article, we first formulate it as a…
In the problem of asymptotic binary i.i.d. state discrimination, the optimal asymptotics of the type I and the type II error probabilities is in general an exponential decrease to zero as a function of the number of samples; the set of…
Supmech, which is noncommutative Hamiltonian mechanics \linebreak (NHM) (developed in paper I) with two extra ingredients : positive observable valued measures (PObVMs) [which serve to connect state-induced expectation values and classical…
We consider the expected violations of Bell inequalities from random pure states. More precisely, we focus on a slightly generalised version of the CGLMP inequality, which concerns Bell experiments of two parties, two measurement options…
We prove limitations on LOCC and separable measurements in bipartite state discrimination problems using techniques from convex optimization. Specific results that we prove include: an exact formula for the optimal probability of correctly…
We present a protocol that produces a conditionally prepared state that can be used for a Bell test based on homodyne detection. Based on the results of Munro [PRA 1999], the state is near-optimal for Bell-inequality violations based on…
It is common in stability analysis to linearize a system and investigate the spectrum of the Jacobian matrix. This approach faces the challenge of determining the matrix spectrum when the coefficients depend on parameters or when the…
Most of the paradoxical, for the classical intuition, features of quantum theory were formulated for situations which involve a fixed number of particles. While one can now find a formulation of Bell's theorem for quantum fields, a…
We construct a convergent family of outer approximations for the problem of optimizing polynomial functions over convex bodies subject to polynomial constraints. This is achieved by generalizing the polarization hierarchy, which has…
We study a class of semi-linear differential Volterra equations with polynomial-type potentials that incorporates the effects of memory while being subjected to random perturbations via an additive Gaussian noise. We show that for a broad…
Recently a moment-sum-of-squares hierarchy for exit location estimation of stochastic processes has been presented. When restricting to the special case of the unit ball, we show that the solutions approach the optimal value by a…
We introduce new mathematical aspects of the Bell states using matrix factorizations, nonnoetherian singularities, and noncommutative blowups. A matrix factorization of a polynomial $p$ consists of two matrices $\phi_1,\phi_2$ such that…
We obtain in closed form averages of polynomials, taken over hermitian matrices with the Gaussian measure involved in the Kontsevich integral, and prove a conjecture of Witten enabling one to express analogous averages with the full (cubic…
We present a general approach to rounding semidefinite programming relaxations obtained by the Sum-of-Squares method (Lasserre hierarchy). Our approach is based on using the connection between these relaxations and the Sum-of-Squares proof…
We consider the problem of minimizing a given $n$-variate polynomial $f$ over the hypercube $[-1,1]^n$. An idea introduced by Lasserre, is to find a probability distribution on $[-1,1]^n$ with polynomial density function $h$ (of given…
Consider the problem of minimizing a polynomial $f$ over a compact semialgebraic set ${\mathbf{X} \subseteq \mathbb{R}^n}$. Lasserre introduces hierarchies of semidefinite programs to approximate this hard optimization problem, based on…
We consider systems of strict multivariate polynomial inequalities over the reals. All polynomial coefficients are parameters ranging over the reals, where for each coefficient we prescribe its sign. We are interested in the existence of…
High dimensional quantum entanglement and the advancements in their experimental realization provide a playground for fundamental research and eventually lead to quantum technological developments. The Horodecki criterion determines whether…