Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2511.22976

Strengthening the quantum data processing inequality for maximal $f$-divergences via unraveling

Marcos Ruibal Ortigueira, Robert de Keijzer, Luke Visser, Oliver Tse, Servaas Kokkelmans

quant-phSubmitted Nov 28, 2025• Announced Dec 1, 2025• 2 citations• Revised Oct 12, 2026 (v2)
v1 · Nov 28, 2025v2 · Oct 12, 2026
arXivHTMLPDF

Abstract

Maximal $f$-divergences, among them the Belavkin--Staszewski relative entropy, are non-increasing under completely positive trace-preserving maps, which is the quantum data processing inequality (DPI). We quantify this decrease for Lindblad evolutions with Hermitian jump operators by lifting the problem to a stochastic unraveling, in which the two states become measures on pure states evolving under a classical Fokker--Planck equation. The lift rests on the identity that the infimum of the classical $f$-divergence over ensembles realizing two states is equal to their maximal $f$-divergence. This infimum is attained on a common basis of pure states, which is admissible initial data for the unraveling. The result is a strengthened DPI, with the loss bounded below by the time integral of a relative $f$-Fisher information. Given a two-sided bound on the unraveling's transition kernel, we derive two exponential decay estimates. For bracket-generating jump operators, the rate reaches twice the spectral gap of the symmetrized generator after an explicit delay. Without bracket generation, the kernel bound alone gives any rate below twice the spectral gap of the full generator.

Comments
45 pages, 6 figures

Related papers

A strengthened data processing inequality for the Belavkin–Staszewski relative entropy

Andreas Blühm, Ángela Capel

In this work, we provide a strengthening of the data processing inequality for the relative entropy introduced by Belavkin and Staszewski (BS-entropy). This extends previous results by Carlen and Vershynina for the relative entropy and other standard [Formula: see text]-divergences. To this end, we provide two new equivalent conditions for the equality case of the data processing inequality for the BS-entropy. Subsequently, we extend our result to a larger class of maximal [Formula: see text]-divergences. Here, we first focus on quantum channels which are conditional expectations onto subalgebras and use the Stinespring dilation to lift our results to arbitrary quantum channels.

arXiv:1904.10768•Reviews in Mathematical Physics•Aug 22, 2019•14 citations

Geodesic Quantum fff-Divergences

Ángela Capel, Pablo Costa Rico

We introduce the geodesic quantum $f$-divergences $D_f^t$, $0\leq t\leq1$, obtained from the affine-invariant geodesic between the standard and maximal relative modular operators. They reduce to the classical $f$-divergence for commuting states. The logarithmic generator yields geodesic relative entropies joining the Umegaki and Belavkin-Staszewski entropies, while the power generators yield $(t,α)$-Rényi divergences joining the Petz and geometric families. Our first main result is data processing of $D_f^t$ for every finite operator-convex generator $f$ and every $t\in[0,1]$. In particular, this gives DPI for the geodesic relative entropies and for the $(t,α)$-Rényi divergences when $0<α<1$ or $1<α\leq2$. Our second main result identifies equality in the DPI: for invertible states, every equality-determining operator-convex generator has, at each nonmaximal parameter $0\leq t<1$, exactly the Petz sufficiency class; at $t=1$, this changes to the generally larger maximal, or BS, class, which also coincides with the equality class of the divergences associated with the quadratic generator for every $t$. Our third main result is the corresponding collapse of invertible geodesic quantum Markov chains: for each of the three ordered conditional-mutual-information constructions, the $t$-quantum Markov chains are precisely the quantum Markov chains for $0\leq t<1$, whereas at $t=1$ they are the invertible BS quantum Markov chains, a class that can be strictly larger. We also determine parameter-monotonicity regimes and the intersections with the $(α,z)$ family. We prove strengthened data-processing and reconstruction estimates; we compare the three conditional orientations; we establish continuity bounds under positive lower-eigenvalue assumptions together with complementary discontinuity results; and we give a capacity-per-unit-cost interpretation.

quant-pharXiv:2608.15833•Aug 18, 2026

Quantum data processing equality

Tai-Hsuan Yang

