Pith. sign in

REVIEW 4 cited by

A Sharp Fannes-type Inequality for the von Neumann Entropy

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 quant-ph/0610146 v1 pith:FA2ONE2Q submitted 2006-10-18 quant-ph

A Sharp Fannes-type Inequality for the von Neumann Entropy

classification quant-ph
keywords inequalitydistanceentropynormtraceattainedderivedifference
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

We derive an inequality relating the entropy difference between two quantum states to their trace norm distance, sharpening a well-known inequality due to M. Fannes. In our inequality, equality can be attained for every prescribed value of the trace norm distance.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

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

  1. Growth and collapse of subsystem complexity under random unitary circuits

    quant-ph 2025-10 conditional novelty 7.0

    Under random brickwork circuits, regions larger than half the system have complexity growing linearly in time, while a smaller region thermalizes to essentially zero complexity by T=ℓ/2 — with holographic and replica ...

  2. The entropic coherence is a necessary resource for non-energy preserving gates

    quant-ph 2025-09 conditional novelty 7.0

    Entropic coherence of a battery, the relative entropy between its state and its energy-dephased version, must grow at least as the logarithm of the desired gate precision, making finite-dimensional batteries fundament...

  3. Growth and collapse of subsystem complexity under random unitary circuits

    quant-ph 2025-10 unverdicted novelty 6.0

    In random unitary circuits, small-subsystem complexity grows linearly up to time ℓ/2 then collapses to zero while complementary large subsystems grow for exponentially long times.

  4. SharedRep-RLHF: A Shared Representation Approach to RLHF with Diverse Preferences

    cs.LG 2025-09 reject novelty 6.0

    SharedRep-RLHF learns a shared preference representation across groups to improve worst-case reward estimates for minority annotators, but the theoretical guarantees are undermined by proof errors.