Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchCalcul cuantic

analiza aiqbench

This paper is theoretical quantum information science: it tightens the quantum data processing inequality for maximal f-divergences by recasting open-system (Lindblad) dynamics as a classical stochastic unraveling. Its value for quantum readers is in the bounds it gives on how fast distinguishability decays, which matter for analyzing noisy quantum channels and memory. The results are mathematical and do not yet translate into a hardware or algorithmic claim.
Surse care acoperăarXiv, LessWrong
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

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

arXiv2 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2511.22976v2 Announce Type: replace 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.

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.

arXiv:2511.22976 [quant-ph]

(or arXiv:2511.22976v2 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2511.22976 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Text integral sub licența deschisă a publicației · 263 cuvinte

Subiecte conexe