Lower bound of quantum uncertainty from extractable classical information

From MaRDI portal
Publication:264664

DOI10.1007/S11128-015-1187-6zbMATH Open1333.81041arXiv1304.4506OpenAlexW3105057701MaRDI QIDQ264664FDOQ264664


Authors: T. Pramanik, Shiladitya Mal, A. S. Majumdar Edit this on Wikidata


Publication date: 1 April 2016

Published in: Quantum Information Processing (Search for Journal in Brave)

Abstract: The sum of entropic uncertainties for the measurement of two non-commuting observables is not always reduced by the amount of entanglement (quantum memory) between two parties, and in certain cases may be impacted by quantum correlations beyond entanglement (discord). An optimal lower bound of entropic uncertainty in the presence of any correlations may be determined by fine-graining. Here we express the uncertainty relation in a new form where the maximum possible reduction of uncertainty is shown to be given by the extractable classical information. We show that the lower bound of uncertainty matches with that using fine-graining for several examples of two-qubit pure and mixed entangled states, and also separable states with non-vanishing discord. Using our uncertainty relation we further show that even in the absence of any quantum correlations between the two parties, the sum of uncertainties may be reduced with the help of classical correlations.


Full work available at URL: https://arxiv.org/abs/1304.4506




Recommendations




Cites Work


Cited In (12)





This page was built for publication: Lower bound of quantum uncertainty from extractable classical information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q264664)