Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This paper presents a rigorous mathematical proof that the Asymptotic Equipartition Property (AEP) fails for general quantum channels when formulated using smoothing over completely positive trace-preserving maps. The authors demonstrate an unbounded gap between channel and subchannel smoothing rates even for simple qubit systems, challenging previous conjectures about dimension-independent bounds. These findings are critical for theorists working on quantum information theory, as they redefine the fundamental limits of data compression and error correction in quantum communication protocols.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Failure of the Asymptotic Equipartition Property for Quantum Channels

arXiv2 min read

arXiv:2609.15004v1 Announce Type: new Abstract: We establish two results on the asymptotic equipartition property (AEP) for quantum channels. First, the AEP formulated using smoothing over completely positive trace-preserving maps fails in general. Second, the AEP with smoothing over subchannels (completely positive trace-nonincreasing maps) is equivalent to the strong converse for parallel quantum channel Stein's lemma, to a sharp threshold for the channel hockey-stick divergence, and to an AEP for the channel Lorenz divergence. The counterexample reveals a surprising separation between channel and subchannel smoothing. Although states and classical channels admit a sharp, dimension-independent completion bound, which we establish, the corresponding single-shot gap for quantum channels is unbounded already for qubits. This separation persists asymptotically: we construct qutrit channel pairs with finite max-relative entropy whose CPTP-smoothed rate strictly exceeds the regularized channel relative entropy. The asymptotic gap between channel and subchannel smoothing is unbounded across the family, even when the subchannel approximation error decays exponentially. To establish the equivalences, we develop a uniform filter that converts Lorenz smoothing into a single nearby subchannel. The four conjectured formulations thus share a common asymptotic threshold, whose validity for general channel pairs remains open. Together, these results separate this threshold question from the obstruction imposed by exact trace preservation.

Abstract:We establish two results on the asymptotic equipartition property (AEP) for quantum channels. First, the AEP formulated using smoothing over completely positive trace-preserving maps fails in general. Second, the AEP with smoothing over subchannels (completely positive trace-nonincreasing maps) is equivalent to the strong converse for parallel quantum channel Stein's lemma, to a sharp threshold for the channel hockey-stick divergence, and to an AEP for the channel Lorenz divergence. The counterexample reveals a surprising separation between channel and subchannel smoothing. Although states and classical channels admit a sharp, dimension-independent completion bound, which we establish, the corresponding single-shot gap for quantum channels is unbounded already for qubits. This separation persists asymptotically: we construct qutrit channel pairs with finite max-relative entropy whose CPTP-smoothed rate strictly exceeds the regularized channel relative entropy. The asymptotic gap between channel and subchannel smoothing is unbounded across the family, even when the subchannel approximation error decays exponentially. To establish the equivalences, we develop a uniform filter that converts Lorenz smoothing into a single nearby subchannel. The four conjectured formulations thus share a common asymptotic threshold, whose validity for general channel pairs remains open. Together, these results separate this threshold question from the obstruction imposed by exact trace preservation.

arXiv:2609.15004 [quant-ph]

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

https://doi.org/10.48550/arXiv.2609.15004 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.

Full text under the publisher's open licence · 291 words

Related coverage