arXiv:2609.26750
Quantum Broadcast Channels with Mutually Confidential Messages
Paula Belzig, Sukanya Ghosal, Farzin Salek, Graeme Smith
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.
AI Summary
The paper studies two independent classical messages over a quantum broadcast channel, each confidential from the unintended receiver even given that receiver’s own message. For classical inputs and quantum outputs, it establishes the Marton-type inner bound $R_i<I(V_i;B_i|U)-I(V_1;V_2|U)-I(V_i;B_{3-i}|V_{3-i},U)$ under average-error reliability and conditional strong secrecy. Auxiliary alphabets can be restricted to $|U|\leq3$ and $|V_i|\leq|X|$. The encoder selects correlated codeword pairs from independently generated codebooks using normalized likelihood weights. Reliability follows by comparison with a planted distribution that preserves independence of competing codewords. Secrecy uses a bipartite cq resolvability theorem: comparison with two oriented posterior selectors reduces the dependent pair-selection problem to one-sided likelihood encoding and ordinary cq soft covering. Applying the coding theorem to blocks gives regularized capacity formulas, including for arbitrary quantum preparations with secrecy against the unintended receiver jointly with the Stinespring environment. A separate outer bound uses an unrestricted quantum auxiliary. Single-letter capacity regions are obtained for degraded cq channels and coherent isometric extensions of injective deterministic classical broadcast channels; the latter have the same confidential region as their classical counterparts. For the coherent Blackwell channel, the quantum-capacity region is $Q_1+Q_2\leq1$, whereas confidential classical communication achieves $(\log_2\varphi,\log_2\varphi)$, with sum approximately $1.388484$ bits/use. A multiletter coherent-information inequality proves the quantum converse. Platypus channels supply further separations using known marginal-capacity bounds. General single-letterization, finite-block bipartite resolvability, and the full Platypus capacity regions remain unresolved.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.