Classical - Quantum Arbitrarily Varying Wiretap Channel: Common Randomness Assisted Code and Continuity
Holger Boche, Minglai Cai, Christian Deppe, Janis N\"otzel

TL;DR
This paper investigates the secrecy capacities of arbitrarily varying classical-quantum wiretap channels with common randomness, analyzing their continuity and the impact of resources on channel stability.
Contribution
It determines the secrecy capacities for these channels and explores conditions for their continuity, highlighting the role of resources in enhancing stability.
Findings
Secrecy capacities are characterized for common randomness assisted codes.
Continuity of secrecy capacity depends on system parameters.
Resources like perfect randomness improve channel stability.
Abstract
We determine the secrecy capacities under common randomness assisted coding of arbitrarily varying classical-quantum wiretap channels.Furthermore, we determine the secrecy capacity of a mixed channel model which is compound from the sender to the legal receiver and varies arbitrarily from the sender to the eavesdropper. As an application we examine when the secrecy capacity is a continuous function of the system parameters and show that resources, i.e., having access to a perfect copy of the outcome of a random experiment. are helpful for channel stability.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
