PROJECT TITLE :

Limitations on Separable Measurements by Convex Optimization

ABSTRACT:

We prove limitations on LOCC and separable measurements in bipartite state discrimination issues using techniques from convex optimization. Specific results that we prove embody: an precise formula for the optimal chance of properly discriminating any set of either 3 or four Bell states via LOCC or separable measurements when the parties are given an ancillary partially entangled try of qubits; an easily checkable characterization of when an unextendable product set is perfectly discriminated by separable measurements, together with the primary known example of an unextendable product set that can't be perfectly discriminated by separable measurements; and an optimal sure on the success likelihood for any LOCC or separable measurement for the recently proposed state discrimination downside of Yu, Duan, and Ying.