Hierarchy of efficiently computable and faithful lower bounds to quantum discord

Marco Piani

Research output: Contribution to journalLetter

4 Citations (Scopus)
129 Downloads (Pure)

Abstract

Quantum discord expresses a fundamental non-classicality of correlations that is more general than entanglement, but that, in its standard definition, is not easily evaluated. We derive a hierarchy of computationally efficient lower bounds to the standard quantum discord. Every non-trivial element of the hierarchy constitutes by itself a valid discord-like measure, based on a fundamental feature of quantum correlations: their lack of shareability. Our approach emphasizes how the difference between entanglement and discord depends on whether shareability is intended as a static property or as a dynamical process.
Original languageEnglish
Article number080401
Number of pages6
JournalPhysical Review Letters
Volume117
Issue number8
DOIs
Publication statusPublished - 15 Aug 2016

Keywords

  • quantum discord
  • quantum separability
  • quantum fidelity
  • hierarchy
  • quantum correlations
  • shareability
  • a semidefinite programming
  • entanglement

Cite this