Tight Contraction Rates for Primitive Channels under Quantum $f$-Divergences
- URL: http://arxiv.org/abs/2605.06452v1
- Date: Thu, 07 May 2026 15:48:23 GMT
- Title: Tight Contraction Rates for Primitive Channels under Quantum $f$-Divergences
- Abstract summary: We show that quantum $f$-divergences satisfy a local reverse Pinsker inequality.<n>We apply these results to Petz, Matsumoto, and Hirche-Tomamichel $f$-divergences.
- Score: 10.960289997471085
- License: http://creativecommons.org/licenses/by/4.0/
- 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 $χ^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.
Related papers
- Tight Entropy Contraction of Generalized Quantum Depolarization [15.671504580092032]
We establish upper and lower bounds for relative entropy contraction of quantum depolarizing channels and semigroups.<n>One side estimate are based on sharp reverse ratio and convexity of relative entropy of two states.<n>Results extend to the complete entropy contraction rate, tensor stable estimates for product dynamics.
arXiv Detail & Related papers (2026-08-20T06:20:34Z) - Freeness Reined in by a Single Qubit [36.94429692322632]
We find that, even in this setting, the correlation functions predicted by free probability theory receive corrections of order $O(1)$.<n>We trace their origin to non-uniformly distributed stationary quantum states, which we characterize analytically and confirm numerically.
arXiv Detail & Related papers (2025-12-15T19:00:09Z) - Quantum $f$-divergences and Their Local Behaviour: An Analysis via Relative Expansion Coefficients [4.30484058393522]
We study contraction and expansion coefficients, which can be combined into a single emphrelative expansion coefficient<n>We identify new families of $f$ for which the global ($f$ divergence) and local (Riemannian) relative expansion coefficients coincide for every pair of channels.<n>We prove a reverse quantum Markov convergence theorem, converting positive expansion coefficients into quantitative lower bounds on the convergence rate.
arXiv Detail & Related papers (2025-10-07T17:44:37Z) - Quasi-optimal sampling from Gibbs states via non-commutative optimal transport metrics [1.5999407512883517]
We study the problem of sampling from and preparing quantum Gibbs states of local commuting Hamiltonians on hypercubic lattices of arbitrary dimension.<n>We prove that any such Gibbs state which satisfies a clustering condition that we coin decay of matrix-valued quantum conditional mutual information can be quasi-optimally prepared on a quantum computer.
arXiv Detail & Related papers (2024-12-02T17:25:24Z) - Quantum concentration inequalities and equivalence of the thermodynamical ensembles: an optimal mass transport approach [4.604003661048267]
We prove new concentration inequalities for quantum spin systems.<n>Our results do not require the spins to be arranged in a regular lattice.<n>We introduce a local W1 distance, which quantifies the distinguishability of two states with respect to local observables.
arXiv Detail & Related papers (2024-03-27T14:32:03Z) - Normal quantum channels and Markovian correlated two-qubit quantum
errors [77.34726150561087]
We study general normally'' distributed random unitary transformations.
On the one hand, a normal distribution induces a unital quantum channel.
On the other hand, the diffusive random walk defines a unital quantum process.
arXiv Detail & Related papers (2023-07-25T15:33:28Z) - PAPAL: A Provable PArticle-based Primal-Dual ALgorithm for Mixed Nash Equilibrium [58.26573117273626]
We consider the non-AL equilibrium nonconptotic objective function in two-player zero-sum continuous games.
Our novel insights into the particle-based algorithms for continuous distribution strategies are presented.
arXiv Detail & Related papers (2023-03-02T05:08:15Z) - Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees.
Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation.
We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
arXiv Detail & Related papers (2022-03-30T02:02:16Z) - Tight Exponential Analysis for Smoothing the Max-Relative Entropy and
for Quantum Privacy Amplification [56.61325554836984]
The max-relative entropy together with its smoothed version is a basic tool in quantum information theory.
We derive the exact exponent for the decay of the small modification of the quantum state in smoothing the max-relative entropy based on purified distance.
arXiv Detail & Related papers (2021-11-01T16:35:41Z) - Quantum concentration inequalities [12.56413718364189]
We establish transportation cost inequalities (TCI) with respect to the quantum Wasserstein distance.
We prove Gibbs states of commuting Hamiltonians on arbitrary hypergraphs $H=(V,E)$ satisfy a TCI with constant scaling as $O(|V|)$.
We argue that the temperature range for which the TCI holds can be enlarged by relating it to recently established modified logarithmic Sobolev inequalities.
arXiv Detail & Related papers (2021-06-30T05:44:12Z) - A Unified Joint Maximum Mean Discrepancy for Domain Adaptation [73.44809425486767]
This paper theoretically derives a unified form of JMMD that is easy to optimize.
From the revealed unified JMMD, we illustrate that JMMD degrades the feature-label dependence that benefits to classification.
We propose a novel MMD matrix to promote the dependence, and devise a novel label kernel that is robust to label distribution shift.
arXiv Detail & Related papers (2021-01-25T09:46:14Z) - Linear Last-iterate Convergence in Constrained Saddle-point Optimization [48.44657553192801]
We significantly expand the understanding of last-rate uniqueness for Optimistic Gradient Descent Ascent (OGDA) and Optimistic Multiplicative Weights Update (OMWU)
We show that when the equilibrium is unique, linear lastiterate convergence is achieved with a learning rate whose value is set to a universal constant.
We show that bilinear games over any polytope satisfy this condition and OGDA converges exponentially fast even without the unique equilibrium assumption.
arXiv Detail & Related papers (2020-06-16T20:53:04Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.