aiqbench analysis
This research establishes the classical Marton-type inner bound for transmitting two independent confidential messages over quantum broadcast channels, addressing secrecy even when a receiver knows its own message. The study derives a multi-letter capacity characterization and demonstrates scenarios where confidential classical communication rates exceed unassisted quantum transmission limits, such as in the Blackwell channel model. These findings advance the theoretical understanding of secure quantum information distribution under conditional strong secrecy constraints.
Quantum Broadcast Channels with Mutually Confidential Messages
arXiv:2609.26750v1 Announce Type: new Abstract: We study the transmission of two independent confidential classical messages over a quantum broadcast channel, one for each receiver. Each message must remain secret from the other receiver, including when that receiver knows its own message. For classical inputs and quantum outputs, we establish the classical Marton-type inner bound under average reliability and conditional strong secrecy. The encoder selects pairs of codewords from independently generated codebooks using normalized likelihood weights. We prove reliability through a change-of-distribution argument. Our main technical result is a bipartite classical-quantum resolvability theorem that accounts for the dependence created by pair selection and establishes secrecy for the same encoder. We also obtain a multi-letter capacity characterization and extend it to arbitrary quantum inputs under secrecy against the other receiver, together with the Stinespring environment. We recover confidential capacity regions for deterministic classical and degraded classical-quantum channels, with an explicit evaluation for the classical Blackwell channel. For coherent isometric extensions of injective deterministic classical broadcast channels, we show that the confidential classical capacity region equals that of the corresponding classical channel. We then compare confidential classical communication with quantum transmission. For the coherent isometric extension of the Blackwell channel, we determine the unassisted quantum-capacity region and show that some achievable confidential classical rate pairs lie outside it. The Platypus channel provides another example of this separation.
Abstract:We study the transmission of two independent confidential classical messages over a quantum broadcast channel, one for each receiver. Each message must remain secret from the other receiver, including when that receiver knows its own message. For classical inputs and quantum outputs, we establish the classical Marton-type inner bound under average reliability and conditional strong secrecy. The encoder selects pairs of codewords from independently generated codebooks using normalized likelihood weights. We prove reliability through a change-of-distribution argument. Our main technical result is a bipartite classical-quantum resolvability theorem that accounts for the dependence created by pair selection and establishes secrecy for the same encoder. We also obtain a multi-letter capacity characterization and extend it to arbitrary quantum inputs under secrecy against the other receiver, together with the Stinespring environment. We recover confidential capacity regions for deterministic classical and degraded classical-quantum channels, with an explicit evaluation for the classical Blackwell channel. For coherent isometric extensions of injective deterministic classical broadcast channels, we show that the confidential classical capacity region equals that of the corresponding classical channel. We then compare confidential classical communication with quantum transmission. For the coherent isometric extension of the Blackwell channel, we determine the unassisted quantum-capacity region and show that some achievable confidential classical rate pairs lie outside it. The Platypus channel provides another example of this separation.
Quantum Physics (quant-ph); Information Theory (cs.IT)
arXiv:2609.26750 [quant-ph]
(or arXiv:2609.26750v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2609.26750 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 · 316 words
Related coverage
A Solution to Cryptographic Boxes for Unfriendly AI
LessWrong · Jul 19, 2026

Lattice-Based Cryptography Explained
Quantum Zeitgeist · Aug 15, 2026

Researchers Bound Data Transfer by Quantum Channel Limits
Quantum Zeitgeist · Oct 6, 2026

strongSwan helps Cisco build a test for post-quantum IKEv2 security
Quantum Zeitgeist · Aug 25, 2026