Limitations on Separable Measurements by Convex Optimization

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 discriminating any set of either three or four Bell states via LOCC or separable measurements when the parties are given an ancillary partially entangled pair of qubits; an easily checkable characterization of when an unextendable product set is perfectly discriminated by separable measurements, along with the first known example of an unextendable product set that cannot be perfectly discriminated by separable measurements; and an optimal bound on the success probability for any LOCC or separable measurement for the recently proposed state discrimination problem of Yu, Duan, and Ying.

[1]  C. H. Bennett,et al.  Quantum nonlocality without entanglement , 1998, quant-ph/9804053.

[2]  John Watrous,et al.  Bipartite subspaces having no bases distinguishable by local operations and classical communication. , 2005, Physical review letters.

[3]  Ping Xing Chen,et al.  Orthogonality and distinguishability: Criterion for local distinguishability of arbitrary orthogonal states , 2003 .

[4]  C. H. Bennett,et al.  Unextendible product bases and bound entanglement , 1998, quant-ph/9808030.

[5]  Yuan Feng,et al.  Distinguishability of Quantum States by Separable Operations , 2007, IEEE Transactions on Information Theory.

[6]  Somshubhro Bandyopadhyay,et al.  Local Distinguishability of Any Three Quantum States , 2006 .

[7]  Somshubhro Bandyopadhyay,et al.  LOCC distinguishability of unilaterally transformable quantum states , 2011, 1102.0841.

[8]  Runyao Duan,et al.  Distinguishability of Quantum States by Positive Operator-Valued Measures With Positive Partial Transpose , 2012, IEEE Transactions on Information Theory.

[9]  Somshubhro Bandyopadhyay,et al.  Entanglement cost of nonlocal measurements , 2008, 0809.2264.

[10]  Michael Nathanson,et al.  Three maximally entangled states can require two-way local operations and classical communications for local discrimination , 2014 .

[11]  Somshubhro Bandyopadhyay,et al.  More nonlocality with less purity. , 2011, Physical review letters.

[12]  Martin Mathieu.  COMPLETELY BOUNDED MAPS AND OPERATOR ALGEBRAS (Cambridge Studies in Advanced Mathematics 78) , 2004 .

[13]  Somshubhro Bandyopadhyay,et al.  Tight bounds on the distinguishability of quantum states under separable measurements , 2013, 1306.2712.

[14]  Alessandro Cosentino,et al.  Positive-partial-transpose-indistinguishable states via semidefinite programming , 2012, 1205.1031.

[15]  V. Paulsen.  Completely Bounded Maps and Operator Algebras: Contents , 2003 .

[16]  Vedral,et al.  Local distinguishability of multipartite orthogonal quantum states , 2000, Physical review letters.

[17]  Michael Nathanson.  Distinguishing bipartitite orthogonal states using LOCC: Best and worst cases , 2005 .

[18]  Keqin Feng,et al.  Unextendible product bases and 1-factorization of complete graphs , 2006, Discret. Appl. Math..

[19]  B. Terhal.  A family of indecomposable positive linear maps based on entangled quantum states , 1998, quant-ph/9810091.

[20]  M. Murao,et al.  Bounds on multipartite entangled orthogonal state discrimination using local operations and classical communication. , 2005, Physical review letters.

[21]  H. Breuer.  Optimal entanglement criterion for mixed quantum states. , 2006, Physical review letters.

[22]  A. Sen De,et al.  Distinguishability of Bell states. , 2001, Physical Review Letters.

[23]  Vincent Russo,et al.  Small sets of locally indistinguishable orthogonal maximally entangled states , 2013, Quantum Inf. Comput..

[24]  Hermann Kampermann,et al.  Asymptotically perfect discrimination in the local-operation-and-classical-communication paradigm , 2011 .

[25]  Scott M. Cohen.  Understanding entanglement as resource: locally distinguishing unextendible product bases , 2007, 0708.2396.

[26]  H. Fan.  Distinguishability and indistinguishability by local operations and classical communication. , 2004, Physical review letters.

[27]  V. Roychowdhury,et al.  Non-full rank bound entangled states satisfying the range criterion , 2004, quant-ph/0406023.

[28]  M. Ying,et al.  Four locally indistinguishable ququad-ququad orthogonal maximally entangled states. , 2011, Physical review letters.

[29]  L. Hardy,et al.  Nonlocality, asymmetry, and distinguishing bipartite states. , 2002, Physical review letters.

[30]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[31]  P. Shor,et al.  Unextendible Product Bases, Uncompletable Product Bases and Bound Entanglement , 1999, quant-ph/9908070.

[32]  M. Horodecki,et al.  Local indistinguishability: more nonlocality with less entanglement. , 2003, Physical review letters.

[33]  William Hall,et al.  A new criterion for indecomposability of positive maps , 2006 .

[34]  Debasis Sarkar,et al.  Distinguishability of maximally entangled states , 2004 .

[35]  Axthonv G. Oettinger,et al.  IEEE Transactions on Information Theory , 1998 .

[36]  Laura Mančinska,et al.  A Framework for Bounding Nonlocality of State Discrimination , 2012, Communications in Mathematical Physics.

[37]  Somshubhro Bandyopadhyay,et al.  Entanglement cost of two-qubit orthogonal measurements , 2010, 1005.5236.