Related papers: Best separable approximation with semi-definite pr…
In this paper, we write down the separable Werner state in a two-qubit system explicitly as a convex combination of product states, which is different from the convex combination obtained by Wootters' method. The Werner state in a two-qubit…
There exists, in general, a convex set of quantum state estimators that maximize the likelihood for informationally incomplete data. We propose an estimation scheme, catered to measurement data of this kind, to search for the exact…
We consider the optimistic bilevel optimization problem, known to have a wide range of applications in engineering, that we transform into a single-level optimization problem by means of the lower-level optimal value function reformulation.…
In the present paper the cross norm criterion for separability of density matrices is studied. In the first part of the paper we determine the value of the greatest cross norm for Werner states, for isotropic states and for Bell diagonal…
A method to compute the optimal success probability of discrimination of N arbitrary quantum states is presented, based on the decomposition of any N-outcome measurement into sequences of nested two-outcome ones. In this way the…
According to usual definitions, entangled states cannot be given a separable decomposition in terms of products of local density operators. If we relax the requirement that the local density operators be positive, then an entangled quantum…
Given integers n $\geq$ m, let Sep(n,m) be the set of separable states on the Hilbert space $\mathbb{C}^n \otimes \mathbb{C}^m$. It is well-known that for (n,m)=(3,2) the set of separable states has a simple description using semidefinite…
This paper proposes a new algorithm for solving MAX2SAT problems based on combining search methods with semidefinite programming approaches. Semidefinite programming techniques are well-known as a theoretical tool for approximating maximum…
We introduce with geometric means a density matrix decomposition of a multipartite quantum system of a finite dimension into two density matrices: a separable one, also known as the best separable approximation, and an essentially entangled…
In contrast with many other convex optimization classes, state-of-the-art semidefinite programming solvers are yet unable to efficiently solve large scale instances. This work aims to reduce this scalability gap by proposing a novel…
We present a stronger version of the Doherty-Parrilo-Spedalieri (DPS) hierarchy of approximations for the set of separable states. Unlike DPS, our hierarchy converges exactly at a finite number of rounds for any fixed input dimension. This…
This paper proposes a tractable family of remainder-form mixed-monotone decomposition functions that are useful for over-approximating the image set of nonlinear mappings in reachability and estimation problems. Our approach applies to a…
The concept of entanglement and separability of quantum states is relevant for several fields in physics. Still, there is a lack of effective operational methods to characterise these features. We propose a method to certify quantum…
Multipartite quantum states that cannot be uniquely determined by their reduced states of all proper subsets of the parties exhibit some inherit `high-order' correlation. This paper elaborates this issue by giving necessary and sufficient…
The problems of optimally estimating a phase, a direction, and the orientation of a Cartesian frame (or trihedron) with general pure states are addressed. Special emphasis is put on estimation schemes that allow for inconclusive answers or…
In this paper, we consider a subclass of quantum states in the multipartite system, namely, the supersymmetric states. We investigate the problem whether they admit the symmetrically separable decomposition, i.e., each term in this…
It is well known that the Schmidt decomposition exists for all pure states of a two-party quantum system. We demonstrate that there are two ways to obtain an analogous decomposition for arbitrary rank-1 operators acting on states of a…
We present an abstract formulation of the so-called Innsbruck-Hannover programme that investigates quantum correlations and entanglement in terms of convex sets. We present a unified description of optimal decompositions of quantum states…
In Bell scenarios with two outcomes per party, we algorithmically consider the two sides of the membership problem for the local polytope: constructing local models and deriving separating hyperplanes, that is, Bell inequalities. We take…
We give the first approximation algorithm for mixed packing and covering semidefinite programs (SDPs) with polylogarithmic dependence on width. Mixed packing and covering SDPs constitute a fundamental algorithmic primitive with recent…