The quantum data processing inequality asserts that quantum relative entropy is monotonically non-increasing under quantum channels. Here, we promote this fundamental inequality to an exact equality via boundary and surface Poisson integral representations across a complex strip. The relative-entropy loss is resolved into two independent, nonnegative physical mechanisms: an operational Petz recovery component governing state reconstructibility, and a boundary term measuring the mismatch of relative modular dynamics. We further express the loss as the measured relative entropy between the original state and its averaged Petz recovery state plus a nonnegative variational remainder. For the Belavkin--Staszewski (BS) loss, analogous integral representations yield a decomposition into negative log Uhlmann fidelity with an averaged reconstruction plus a nonnegative variational remainder. Furthermore, we establish recovery bounds at any prescribed modular parameter, including the canonical unrotated Petz map, with optimal square-root scaling in the relative entropy loss. The prefactors depend on distinct-eigenvalue counts or logarithmic spectral quantities, improving upon the inverse-power dependence on small eigenvalues in previous bounds.

quant-pharXiv:2609.33815•Sep 29, 2026•1 citation

Integral formula for quantum relative entropy implies data processing inequality

Péter E. Frenkel

Integral representations of quantum relative entropy, and of the directional second and higher order derivatives of von Neumann entropy, are established, and used to give simple proofs of fundamental, known data processing inequalities: the Holevo bound on the quantity of information transmitted by a quantum communication channel, and, much more generally, the monotonicity of quantum relative entropy under trace-preserving positive linear maps – complete positivity of the map need not be assumed. The latter result was first proved by Müller-Hermes and Reeb, based on work of Beigi. For a simple application of such monotonicities, we consider any `divergence' that is non-increasing under quantum measurements, such as the concavity of von Neumann entropy, or various known quantum divergences. An elegant argument due to Hiai, Ohya, and Tsukada is used to show that the infimum of such a `divergence' on pairs of quantum states with prescribed trace distance is the same as the corresponding infimum on pairs of binary classical states. Applications of the new integral formulae to the general probabilistic model of information theory, and a related integral formula for the classical Rényi divergence, are also discussed.

arXiv:2208.12194•Quantum•Sep 7, 2023•32 citations

Tight Contraction Rates for Primitive Channels under Quantum $f$-Divergences

Matthew Simon Tan, Marco Tomamichel, Ian George

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 $χ^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.

quant-pharXiv:2605.06452•May 8, 2026•1 citation

Counterexamples to the Tensorization Property of Strong Data Processing Inequalities for Quantum Divergences

Yu Cao

In information theory, the data processing inequality is a fundamental property that describes the loss of information through noisy channels. A more refined description is given by the strong data processing inequality (SDPI) for a fixed channel and a full-rank reference state. In classical information theory, the strong data processing inequality tensorizes for a large family of $f$-divergences. However, its quantum counterpart remains largely unexplored. Tensorization of SDPI has previously been shown only for some special cases, and whether it holds more generally for quantum divergences still remains open. In this work, we report two negative results: the tensorization property fails for certain quantum chi-square divergences, and it also does not hold for the quantum relative entropy.

