Related Experiment Video
Updated: Mar 15, 2026

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
Published on: September 8, 2023
Hierarchy of Efficiently Computable and Faithful Lower Bounds to Quantum Discord
Marco Piani1,2
1SUPA and Department of Physics, University of Strathclyde, Glasgow G4 0NG, United Kingdom.
Abstract:
Quantum discord expresses a fundamental nonclassicality 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 nontrivial element of the hierarchy constitutes by itself a valid discordlike 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.
Related Concept Videos
The Uncertainty Principle
The de Broglie Wavelength
Norton's Theorem
Fundamental Theorem of Algebra
Limits of the First Law of Thermodynamics
Synthetic Disvision of Polynomials

