Pith. sign in

REVIEW 1 cited by

Monotone Riemannian Metrics and Relative Entropy on Non-Commutative Probability Spaces

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

arxiv math-ph/9808016 v1 pith:2ASEGTRA submitted 1998-08-30 math-ph math.MPmath.OAquant-ph

classification math-phmath.MPmath.OAquant-ph
keywords relativeentropyoperatoruniqueconvexmetricsmonotoneriemannian
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We use the relative modular operator to define a generalized relative entropy for any convex operator function g on the positive real line satisfying g(1) = 0. We show that these convex operator functions can be partitioned into convex subsets each of which defines a unique symmetrized relative entropy, a unique family (parameterized by density matrices) of continuous monotone Riemannian metrics, a unique geodesic distance on the space of density matrices, and a unique monotone operator function satisfying certain symmetry and normalization conditions. We describe these objects explicitly in several important special cases, including the familiar logarithmic relative entropy. The relative entropies, Riemannian metrics, and geodesic distances obtained by our procedure all contract under completely positive, trace-preserving maps. We then define and study the maximal contraction associated with these quantities.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. The entanglement-assisted transmission capacity is a strong converse bound for identification

    quant-ph 2026-08 conditional novelty 8.0 of 10

    For every quantum channel, the identification capacity is at most the entanglement-assisted transmission capacity, with equality for low-noise channels and strict inequality for a family of transpose-depolarizing channels.

Pith tools