pith. machine review for the scientific record. sign in

arxiv: 2605.06452 · v1 · submitted 2026-05-07 · 🪐 quant-ph · cs.IT· math.IT

Recognition: unknown

Tight Contraction Rates for Primitive Channels under Quantum f-Divergences

Authors on Pith no claims yet

Pith reviewed 2026-05-08 10:59 UTC · model grok-4.3

classification 🪐 quant-ph cs.ITmath.IT
keywords quantum f-divergencesstrong data processing inequalitycontraction ratesprimitive quantum channelsreverse Pinsker inequalityquantum detailed balancechi-squared divergenceasymptotic mixing
0
0 comments X

The pith

Quantum f-divergences satisfy a local reverse Pinsker inequality that upper bounds the contraction rate of primitive channels by the SDPI constant of non-commutative chi-squared divergences.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes that quantum f-divergences obey a local reverse Pinsker inequality near a stationary state. This inequality shows that the rate at which a primitive quantum channel brings states closer to its unique stationary distribution is limited by the strong data-processing inequality constant for a non-commutative version of the chi-squared divergence. The authors also find that when the channel satisfies quantum detailed balance, these upper bounds become tight for several specific f-divergences. These findings apply to Petz, Matsumoto, and Hirche-Tomamichel divergences and extend previous contraction rate results in quantum information.

Core claim

Quantum f-divergences satisfy a local reverse Pinsker inequality, which implies that the asymptotic contraction rate of a primitive channel to its stationary state is upper bounded by the SDPI constant of any non-commutative χ²-divergence. Using quantum-detailed balance, a sufficient condition for these bounds to be tight is established, and the results are applied to Petz, Matsumoto, and Hirche-Tomamichel f-divergences.

What carries the argument

The local reverse Pinsker inequality for quantum f-divergences, which connects the f-divergence to the chi-squared divergence in a small neighborhood around the stationary state, allowing control of asymptotic contraction rates through SDPI constants.

If this is right

  • The asymptotic contraction rate is upper bounded by the SDPI constant of the χ²-divergence.
  • The bounds are tight under the condition of quantum detailed balance.
  • Strengthened contraction rate results hold for Petz, Matsumoto, and Hirche-Tomamichel f-divergences.
  • Fine-grained distinguishability measures can be used to quantify mixing rates in quantum Markov chains.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • This approach might simplify calculations of mixing times for quantum channels by reducing them to computing SDPI constants.
  • The results could extend to bounding errors in quantum algorithms or processes that rely on channel mixing.
  • Connections may exist to classical results on contraction rates, allowing unified treatments of quantum and classical cases.

Load-bearing premise

The quantum channel must be primitive, having a unique stationary state to which it contracts asymptotically, and the local reverse Pinsker inequality must apply near that state.

What would settle it

A counterexample would be a primitive quantum channel and an f-divergence where the observed asymptotic contraction rate exceeds the SDPI constant of the associated non-commutative chi-squared divergence.

read the original abstract

Data-processing inequalities capture the phenomenon that two probability distributions can only become less distinguishable under any common post-processing. For more fine-grained inequalities, one turns to strong data-processing inequality (SDPI) constants, which give the strongest inequalities for a given channel and reference state for a fixed measure of distinguishability. These quantities have been used to quantify the rate at which time-homogeneous Markov chains contract towards a fixed point both in the classical and quantum setting. In this work, we establish that quantum $f$-divergences satisfy a local reverse Pinsker inequality, which implies the asymptotic contraction rate of a primitive channel to its stationary state is upper bounded by the SDPI constant of any non-commutative $\chi^2$-divergence. Using quantum-detailed balance, we establish a sufficient condition for these bounds to be tight. Finally, we apply these results to Petz, Matsumoto, and Hirche-Tomamichel $f$-divergences, establishing new and strengthening previously known results.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The paper establishes that quantum f-divergences satisfy a local reverse Pinsker inequality near the stationary state. This inequality is used to prove that the asymptotic contraction rate of a primitive quantum channel to its fixed point is upper-bounded by the SDPI constant of any associated non-commutative χ²-divergence. Quantum detailed balance supplies a sufficient condition for these bounds to be tight. The framework is then applied to the Petz, Matsumoto, and Hirche-Tomamichel families of f-divergences, yielding new bounds and strengthening some previously known contraction-rate results.

Significance. If the local inequality and its passage to the asymptotic rate hold, the work supplies a unified approach to obtaining tight asymptotic mixing bounds for primitive quantum Markov chains under a wide class of f-divergences. The explicit tightness criterion via quantum detailed balance is a concrete strength that identifies cases where the SDPI constant is achieved. The applications to concrete divergences make the abstract bounds immediately usable for convergence analysis in quantum information.

