REVIEW 2 cited by
Quantum conditional entropies from convex trace functionals
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Quantum conditional entropies from convex trace functionals
read the original abstract
We study geometric properties of trace functionals that generalize those in [Zhang, Adv. Math. 365:107053 (2020)], arising from a novel family of conditional entropies with applications in quantum information. Building on new convexity results for these functionals, we establish data-processing inequalities and additivity properties for our entropies, demonstrating their operational significance. We further prove completeness under duality, chain rules, and various monotonicity properties for this family. Our proofs draw on tools from complex interpolation theory, multivariate Araki--Lieb and Lieb--Thirring inequalities, variational characterizations of trace functionals, and spectral pinching techniques.
Forward citations
Cited by 2 Pith papers
-
Reliability Functions of Quantum Soft Covering and Privacy Amplification via a Mixed-Order R\'enyi Divergence
Exact reliability functions for quantum soft covering and privacy amplification at sandwiched order α≥2 are given by min of sandwiched and mixed-order order-two Rényi information quantities.
-
Can scrambling protect quantum state distinguishability under noise?
Noisy 2-design ensembles show a conditional-entropy-governed threshold for distinguishability preservation while post-measured versions collapse exponentially with no protected regime.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.