Lower bound of quantum uncertainty from extractable classical information

A. S. Majumdar; S. Mal; T. Pramanik

RECORD

Lower bound of quantum uncertainty from extractable classical information

T. Pramanik, S. Mal, A. S. Majumdar

Quantum Physics · Submitted 16 Apr 2013

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim 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.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗

Cite ▾

Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13-20260917 via OpenRouter, question bank abstract-p1-20260923, 2026-09-23: 1 request, 4,370 input tokens, $0.0002 reported.

What the abstract itself states, as probabilities: claims first 0.05 · states limitation 0.24 · human participants 0.01 · controlled comparison 0.09 · randomized assignment 0.01 · states quantitative result 0.55 · compares with prior results 0.89 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v4. Results and the main claim are underlined; show every role.

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.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#	sentence	role	the authors' own work	states the main conclusion	strength
s0	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).	background 0.94	0.14	0.12	asserted 0.73
s1	An optimal lower bound of entropic uncertainty in the presence of any correlations may be determined by fine-graining.	background 0.90	0.27	0.11	asserted 0.57
s2	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.	contribution 0.88	0.93	0.75	asserted 1.00
s3	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.	result 0.95	0.95	0.17	asserted 1.00
s4	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.	result 0.96	0.91	0.22	asserted 0.61

What kind of paper the classifier reports this is: theoretical result 1.00 · evidence from proof or derivation 0.97.

What was examined, and what was not

sources read

arXiv listing abstract v4

not examined

full text
figures and tables
references and citing sentences
relations to other papers

levels run

P abstract

not run

S sections
T body sentences
C citations
R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper

Original 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.

Human review

How Pith checks papers → · Full audit of this paper →

How the literature uses it

1 arXiv paper cite this in 1 sentence

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.