Pith. sign in

REVIEW 2 cited by

Geometrical Bounds of the Irreversibility in Markovian Systems

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 2005.02871 v3 pith:34PKSWTF submitted 2020-05-06 cond-mat.stat-mech quant-ph

Geometrical Bounds of the Irreversibility in Markovian Systems

classification cond-mat.stat-mech quant-ph
keywords systemsboundboundsquantumclassicalentropygeometricalirreversibility
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We derive geometrical bounds on the irreversibility in both quantum and classical Markovian open systems that satisfy the detailed balance condition. Using information geometry, we prove that irreversible entropy production is bounded from below by a modified Wasserstein distance between the initial and final states, thus strengthening the Clausius inequality in the reversible-Markov case. The modified metric can be regarded as a discrete-state generalization of the Wasserstein metric, which has been used to bound dissipation in continuous-state Langevin systems. Notably, the derived bounds can be interpreted as the quantum and classical speed limits, implying that the associated entropy production constrains the minimum time of transforming a system state. We illustrate the results on several systems and show that a tighter bound than the Carnot bound for the efficiency of quantum heat engines can be obtained.

discussion (0)

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

Forward citations

Cited by 2 Pith papers

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

  1. Quantum Shannon theory made robust: a tale of three protocols for almost i.i.d. sources

    quant-ph 2026-05 unverdicted novelty 6.0

    Robust protocols are identified for three quantum Shannon tasks under three notions of almost i.i.d. structure that preserve i.i.d. rates, along with new concepts of almost i.i.d. process and club distance.

  2. Quantum Shannon theory made robust: a tale of three protocols for almost i.i.d. sources

    quant-ph 2026-05 unverdicted novelty 5.0

    Robust protocols exist for hypothesis testing, compression, and channel coding that attain optimal rates for arbitrary almost i.i.d. sources, via a new club distance and almost i.i.d. process notion.