Related papers: Best separable approximation with semi-definite pr…
We use the language of semidefinite programming and duality to derive necessary and sufficient conditions for the optimal Lewenstein-Sanpera Decomposition (LSD) of 2-qubit states. We first provide a simple and natural derivation of the…
It is shown that for a given bipartite density matrix and by choosing a suitable separable set (instead of product set) on the separable-entangled boundary, optimal Lewenstein-Sanpera (L-S) decomposition can be obtained via optimization for…
We investigate the problem of finding the optimal convex decomposition of a bipartite quantum state into a separable part and a positive remainder, in which the weight of the separable part is maximal. This weight is naturally identified…
We provide an analytical expression for optimal Lewenstein-Sanpera decomposition of Bell decomposable states by using semi-definite programming. Also using the Karush-Kuhn-Tucker optimization method, the minimum relative entropy of…
As it is well known, every bipartite $2\otimes 2$ density matrix can be obtained from Bell decomposable states via local quantum operations and classical communications (LQCC). Using this fact, the Lewenstein-Sanpera decomposition of an…
Unambiguously distinguishing between nonorthogonal but linearly independent quantum states is a challenging problem in quantum information processing. In this work, an exact analytic solution to an optimum measurement problem involving an…
We discuss in this letter Lewenstein-Sanpera (L-S) decomposition for a specific Werner state. Compared with the optimal case, we propose a quasi-optimal one which in the view of concurrence leads to the same entanglement measure for the…
We obtain Lewenstein-Sanpera decomposition of iso-concurrence decomposable states of $2\otimes 2$ quantum systems. It is shown that in these systems average concurrence of the decomposition is equal to the concurrence of the state and also…
We propose a simple geometrical approach for finding the Lewenstein-Sanpera decomposition of Bell decomposable states of 2 otimes 2 quantum systems. We show that in these systems, the weight of the pure entangled part in the decomposition…
In general the calculation of robustness of entanglement for the mixed entangled quantum states is rather difficult to handle analytically. Using the the convex semi-definite programming method, the robustness of entanglement of some mixed…
We show that the maximum fidelity obtained by a p.p.t. distillation protocol is given by the solution to a certain semidefinite program. This gives a number of new lower and upper bounds on p.p.t. distillable entanglement (and thus new…
We express the optimization of entanglement witnesses for arbitrary bipartite states in terms of a class of convex optimization problems known as Robust Semidefinite Programs (RSDP). We propose, using well known properties of RSDP, several…
Finding the closest separable state to a given target state is a notoriously difficult task, even more difficult than deciding whether a state is entangled or separable. To tackle this task, we parametrize separable states with a neural…
We introduce a new technique to detect separable states using semidefinite programs. This approach provides a sufficient condition for separability of a state that is based on the existence of a certain local linear map applied to a known…
Using the Hilbert-Schmidt (HS) decomposition we suggest new possible choices of Bell operators and entanglement witnesses (EW ) for n (>2) qubits systems for (full/bi) separability. The latter give upper bounds for (full/bi) separability.…
We show a simple semidefinite program whose optimal value is equal to the maximum probability of perfectly distinguishing orthogonal maximally entangled states using any PPT measurement (a measurement whose operators are positive under…
We investigate optimal separable approximations (decompositions) of states rho of bipartite quantum systems A and B of arbitrary dimensions MxN following the lines of Ref. [M. Lewenstein and A. Sanpera, Phys. Rev. Lett. 80, 2261 (1998)].…
We consider a bipartite mixed state of the form, $\rho =\sum_{\alpha, \beta =1}^{l}a_{\alpha \beta} | \psi_{\alpha}> < \psi_ \beta}| $, where $| \psi_{\alpha}>$ are normalized bipartite state vectors, and matrix $(a_{\alpha \beta})$ is…
We describe a purely algebraic method for finding the best separable approximation to a mixed state of a composite 2x2 quantum system, consisting of a decomposition of the state into a linear combination of a mixed separable part and a pure…
In this paper we consider the problem of unambiguous discrimination between a set of linearly independent pure quantum states. We show that the design of the optimal measurement that minimizes the probability of an inconclusive result can…