Duality between source coding with quantum side information and c-q channel coding

In this paper, we establish an interesting duality between two different quantum information-processing tasks, namely, classical source coding with quantum side information, and channel coding over classical-quantum channels. The duality relates the optimal error exponents of these two tasks, generalizing the classical results of Ahlswede and Dueck. We establish duality both at the operational level and at the level of the entropic quantities characterizing these exponents. For the latter, the duality is given by an exact relation, whereas for the former, duality manifests itself in the following sense: an optimal coding strategy for one task can be used to construct an optimal coding strategy for the other task. Along the way, we derive a bound on the error exponent for classical-quantum channel coding with constant composition codes which might be of independent interest.

[1]  M. Nussbaum,et al.  Asymptotic Error Rates in Quantum Hypothesis Testing , 2007, Communications in Mathematical Physics.

[2]  Robert G. Gallager,et al.  A simple derivation of the coding theorem and some applications , 1965, IEEE Trans. Inf. Theory.

[3]  Nilanjana Datta,et al.  Non-Asymptotic Classical Data Compression With Quantum Side Information , 2018, IEEE Transactions on Information Theory.

[4]  Imre Csiszár,et al.  Towards a general theory of source networks , 1980, IEEE Trans. Inf. Theory.

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

[6]  Elwyn R. Berlekamp,et al.  Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. II , 1967, Inf. Control..

[7]  K. Audenaert,et al.  Discriminating States: the quantum Chernoff bound. , 2006, Physical review letters.

[8]  Sergio Verdú,et al.  Operational Duality Between Lossy Compression and Channel Coding , 2009, IEEE Transactions on Information Theory.

[9]  Aaron D. Wyner,et al.  Coding Theorems for a Discrete Source With a Fidelity CriterionInstitute of Radio Engineers, International Convention Record, vol. 7, 1959. , 1993 .

[10]  Mark M. Wilde,et al.  Strong Converse for the Classical Capacity of Entanglement-Breaking and Hadamard Channels via a Sandwiched Rényi Relative Entropy , 2013, Communications in Mathematical Physics.

[11]  Imre Csiszár.  Linear codes for sources and source networks: Error exponents, universal coding , 1982, IEEE Trans. Inf. Theory.

[12]  A. Winter.  Compression of sources of probability distributions and density operators , 2002, quant-ph/0208131.

[13]  Kannan Ramchandran,et al.  Duality between source coding and channel coding and its extension to the side information case , 2003, IEEE Trans. Inf. Theory.

[14]  Sergio Verdú,et al.  Simulation of random processes and rate-distortion theory , 1996, IEEE Trans. Inf. Theory.

[15]  Sergio Verdú,et al.  Channel simulation and coding with side information , 1994, IEEE Trans. Inf. Theory.

[16]  Marco Tomamichel,et al.  Quantum Sphere-Packing Bounds With Polynomial Prefactors , 2017, IEEE Transactions on Information Theory.

[17]  D. Petz.  Quasi-entropies for finite quantum systems , 1986 .

[18]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[19]  Imre Csiszár,et al.  Graph decomposition: A new key to coding theorems , 1981, IEEE Trans. Inf. Theory.

[20]  Rudolf Ahlswede,et al.  Good codes can be produced by a few permutations , 1982, IEEE Trans. Inf. Theory.

[21]  Jun Chen,et al.  On the Linear Codebook-Level Duality Between Slepian–Wolf Coding and Channel Coding , 2009, IEEE Transactions on Information Theory.

[22]  Richard E. Blahut,et al.  Computation of channel capacity and rate-distortion functions , 1972, IEEE Trans. Inf. Theory.

[23]  Milán Mosonyi,et al.  Strong Converse Exponent for Classical-Quantum Channel Coding , 2014, Communications in Mathematical Physics.

[24]  Joseph M. Renes,et al.  Duality of privacy amplification against quantum adversaries and data compression with quantum side information , 2010, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[25]  N. Sloane,et al.  Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. I , 1993 .

[26]  Serge Fehr,et al.  On quantum Rényi entropies: A new generalization and some properties , 2013, 1306.3142.

[27]  Marco Dalai,et al.  Constant Compositions in the Sphere Packing Bound for Classical-Quantum Channels , 2014, IEEE Transactions on Information Theory.

[28]  Masahito Hayashi.  Error exponent in asymmetric quantum hypothesis testing and its application to classical-quantum channel coding , 2006, quant-ph/0611013.

[29]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[30]  Joseph M. Renes,et al.  One-Shot Lossy Quantum Data Compression , 2013, IEEE Transactions on Information Theory.

[31]  Igor Devetak,et al.  Channel Simulation With Quantum Side Information , 2009, IEEE Transactions on Information Theory.

[32]  Kannan Ramchandran,et al.  On functional duality in multiuser source and channel coding problems with one-sided collaboration , 2006, IEEE Transactions on Information Theory.

[33]  K Fan,et al.  Minimax Theorems. , 1953, Proceedings of the National Academy of Sciences of the United States of America.

[34]  Mark M. Wilde,et al.  Quantum Rate Distortion, Reverse Shannon Theorems, and Source-Channel Separation , 2011, IEEE Transactions on Information Theory.

[35]  R. Gallager.  Information Theory and Reliable Communication , 1968 .

[36]  Peter Harremoës,et al.  Rényi Divergence and Kullback-Leibler Divergence , 2012, IEEE Transactions on Information Theory.

[37]  O. F. Cook.  The Method of Types , 1898 .

[38]  Pramod Viswanath,et al.  Fixed binning schemes: an operational duality between channel and source coding problems with side information , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[39]  Mung Chiang,et al.  Duality between channel capacity and rate distortion with two-sided state information , 2002, IEEE Trans. Inf. Theory.

[40]  Suguru Arimoto,et al.  An algorithm for computing the capacity of arbitrary discrete memoryless channels , 1972, IEEE Trans. Inf. Theory.

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