Alessandro Cosentino, IQC
I will discuss some new results we have recently obtained for the
problem of quantum states discrimination by Local Operations and
Classical Communication (LOCC) and by separable measurements. I will introduce the problem, as well as the framework of cone programming and other techniques from convex optimization that we have used to prove our results. The final goal of the introduction will be to highlight a connection between the problem of locally discriminating quantum states and the study of positive linear maps. The second part of the talk will focus on the application of our techniques to questions concerning the discrimination of some interesting sets of states, namely the set of Bell states, unextendable product sets, and an interesting set of maximally entangled states recently proposed by Yu, Duan, and Ying.
The talk is based on a joint work with S. Bandyopadhyay, N. Johnston, V.
Russo, J. Watrous, and N. Yu, published as a preprint on
https://arxiv.org/abs/1408.6981