Related papers: State polynomials: positivity, optimization and no…
Artin solved Hilbert's 17th problem, proving that a real polynomial in $n$ variables that is positive semidefinite is a sum of squares of rational functions, and Pfister showed that only $2^n$ squares are needed. In this paper, we…
A new class of states of light is introduced that is complementary to the well-known squeezed states. The construction is based on the general solution of the three-term recurrence relation that arises from the saturation of the…
We present a numerical algorithm for finding real non-negative solutions to polynomial equations. Our methods are based on the expectation maximization and iterative proportional fitting algorithms, which are used in statistics to find…
The assumption of a deterministic local hidden variable model constrains the experimentally accessible statistics in a Bell experiment to be contained in the Bell-local polytope. But what if the outputs for only a subset of the measurements…
Based on Clauser-Horner-Shimony-Holt inequality, we show a fruitful method to exploit Bell inequalities for multipartite qubit systems. These Bell inequalities are designed with a simpler architecture tailored to experimental demonstration.…
Contemporary versions of Bell's argument against local hidden variable (LHV) theories are based on the Clauser Horne Shimony and Holt (CHSH) inequality, and various attempts to generalize it. The amount of violation of these inequalities…
We prove decomposition theorems for sparse positive (semi)definite polynomial matrices that can be viewed as sparsity-exploiting versions of the Hilbert--Artin, Reznick, Putinar, and Putinar--Vasilescu Positivstellens\"atze. First, we…
Violation of the Bell-type inequalities is necessary to confirm the existence of nonlocality in nonclassical (entangled) states. We have designed a customized operator which is made of the sum of the Pauli matrices ($\sigma_x$, $\sigma_y$,…
We construct a class of generalized nonlinear coherent states by means of a newly obtained class of 2D complex orthogonal polynomials. The associated coherent states transform is discussed. A polynomials realization of the basis of the…
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomials that are sums of squares of polynomials and satisfy some…
For a multipartite quantum state, the maximal violation of all Bell inequalities constitutes a measure of its nonlocality [Loubenets, J. Math. Phys. 53, 022201 (2012)]. In the present article, for the maximal violation of Bell inequalities…
For the Bell scenario with two parties and two binary observables per party, it is known that the no-signaling polytope is the polyhedral dual (polar) of the Bell polytope. Computational evidence suggests that this duality also holds for…
We introduce an S.o.S hierarchy of lower bounds for a polynomial optimization problem whose constraint is expressed as a matrix polynomial semidefinite inequality. Our approach involves utilizing a penalty function framework to directly…
We introduce a new approach aiming at computing approximate optimal designs for multivariate polynomial regressions on compact (semi-algebraic) design spaces. We use the moment-sum-of-squares hierarchy of semidefinite programming problems…
Bell inequalities play a key role in certifying quantum properties for device-independent quantum information protocols. It is still a major challenge, however, to devise Bell inequalities tailored for an arbitrary given quantum state.…
We pose and discuss several Hermitian analogues of Hilbert's $17$-th problem. We survey what is known, offer many explicit examples and some proofs, and give applications to CR geometry. We prove one new algebraic theorem: a non-negative…
A polynomial that is nonnegative need not be a sum of squares of polynomials. This classical gap, identified by Hilbert in 1888, lies at the heart of why the global optimization of multivariate quartic polynomials is NP-hard. Yet we show…
Bernstein polynomial approximation to a continuous function has a slower rate of convergence as compared to other approximation methods. "The fact seems to have precluded any numerical application of Bernstein polynomials from having been…
We provide a framework for the numerical approximation of distributed optimal control problems, based on least-squares finite element methods. Our proposed method simultaneously solves the state and adjoint equations and is $\inf$--$\sup$…
Let M be an archimedean quadratic module of real t-by-t matrix polynomials in n variables, and let S be the set of all real n-tuples where each element of M is positive semidefinite. Our key finding is a natural bijection between the set of…