EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Quantum Subentropy: Subadditivity and Sharp Bounds on Discrimination Error

Pratik Patil

Entropy · 20.11.2026 · 28 (11) · 1283

DOI: 10.3390/e28111283 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Entropy, online erschienen am 20.11.2026. Verfasst von Pratik Patil. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Subentropy gives a tight spectral lower bound on the accessible information of ensembles of pure states. We prove its subadditivity for arbitrary bipartite states in finite dimensions and derive a sharp relation between conditional subentropy and the minimum discrimination error. This relation strengthens a conjectured comparison with conditional min-entropy. Its inverse gives the strongest universal lower bound on the error determined only by conditional subentropy and the number of labels. Both main results follow from a comparison of conditional subentropy with the average subentropy of measurement posteriors, valid for mixed signal states and every finite measurement. We characterize all equality cases in these two results and bound posterior deviations near equality. We also determine the optimal Lipschitz constant in trace distance for conditional subentropy on classical–quantum states, including the exact constant when the quantum marginal is fixed. A determinant inequality strengthens subadditivity and proves strong subadditivity for classical distributions, while an exact counterexample shows that strong subadditivity fails for quantum states.

Zitieren

APA

Patil, P. (2026). Quantum Subentropy: Subadditivity and Sharp Bounds on Discrimination Error. Entropy, 28(11), 1283. https://doi.org/10.3390/e28111283

Vancouver

Patil P. Quantum Subentropy: Subadditivity and Sharp Bounds on Discrimination Error. Entropy. 2026;28(11):1283. doi:10.3390/e28111283

BibTeX
@article{Patil2026,
  author = {Patil, Pratik},
  title = {Quantum Subentropy: Subadditivity and Sharp Bounds on Discrimination Error},
  journal = {Entropy},
  year = {2026},
  volume = {28},
  number = {11},
  pages = {1283},
  doi = {10.3390/e28111283}
}
Kostenlos starten →