minor comments (2)
  1. The transition from the local reverse Pinsker inequality to the global asymptotic rate (presumably in the main theorem) would benefit from an explicit statement of the neighborhood size in which the local inequality is assumed to hold.
  2. Notation for the non-commutative χ²-divergence and its SDPI constant should be introduced with a self-contained definition in the preliminaries rather than only by reference.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive and accurate summary of our manuscript, as well as for the recommendation of minor revision. The report correctly identifies the key contributions: the local reverse Pinsker inequality for quantum f-divergences, the resulting upper bound on asymptotic contraction rates via non-commutative χ²-SDPI constants, the tightness criterion under quantum detailed balance, and the applications to the Petz, Matsumoto, and Hirche-Tomamichel families. Since the report contains no specific major comments, we have no individual points to address. We will incorporate any minor editorial or clarification suggestions in the revised version.

Circularity Check

0 steps flagged

No significant circularity detected in derivation chain

full rationale

The central results—a local reverse Pinsker inequality for quantum f-divergences and the implied bound on asymptotic contraction rates via the SDPI constant of a non-commutative χ²-divergence—are derived from standard monotonicity properties of f-divergences and an explicit inequality derivation within the paper. The sufficient condition for tightness is obtained using quantum detailed balance, which is applied as an independent assumption rather than a self-referential definition. No step reduces by construction to the target contraction rate or relies on a load-bearing self-citation chain; the argument remains self-contained against external benchmarks such as data-processing inequalities and primitivity of the channel.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The work relies on established properties of quantum channels and divergences without introducing new free parameters or postulated entities.

axioms (2)
  • domain assumption Quantum f-divergences are monotone under completely positive trace-preserving maps
    Standard property invoked to obtain data-processing inequalities for the channel.
  • domain assumption Primitive quantum channels possess a unique stationary state and contract to it asymptotically
    Required to define the asymptotic contraction rate to a fixed point.

pith-pipeline@v0.9.0 · 5477 in / 1479 out tokens · 46454 ms · 2026-05-08T10:59:10.132132+00:00 · methodology

discussion (0)

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

Reference graph

Works this paper leans on

