aiqbench analysis
This paper establishes a rigorous exponential strong converse for quantum communication, proving that fidelity decays exponentially whenever transmission rates exceed the channel's quantum capacity. The authors achieve this through a novel fully quantum blowing-up lemma and a low-degree polynomial construction that approximates tensor powers of projectors with controlled norms. These theoretical advances refine the fundamental limits of reliable entanglement transmission across finite-dimensional memoryless channels.
Strong Converse for Quantum Capacity via a Fully Quantum Blowing-Up Lemma
arXiv:2609.11771v1 Announce Type: new Abstract: We prove an exponential strong converse for quantum communication through every finite-dimensional memoryless channel: at any fixed rate above the quantum capacity, the entanglement-transmission fidelity of every code decays exponentially with the number of channel uses. The proof has two main ingredients. First, a fully quantum blowing-up lemma converts a low-fidelity code into a high-fidelity code, with a loss in the number of transmitted qubits controlled by the projective tensor norm of the orthogonal projection on the image of the Stinespring dilation of the channel across the receiver--environment bipartition. Second, a low-degree polynomial construction approximates the tensor power of this projector with exponential accuracy while controlling its projective norm, providing the approximation needed for the blowing-up argument.
Abstract:We prove an exponential strong converse for quantum communication through every finite-dimensional memoryless channel: at any fixed rate above the quantum capacity, the entanglement-transmission fidelity of every code decays exponentially with the number of channel uses. The proof has two main ingredients. First, a fully quantum blowing-up lemma converts a low-fidelity code into a high-fidelity code, with a loss in the number of transmitted qubits controlled by the projective tensor norm of the orthogonal projection on the image of the Stinespring dilation of the channel across the receiver--environment bipartition. Second, a low-degree polynomial construction approximates the tensor power of this projector with exponential accuracy while controlling its projective norm, providing the approximation needed for the blowing-up argument.
arXiv:2609.11771 [quant-ph]
(or arXiv:2609.11771v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2609.11771 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 · 208 words
Related coverage
A strong converse for stabilizer codes over Pauli channels via the blowing-up lemma
arXiv · Jul 28, 2026
Synthesis Superintelligence: from Semiconductors to Superconductors — Periodic Labs’ Liam Fedus and Ekin Dogus Cubuk
Latent Space · Oct 8, 2026
[AINews] High Taste Testers Ep. 1
Latent Space · Oct 17, 2026

Netskope (NTSK) Q2 2027 Earnings Call Transcript
fool.com · Sep 10, 2026