Related papers: PPT-indistinguishable states via semidefinite prog…
With a probability of success of $95 \%$ we solve the separability problem for Bell diagonal qutrit states with positive partial transposition (PPT). The separability problem, i.e. distinguishing separable and entangled states, generally…
We study the distinguishability of a particular type of maximally entangled states -- the "lattice states" using a new approach of semidefinite program. With this, we successfully construct all sets of four ququad-ququad orthogonal…
We show how to design families of operational criteria that distinguish entangled from separable quantum states. The simplest of these tests corresponds to the well-known Peres-Horodecki positive partial transpose (PPT) criterion, and the…
We study the distinguishability of bipartite quantum states by Positive Operator-Valued Measures with positive partial transpose (PPT POVMs). The contributions of this paper include: (1). We give a negative answer to an open problem of [M.…
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…
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…
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 study the problem of distinguishing quantum states using local operations and classical communication (LOCC). A question of fundamental interest is whether there exist sets of $k \leq d$ orthogonal maximally entangled states in…
Measuring an entangled state of two particles is crucial to many quantum communication protocols. Yet Bell state distinguishability using a finite apparatus obeying linear evolution and local measurement is theoretically limited. We extend…
We compare the classification as entangled or separable of Bell diagonal bipartite qudits with positive partial transposition (PPT) and their properties for different dimensions. For dimension $d \geq 3$, a form of entanglement exists that…
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…
A new additive and semidefinite programming (SDP) computable entanglement measure is introduced to upper bound the amount of distillable entanglement in bipartite quantum states by operations completely preserving the positivity of partial…
Two pure orthogonal quantum states can be perfectly distinguished by sequential local action of multiple pairs of parties. However, this process typically leads to the complete dissolution of entanglement in the states being discriminated.…
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…
Two types of results are presented for distinguishing pure bipartite quantum states using Local Operations and Classical Communications. We examine sets of states that can be perfectly distinguished, in particular showing that any three…
We address perfect discrimination of two separable states. When available states are restricted to separable states, we can theoretically consider a larger class of measurements than the class of measurements allowed in quantum theory. The…
Bipartite entangled quantum states with a positive partial transpose (PPT), i.e., PPT entangled states, are usually considered very weakly entangled. Since no pure entanglement can be distilled from them, they are also called bound…
We focus on determining the separability of an unknown bipartite quantum state $\rho$ by invoking a sufficiently large subset of all possible entanglement witnesses given the expected value of each element of a set of mutually orthogonal…
We consider the problem of designing an optimal quantum detector to minimize the probability of a detection error when distinguishing between a collection of quantum states, represented by a set of density operators. We show that the design…