pith. sign in

This is needed because the algorithm converges to alocal maximum and one needs to repeat it multiple times with Nseeds random seeds to find the global maximum

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

fields

quant-ph 1

years

2026 1

verdicts

UNVERDICTED 1

clear filters

representative citing papers

Tight Entropic Uncertainty Relations

quant-ph · 2026-05-03 · unverdicted · novelty 1.0 · 2 refs

Derives an improved state-independent entropic uncertainty bound γ_s that is asymptotically tight as s→2 for all incompatible observables A and B, extendable to Renyi entropies.

citing papers explorer

Showing 1 of 1 citing paper after filters.

  • Tight Entropic Uncertainty Relations quant-ph · 2026-05-03 · unverdicted · none · ref 30 · 2 links

    Derives an improved state-independent entropic uncertainty bound γ_s that is asymptotically tight as s→2 for all incompatible observables A and B, extendable to Renyi entropies.