Hierarchy of efficiently computable and faithful lower bounds to quantum discord

Piani, Marco (2016) Hierarchy of efficiently computable and faithful lower bounds to quantum discord. Physical Review Letters, 117 (8). 080401. ISSN 1079-7114 (https://doi.org/10.1103/PhysRevLett.117.080401)

[thumbnail of Piani-PRL2016-Hierarchy-of-efficiently-computable-and-faithful-lower-bounds-to-quantum-discord]
Preview
 Text. Filename: Piani_PRL2016_Hierarchy_of_efficiently_computable_and_faithful_lower_bounds_to_quantum_discord.pdf
Accepted Author Manuscript
Download (575kB)| Preview

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.

ORCID iDs

Piani, Marco ORCID logoORCID: https://orcid.org/0000-0002-4698-9497;
CORE (COnnecting REpositories)