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 aiqbenchAI + Cuantic

analiza aiqbench

This paper establishes the sharp uniform continuity bound for quantum conditional entropy, refining theoretical limits on how state perturbations affect information measures in bipartite systems. The research notably leverages ChatGPT 5.6 Sol to develop key proof ideas that adapt and improve upon existing classical methodologies from IEEE ISIT (2020).
Surse care acoperăarXiv, AI Alignment Forum, Quantum Zeitgeist, Quantum Computing Report
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Sharp continuity of quantum conditional entropy

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

arXiv:2607.24687v1 Announce Type: new Abstract: We prove the sharp uniform continuity bound for quantum conditional entropy. If two bipartite states are at trace distance at most $\delta$ and $d=\dim A$, the optimal dimension-only modulus of continuity is $h_2(\delta)+\delta\log(d^2-1)$ up to $\delta=1-d^{-2}$ and $2\log d$ thereafter, where $h_2$ denotes the binary entropy. When $\dim B\ge d$, this bound is tight for every $\delta\in[0,1]$. The key proof idea was developed with the assistance of ChatGPT 5.6 Sol, building on and adapting the tight classical proof of Alhejji \& Smith [IEEE ISIT (2020)], which follows a conceptually different approach.

Abstract:We prove the sharp uniform continuity bound for quantum conditional entropy. If two bipartite states are at trace distance at most $\delta$ and $d=\dim A$, the optimal dimension-only modulus of continuity is $h_2(\delta)+\delta\log(d^2-1)$ up to $\delta=1-d^{-2}$ and $2\log d$ thereafter, where $h_2$ denotes the binary entropy. When $\dim B\ge d$, this bound is tight for every $\delta\in[0,1]$. The key proof idea was developed with the assistance of ChatGPT 5.6 Sol, building on and adapting the tight classical proof of Alhejji \& Smith [IEEE ISIT (2020)], which follows a conceptually different approach.

arXiv:2607.24687 [quant-ph]

(or arXiv:2607.24687v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2607.24687 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

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 · 182 cuvinte

Subiecte conexe