English

Entanglement is not a lower bound for geometric discord

Quantum Physics 2014-09-23 v3

Abstract

We show that partial transposition of any 2n2\otimes n state can have at most (n1)(n-1) number of negative eigenvalues. This extends a decade old result of 222\otimes 2 case by Sanpera et al [Phys. Rev. A {\bf 58}, 826 (1998)]. We then apply this result to critically assess an important conjecture recently made in [Phys. Rev. A {\bf 84}, 052110 (2011)], namely, the (normalized) geometric discord should always be lower bounded by squared negativity. This conjecture has strengthened the common belief that measures of generic quantum correlations should be more than those of entanglement. Our analysis shows that unfortunately this is not the case and we give several counterexamples to this conjecture. All the examples considered here are in finite dimensions. Surprisingly, there are counterexamples in 2n2\otimes n for any n>2n>2. Coincidentally, it appears that the 444\otimes 4 Werner state, when seen as a 282\otimes 8 dimensional state, also violates the conjecture. This result contributes significantly to the negative side of the current ongoing debates on the defining notion of geometric discord as a good measure of generic correlations.

Keywords

Cite

@article{arxiv.1207.5523,
  title  = {Entanglement is not a lower bound for geometric discord},
  author = {Swapan Rana and Preeti Parashar},
  journal= {arXiv preprint arXiv:1207.5523},
  year   = {2014}
}

Comments

v3: Title changed, matrix theoretic proof removed due to a gap; Supplementary Material will be added later; accepted in PRA as Rapid Communication