Quantum Subentropy: Subadditivity and Sharp Bounds on Discrimination Error

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.

Authors

Institutions

Publication Details

Journal
Entropy
Published
2026-11-20
DOI
https://doi.org/10.3390/e28111283
Primary Topic
Quantum Information and Cryptography
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Quantum Subentropy: Subadditivity and Sharp Bounds on Discrimination Error

Pratik Patil
Entropy
Quantum Information and Cryptography
article

Quantum Subentropy: Subadditivity and Sharp Bounds on Discrimination Error

Pratik Patil
article en

Abstract

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.

EntropyVol. 28(11)
The University of Texas at Austin (US)
Quantum Information and Cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
Quantum Subentropy: Subadditivity and Sharp Bounds on Discrimination Error — Pratik Patil · Entropy (2026) | TGRS Research Map | TGRS