Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This paper establishes a rigorous strong converse for the unconstrained quantum capacity of the pure-loss bosonic channel, proving that entanglement fidelity degrades rapidly above the capacity threshold without energy constraints. The proof leverages novel techniques combining quantum Chebyshev inequalities with relative-entropy-variance bounds derived from dark mode analysis of beam splitters. These results refine fundamental limits on reliable quantum communication over optical channels, offering critical theoretical benchmarks for future quantum network architectures.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Strong converse for the quantum capacity of the pure-loss bosonic channel

arXiv2 min read

arXiv:2609.16608v1 Announce Type: new Abstract: This paper reports the proof of a strong converse for the unconstrained quantum capacity of the pure-loss bosonic channel. At every fixed rate above capacity, the entanglement-generation fidelity of every code is bounded by a constant times the reciprocal of the number of channel uses. The bound holds without an energy constraint and for arbitrary encoded states, including states correlated across all input modes, and arbitrary joint decoders. The proof combines quantum Chebyshev and hockey-stick testing inequalities with a uniform relative-entropy-variance bound for the balanced pure-loss channel, corresponding to transmissivity $\eta=1/2$. The variance bound follows by expressing the balanced beam splitter in bright and dark modes: the dark modes are exactly in vacuum, and any state orthogonal to that vacuum contains at least one dark photon. For general transmissivity, dilating the degrading attenuator reduces the problem to this balanced-channel setting and bounds the decoder test by precisely the factor that produces the known quantum-capacity threshold. The resulting argument establishes the strong converse at the unconstrained quantum capacity for every pure-loss bosonic channel.

Abstract:This paper reports the proof of a strong converse for the unconstrained quantum capacity of the pure-loss bosonic channel. At every fixed rate above capacity, the entanglement-generation fidelity of every code is bounded by a constant times the reciprocal of the number of channel uses. The bound holds without an energy constraint and for arbitrary encoded states, including states correlated across all input modes, and arbitrary joint decoders. The proof combines quantum Chebyshev and hockey-stick testing inequalities with a uniform relative-entropy-variance bound for the balanced pure-loss channel, corresponding to transmissivity $\eta=1/2$. The variance bound follows by expressing the balanced beam splitter in bright and dark modes: the dark modes are exactly in vacuum, and any state orthogonal to that vacuum contains at least one dark photon. For general transmissivity, dilating the degrading attenuator reduces the problem to this balanced-channel setting and bounds the decoder test by precisely the factor that produces the known quantum-capacity threshold. The resulting argument establishes the strong converse at the unconstrained quantum capacity for every pure-loss bosonic channel.

Quantum Physics (quant-ph); Information Theory (cs.IT)

arXiv:2609.16608 [quant-ph]

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

https://doi.org/10.48550/arXiv.2609.16608 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 · 269 words

Related coverage