Positivity, discontinuity, finite resources, nonzero error for arbitrarily varying quantum channels

We give an explicit example that answers the question whether the transmission of messages over arbitrarily varying quantum channels can benefit from distribution of randomness between the legitimate sender and receiver in the affirmative. The specific class of channels introduced in that example is then extended to show that the deterministic capacity does have discontinuity points, while that behaviour is, at the same time, not generic: We show that it is in fact continuous around its positivity points. This is in stark contrast to the randomness-assisted capacity, which is continuous in the channel. We then quantify the interplay between the distribution of finite amounts of randomness between the legitimate sender and receiver, the (nonzero) decoding error with respect to the average error criterion that can be achieved over a finite number of channel uses and the number of messages that can be sent. These results also apply to entanglement and strong subspace transmission.

[1]  Holger Boche,et al.  Classical–quantum arbitrarily varying wiretap channel: Ahlswede dichotomy, positivity, resources, super-activation , 2013, Quantum Inf. Process..

[2]  Holger Boche,et al.  Classical-quantum arbitrarily varying wiretap channel—A capacity formula with Ahlswede Dichotomy—Resources , 2013, 2014 IEEE International Symposium on Information Theory.

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

[4]  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.

[5]  Moritz Wiese,et al.  Strong Secrecy for Multiple Access Channels , 2012, Information Theory, Combinatorics, and Search Theory.

[6]  Holger Boche,et al.  Secrecy results for compound wiretap channels , 2011, Probl. Inf. Transm..

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

[8]  Simone Severini,et al.  Zero-Error Communication via Quantum Channels, Noncommutative Graphs, and a Quantum Lovász Number , 2010, IEEE Transactions on Information Theory.

[9]  Holger Boche,et al.  Erratum to: Entanglement Transmission and Generation under Channel Uncertainty: Universal Quantum Channel Coding , 2009 .

[10]  I. Bjelakovic,et al.  Entanglement Transmission and Generation under Channel Uncertainty: Universal Quantum Channel Coding , 2008, 0811.4588.

[11]  D. Leung,et al.  Continuity of Quantum Channel Capacities , 2008, 0810.4931.

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

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

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

[15]  I. Devetak.  The private classical capacity and quantum capacity of a quantum channel , 2003, IEEE Transactions on Information Theory.

[16]  M. Ruskai,et al.  Entanglement Breaking Channels , 2003, quant-ph/0302031.

[17]  R. Werner,et al.  How to Correct Small Quantum Errors , 2002, quant-ph/0206086.

[18]  Mikhail N. Vyalyi,et al.  Classical and Quantum Computation , 2002, Graduate studies in mathematics.

[19]  M. Horodecki,et al.  General teleportation channel, singlet fraction and quasi-distillation , 1998, quant-ph/9807091.

[20]  H. Barnum,et al.  QUANTUM CAPACITY IS PROPERLY DEFINED WITHOUT ENCODINGS , 1997, quant-ph/9711032.

[21]  Rudolf Ahlswede,et al.  Correlated sources help transmission over an arbitrarily varying channel , 1997, IEEE Trans. Inf. Theory.

[22]  Schumacher,et al.  Sending entanglement through noisy quantum channels. , 1996, Physical review. A, Atomic, molecular, and optical physics.

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

[24]  R. Ahlswede.  Arbitrarily varying channels with states sequence known to the sender , 1986, IEEE Trans. Inf. Theory.

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

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

[27]  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 .

[28]  Jacob Wolfowitz,et al.  Channels with Arbitrarily Varying Channel Probability Functions , 1962, Inf. Control..

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

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

[31]  Janis Noetzel,et al.  Quantum communication under channel uncertainty , 2012 .

[32]  Simone Severini,et al.  Zero-error communication via quantum channels, non-commutative graphs and a quantum Lovasz theta function , 2010, ArXiv.

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

[34]  Rudolf Ahlswede,et al.  Coloring hypergraphs: A new approach to multi-user source coding, 1 , 1979 .

[35]  Rudolf Ahlswede,et al.  The structure of capacity functions for compound channels , 1969 .

[36]  W. Rudin.  Principles of mathematical analysis , 1964 .