Message Transmission Over Classical Quantum Channels With a Jammer With Side Information: Message Transmission Capacity and Resources

In this paper, a new model for arbitrarily varying classical-quantum channels is proposed. In this model, a jammer has side information. The communication scenario in which a jammer can select only classical inputs as a jamming sequence is considered in the first part of the paper. This situation corresponds to the standard model of arbitrarily varying classical-quantum channels. Two scenarios are considered. In the first scenario, the jammer knows the channel input, while in the second scenario the jammer knows both the channel input and the message. The transmitter and receiver share a secret random key with a vanishing key rate. The capacity for both average and maximum error criteria for both scenarios is determined in this paper. A strong converse is also proved. It is shown that all these corresponding capacities are equal, which means that additionally revealing the message to the jammer does not change the capacity. The communication scenario with a fully quantum jammer is considered in the second part of the paper. A single letter characterization for the capacity with secret random key as assistance for both average and maximum error criteria is derived in the paper.

[1]  Alex J. Grant,et al.  The arbitrarily varying channel when the jammer knows the channel input , 2010, 2010 IEEE International Symposium on Information Theory.

[2]  Rudolf Ahlswede.  The maximal error capacity of arbitrarily varying channels for constant list sizes , 1993, IEEE Trans. Inf. Theory.

[3]  Rudolf Ahlswede,et al.  Classical Capacity of Classical-Quantum Arbitrarily Varying Channels , 2007, IEEE Transactions on Information Theory.

[4]  Masahito Hayashi,et al.  General formulas for capacity of classical-quantum channels , 2003, IEEE Transactions on Information Theory.

[5]  J. Wolfowitz,et al.  The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabet , 1970 .

[6]  Matthias Christandl,et al.  Postselection technique for quantum channels with applications to quantum cryptography. , 2008, Physical review letters.

[7]  Holger Boche,et al.  Classical-quantum arbitrarily varying wiretap channel: Secret message transmission under jamming attacks , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[8]  M. Hayashi,et al.  Universal Coding for Classical-Quantum Channel , 2008, 0805.4092.

[9]  Claude E. Shannon,et al.  The zero error capacity of a noisy channel , 1956, IRE Trans. Inf. Theory.

[10]  Dong Yang,et al.  Quantum Channel Capacities With Passive Environment Assistance , 2014, IEEE Transactions on Information Theory.

[11]  R. Ahlswede.  Elimination of correlation in random codes for arbitrarily varying channels , 1978 .

[12]  R. Ahlswede.  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 , 1970 .

[13]  Holger Boche,et al.  Classical Capacities of Averaged and Compound Quantum Channels , 2007, ArXiv.

[14]  Ning Cai,et al.  Localized Error Correction in Projective Space , 2013, IEEE Transactions on Information Theory.

[15]  Christian Deppe,et al.  Information Theory, Combinatorics, and Search Theory: in memory of Rudolf Ahlswede , 2013 .

[16]  Holger Boche,et al.  Message Transmission over Classical Quantum Channels with a Jammer with Side Information , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[17]  Rudolf Ahlswede,et al.  Quantum Capacity under Adversarial Quantum Noise: Arbitrarily Varying Quantum Channels , 2010, ArXiv.

[18]  Holger Boche,et al.  Classical-quantum arbitrarily varying wiretap channel: Common randomness assisted code and continuity , 2016, ISIT.

[19]  Imre Csiszár,et al.  The capacity of the arbitrarily varying channel revisited: Positivity, constraints , 1988, IEEE Trans. Inf. Theory.

[20]  Holger Boche,et al.  Fully Quantum Arbitrarily Varying Channels: Random Coding Capacity and Capacity Dichotomy , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[21]  Holger Boche,et al.  Arbitrarily small amounts of correlation for arbitrarily varying quantum channels , 2013, 2013 IEEE International Symposium on Information Theory.

[22]  Mark M. Wilde,et al.  Quantum Information Theory , 2013 .

[23]  Moritz Wiese,et al.  A Channel Under Simultaneous Jamming and Eavesdropping Attack—Correlated Random Coding Capacities Under Strong Secrecy Criteria , 2014, IEEE Transactions on Information Theory.

[24]  Anand D. Sarwate,et al.  Robust and adaptive communication under uncertain interference , 2008 .

[25]  Andreas J. Winter,et al.  Coding theorem and strong converse for quantum channels , 1999, IEEE Trans. Inf. Theory.

[26]  Dong Yang,et al.  Classical capacities of quantum channels with environment assistance , 2016, Problems of Information Transmission.

[27]  Michael D. Westmoreland,et al.  Sending classical information via noisy quantum channels , 1997 .

[28]  Holger Boche,et al.  Positivity, discontinuity, finite resources, nonzero error for arbitrarily varying quantum channels , 2014, 2014 IEEE International Symposium on Information Theory.

[29]  Alexander S. Holevo,et al.  The Capacity of the Quantum Channel with General Signal States , 1996, IEEE Trans. Inf. Theory.

[30]  Holger Boche,et al.  Capacity Results for Arbitrarily Varying Wiretap Channels , 2012, Information Theory, Combinatorics, and Search Theory.

[31]  Thomas H. E. Ericson,et al.  Exponential error bounds for random codes in the arbitrarily varying channel , 1985, IEEE Trans. Inf. Theory.

[32]  Rudolf Ahlswede,et al.  Common Randomness in Information Theory and Cryptography - Part II: CR Capacity , 1998, IEEE Trans. Inf. Theory.

[33]  Martin Mathieu.  COMPLETELY BOUNDED MAPS AND OPERATOR ALGEBRAS (Cambridge Studies in Advanced Mathematics 78) , 2004 .

[34]  D. Blackwell,et al.  The Capacities of Certain Channel Classes Under Random Coding , 1960 .

[35]  Holger Boche,et al.  Arbitrarily Varying and Compound Classical-Quantum Channels and a Note on Quantum Zero-Error Capacities , 2012, Information Theory, Combinatorics, and Search Theory.

[36]  Moritz Wiese,et al.  The Arbitrarily Varying Wiretap Channel - deterministic and correlated random coding capacities under the strong secrecy criterion , 2014, ArXiv.

[37]  Holger Boche,et al.  Classical Capacities of Compound and Averaged Quantum Channels , 2007, IEEE Transactions on Information Theory.

[38]  Schumacher,et al.  Quantum data processing and error correction. , 1996, Physical review. A, Atomic, molecular, and optical physics.