quant-pharXiv:2608.13204•Aug 14, 2026•1 citation
Strengthening the quantum data processing inequality for maximal fff-divergences via unraveling
Maximal fff-divergences, among them the Belavkin--Staszewski relative entropy, are non-increasing under completely positive trace-preserving maps, which is the quantum data processing inequality (DPI). We quantify this decrease for Lindblad evolutions with Hermitian jump operators by lifting the problem to a stochastic unraveling, in which the two states become measures on pure states evolving under a classical Fokker--Planck equation. The lift rests on the identity that the infimum of the classical fff-divergence over ensembles realizing two states is equal to their maximal fff-divergence. This infimum is attained on a common basis of pure states, which is admissible initial data for the unraveling. The result is a strengthened DPI, with the loss bounded below by the time integral of a relative fff-Fisher information. Given a two-sided bound on the unraveling's transition kernel, we derive two exponential decay estimates. For bracket-generating jump operators, the rate reaches twice the spectral gap of the symmetrized generator after an explicit delay. Without bracket generation, the kernel bound alone gives any rate below twice the spectral gap of the full generator.
In this work, we provide a strengthening of the data processing inequality for the relative entropy introduced by Belavkin and Staszewski (BS-entropy). This extends previous results by Carlen and Vershynina for the relative entropy and other standard [Formula: see text]-divergences. To this end, we provide two new equivalent conditions for the equality case of the data processing inequality for the BS-entropy. Subsequently, we extend our result to a larger class of maximal [Formula: see text]-divergences. Here, we first focus on quantum channels which are conditional expectations onto subalgebras and use the Stinespring dilation to lift our results to arbitrary quantum channels.
We introduce the geodesic quantum fff-divergences DftD_f^tDft​, 0≤t≤10\leq t\leq10≤t≤1, obtained from the affine-invariant geodesic between the standard and maximal relative modular operators. They reduce to the classical fff-divergence for commuting states. The logarithmic generator yields geodesic relative entropies joining the Umegaki and Belavkin-Staszewski entropies, while the power generators yield (t,α)(t,α)(t,α)-Rényi divergences joining the Petz and geometric families. Our first main result is data processing of DftD_f^tDft​ for every finite operator-convex generator fff and every t∈[0,1]t\in[0,1]t∈[0,1]. In particular, this gives DPI for the geodesic relative entropies and for the (t,α)(t,α)(t,α)-Rényi divergences when 0<α<10<α<10<α<1 or 1<α≤21<α\leq21<α≤2. Our second main result identifies equality in the DPI: for invertible states, every equality-determining operator-convex generator has, at each nonmaximal parameter 0≤t<10\leq t<10≤t<1, exactly the Petz sufficiency class; at t=1t=1t=1, this changes to the generally larger maximal, or BS, class, which also coincides with the equality class of the divergences associated with the quadratic generator for every ttt. Our third main result is the corresponding collapse of invertible geodesic quantum Markov chains: for each of the three ordered conditional-mutual-information constructions, the ttt-quantum Markov chains are precisely the quantum Markov chains for 0≤t<10\leq t<10≤t<1, whereas at t=1t=1t=1 they are the invertible BS quantum Markov chains, a class that can be strictly larger. We also determine parameter-monotonicity regimes and the intersections with the (α,z)(α,z)(α,z) family. We prove strengthened data-processing and reconstruction estimates; we compare the three conditional orientations; we establish continuity bounds under positive lower-eigenvalue assumptions together with complementary discontinuity results; and we give a capacity-per-unit-cost interpretation.
The quantum data processing inequality asserts that quantum relative entropy is monotonically non-increasing under quantum channels. Here, we promote this fundamental inequality to an exact equality via boundary and surface Poisson integral representations across a complex strip. The relative-entropy loss is resolved into two independent, nonnegative physical mechanisms: an operational Petz recovery component governing state reconstructibility, and a boundary term measuring the mismatch of relative modular dynamics. We further express the loss as the measured relative entropy between the original state and its averaged Petz recovery state plus a nonnegative variational remainder. For the Belavkin--Staszewski (BS) loss, analogous integral representations yield a decomposition into negative log Uhlmann fidelity with an averaged reconstruction plus a nonnegative variational remainder. Furthermore, we establish recovery bounds at any prescribed modular parameter, including the canonical unrotated Petz map, with optimal square-root scaling in the relative entropy loss. The prefactors depend on distinct-eigenvalue counts or logarithmic spectral quantities, improving upon the inverse-power dependence on small eigenvalues in previous bounds.
Integral representations of quantum relative entropy, and of the directional second and higher order derivatives of von Neumann entropy, are established, and used to give simple proofs of fundamental, known data processing inequalities: the Holevo bound on the quantity of information transmitted by a quantum communication channel, and, much more generally, the monotonicity of quantum relative entropy under trace-preserving positive linear maps – complete positivity of the map need not be assumed. The latter result was first proved by Müller-Hermes and Reeb, based on work of Beigi. For a simple application of such monotonicities, we consider any `divergence' that is non-increasing under quantum measurements, such as the concavity of von Neumann entropy, or various known quantum divergences. An elegant argument due to Hiai, Ohya, and Tsukada is used to show that the infimum of such a `divergence' on pairs of quantum states with prescribed trace distance is the same as the corresponding infimum on pairs of binary classical states. Applications of the new integral formulae to the general probabilistic model of information theory, and a related integral formula for the classical Rényi divergence, are also discussed.
Tight Contraction Rates for Primitive Channels under Quantum fff-Divergences
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 fff-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 χ2χ^2χ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 fff-divergences, establishing new and strengthening previously known results.
In information theory, the data processing inequality is a fundamental property that describes the loss of information through noisy channels. A more refined description is given by the strong data processing inequality (SDPI) for a fixed channel and a full-rank reference state. In classical information theory, the strong data processing inequality tensorizes for a large family of fff-divergences. However, its quantum counterpart remains largely unexplored. Tensorization of SDPI has previously been shown only for some special cases, and whether it holds more generally for quantum divergences still remains open. In this work, we report two negative results: the tensorization property fails for certain quantum chi-square divergences, and it also does not hold for the quantum relative entropy.