27 extracted references · 7 canonical work pages

  1. [1]

    Spreading of sets in product spaces and hypercontraction of the Markov operator,

    R. Ahlswede and P. Gács, “Spreading of sets in product spaces and hypercontraction of the Markov operator,” The annals of probability, pp. 925–939, 1976

  2. [2]

    Quantum f-divergences and error correction,

    F. Hiai, M. Mosonyi, D. Petz, and C. Bény, “Quantum f-divergences and error correction,” Reviews in Mathematical Physics, vol. 23, no. 07, pp. 691–747, 2011

  3. [3]

    Quantum f-divergences in von Neumann algebras. ii. maximal f-divergences,

    F. Hiai, “Quantum f-divergences in von Neumann algebras. ii. maximal f-divergences,” Journal of Mathematical Physics, vol. 60, no. 1, 2019

  4. [4]

    Quantum rényi and f-divergences from integral representations,

    C. Hirche and M. Tomamichel, “Quantum rényi and f-divergences from integral representations,” Communications in Mathematical Physics, vol. 405, no. 9, p. 208, 2024

  5. [5]

    Monotone Riemannian metrics and relative entropy on noncommutative probability spaces,

    A. Lesniewski and M. B. Ruskai, “Monotone Riemannian metrics and relative entropy on noncommutative probability spaces,” Journal of Mathematical Physics, vol. 40, no. 11, pp. 5702–5724, 1999

  6. [6]

    Contraction coefficients for noisy quantum channels,

    F. Hiai and M. B. Ruskai, “Contraction coefficients for noisy quantum channels,” Journal of Mathematical Physics, vol. 57, no. 1, 2016

  7. [7]

    On contraction coefficients, partial orders and approximation of capacities for quantum channels,

    C. Hirche, C. Rouzé, and D. S. França, “On contraction coefficients, partial orders and approximation of capacities for quantum channels,” Quantum, vol. 6, p. 862, 2022

  8. [8]

    Beigi, C

    S. Beigi, C. Hirche, and M. Tomamichel, “Some properties and applications of the new quantumf-divergences,” arXiv preprint arXiv:2501.03799, 2025

  9. [9]

    A unified approach to quantum con- traction and correlation coefficients,

    I. George and M. Tomamichel, “A unified approach to quantum con- traction and correlation coefficients,” arXiv preprint arXiv:2505.15281, 2025

  10. [10]

    Quantum data processing inequalities and their reverse,

    S. Iyer, “Quantum data processing inequalities and their reverse,” Master of Mathematics thesis, University of Waterloo, Waterloo, Ontario, Canada, 2025. [On- line]. Available: https://dspacemainprd01.lib.uwaterloo.ca/server/api/ core/bitstreams/5fd90dec-aa4c-4afc-a4cc-88ed36f42007/content

  11. [11]

    Comparison of contraction coefficients for f-divergences,

    A. Makur and L. Zheng, “Comparison of contraction coefficients for f-divergences,” Problems of Information Transmission, vol. 56, no. 2, pp. 103–156, 2020

  12. [12]

    Divergence inequalities with applications in ergodic theory,

    I. George, A. Zheng, and A. Bansal, “Divergence inequalities with applications in ergodic theory,” 2024, see arXiv v3: 2411.17241v3

  13. [13]

    Polyanskiy and Y

    Y . Polyanskiy and Y . Wu, Information theory: From coding to learning. Cambridge university press, 2025

  14. [14]

    Theχ2-divergence and mixing times of quantum Markov processes,

    K. Temme, M. J. Kastoryano, M. B. Ruskai, M. M. Wolf, and F. Ver- straete, “Theχ2-divergence and mixing times of quantum Markov processes,” Journal of Mathematical Physics, vol. 51, no. 12, 2010

  15. [15]

    Tight contraction rates for primitive channels under quantumf-divergences,

    M. S. Tan, M. Tomamichel, and I. George, “Tight contraction rates for primitive channels under quantumf-divergences,” to appear on arXiv

  16. [16]

    Quasi-entropies for states of a von Neumann algebra,

    D. Petz, “Quasi-entropies for states of a von Neumann algebra,” Publications of the Research Institute for Mathematical Sciences, vol. 21, no. 4, pp. 787–800, 1985

  17. [17]

    A new quantum version of f-divergence,

    K. Matsumoto, “A new quantum version of f-divergence,” in Nagoya Winter Workshop: Reality and Measurement in Algebraic Quantum Theory. Springer, 2015, pp. 229–273

  18. [18]

    Quantum channels and operations-guided tour,

    M. M. Wolf, “Quantum channels and operations-guided tour,” 2012

  19. [19]

    From classical to quantum: Explicit classical distributions achieving maximal quantumf- divergence,

    D. Lanier, J. Béguinot, and O. Rioul, “From classical to quantum: Explicit classical distributions achieving maximal quantumf- divergence,” 2025. [Online]. Available: https://arxiv.org/abs/2501.14340

  20. [20]

    Strong data processing inequalities andϕ-sobolev in- equalities for discrete channels,

    M. Raginsky, “Strong data processing inequalities andϕ-sobolev in- equalities for discrete channels,” IEEE Transactions on Information Theory, vol. 62, no. 6, pp. 3355–3389, 2016

  21. [21]

    Strong data-processing inequalities for channels and bayesian networks,

    Y . Polyanskiy and Y . Wu, “Strong data-processing inequalities for channels and bayesian networks,” in Convexity and Concentration. Springer, 2017, pp. 211–249

  22. [22]

    Gradient flow and entropy inequalities for quantum markov semigroups with detailed balance,

    E. A. Carlen and J. Maas, “Gradient flow and entropy inequalities for quantum markov semigroups with detailed balance,” Journal of Functional Analysis, vol. 273, no. 5, pp. 1810–1869, 2017

  23. [23]

    Tensorization of the strong data processing inequality for quantum chi-square divergences,

    Y . Cao and J. Lu, “Tensorization of the strong data processing inequality for quantum chi-square divergences,” Quantum, vol. 3, p. 199, 2019

  24. [24]

    Different quantum f-divergences and the reversibility of quantum operations,

    F. Hiai and M. Mosonyi, “Different quantum f-divergences and the reversibility of quantum operations,” Reviews in Mathematical Physics, vol. 29, no. 07, p. 1750023, Aug. 2017. [Online]. Available: http://dx.doi.org/10.1142/S0129055X17500234

  25. [25]

    On the strong converses for the quantum channel capacity theorems,

    N. Sharma and N. A. Warsi, “On the strong converses for the quantum channel capacity theorems,” arXiv preprint arXiv:1205.1712, 2012

  26. [26]

    Contraction of generalized relative entropy under stochastic mappings on matrices,

    D. Petz and M. B. Ruskai, “Contraction of generalized relative entropy under stochastic mappings on matrices,” Infinite Dimensional Analysis, Quantum Probability and Related Topics, vol. 1, no. 01, pp. 83–89, 1998

  27. [27]

    Quantum Doeblin coefficients: interpretations and applications,

    I. George, C. Hirche, T. Nuradha, and M. M. Wilde, “Quantum Doeblin coefficients: interpretations and applications,” arXiv preprint arXiv:2503.22823, 2025. APPENDIX In this section we provide proofs omitted from the main text. Proof of Lemma 2.We first prove that there is a sufficiently largensuch thatE n strictly contractsρ−σfor anyρ, σ∈ D(H). ∥E ◦n(ρ−σ)...