Message transmission over classical quantum channels with a jammer with side information: correlation as resource, common randomness generation

DOI10.1063/1.5092179MaRDI QIDQ5136157zbMATH OpenOpenAlexFDO

Authors Holger Boche, Minglai Cai, Ning Cai

Publication date 25 November 2020

Published in Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1902.01764

Mathematics Subject Classification ID

Measures of association (correlation, canonical correlation, etc.) (62H20) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Channel models (including quantum) in information and communication theory (94A40) Quantum channels, fidelity (81P47)

Abstract: In this paper we analyze the capacity of a general model for arbitrarily varying classical-quantum channels (AVCQCs) when the sender and the receiver use correlation as a resource. In this general model, a jammer has side information about the channel input. We determine a single letter formula for the correlation assisted capacity. As an application of our main result, we determine the correlation assisted common randomness generation capacity. In this scenario the two channel users have access to correlation as a resource,and further use an AVCQC with an informed jammer for additional discussion. The goal is to create common randomness between the two channel users. We also analyze these capacity formulas when only a small number of signals from the correlation are available. For the correlation assisted common randomness generation capacity, we show an additional interesting property: For a sufficient amount of "public communication", common randomness generation capacity is Turing computable, however without this public communication constraint, the correlation assisted common randomness generation capacity is, in general, not Turing computable. Furthermore, we show that even without knowing the capacity formula of the deterministic capacity using maximal error criterion, we can show that it is impossible to evaluate the performance algorithmically on any current or future digital computer.

Recommendations

• Arbitrarily small amounts of correlation for arbitrarily varying quantum channels
• Correlated sources help transmission over an arbitrarily varying channel
• Common randomness in information theory and cryptography. II. CR capacity
• Classical-quantum arbitrarily varying wiretap channel: common randomness assisted code and continuity
• Positivity, discontinuity, finite resources, and nonzero error for arbitrarily varying quantum channels

Cites work

• scientific article; zbMATH DE number 3702545 (Why is no real title available?)
• A Note on the Existence of the Weak Capacity for Channels with Arbitrarily Varying Channel Probability Functions and Its Relation to Shannon's Zero Error Capacity
• Arbitrarily small amounts of correlation for arbitrarily varying quantum channels
• Arbitrarily varying and compound classical-quantum channels and a note on quantum zero-error capacities
• Arbitrarily varying channels with states sequence known to the sender
• Channels with arbitrarily varying channel probability functions
• Classical Capacity of Classical-Quantum Arbitrarily Varying Channels
• Classical-quantum arbitrarily varying wiretap channel: Ahlswede dichotomy, positivity, resources, super-activation
• Classical-quantum arbitrarily varying wiretap channel: common randomness assisted code and continuity
• Classical-quantum arbitrarily varying wiretap channel: secret message transmission under jamming attacks
• Common randomness in information theory and cryptography. II. CR capacity
• Correlated sources help transmission over an arbitrarily varying channel
• Elimination of correlation in random codes for arbitrarily varying channels
• Message Transmission Over Classical Quantum Channels With a Jammer With Side Information: Message Transmission Capacity and Resources
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On Sequences of Pairs of Dependent Random Variables
• On the Algorithmic Computability of the Secret Key and Authentication Capacity Under Channel, Storage, and Privacy Leakage Constraints
• Quantum capacity under adversarial quantum noise: arbitrarily varying quantum channels
• The Capacities of Certain Channel Classes Under Random Coding
• The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabet
• The capacity of the arbitrarily varying channel revisited: positivity, constraints
• The capacity of the quantum channel with general signal states

Cited in

(4)

• Quantum enhancement of randomness distribution
• Arbitrarily small amounts of correlation for arbitrarily varying quantum channels
• The classical-quantum channel with random state parameters known to the sender
• Classical-quantum arbitrarily varying wiretap channel: common randomness assisted code and continuity

This page was built for publication: Message transmission over classical quantum channels with a jammer with side information: correlation as resource, common randomness generation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136157)