Exponents for Shared Randomness-Assisted Channel Simulation

IEEE International Symposium on Information Theory (ISIT), pp. 1–6

Abstract

We determine the exact error and strong converse exponents of shared randomness-assisted channel simulation in worst case total-variation distance. Namely, we find that these exponents can be written as simple optimizations over the Rényi channel mutual information. Strikingly, and in stark contrast to channel coding, there are no critical rates, allowing a tight characterization for arbitrary rates below and above the simulation capacity.

Authors 4

1. Aadil Oufkir Aachen Institute for Quantum Information

   RWTH Aachen University

   Affiliation as printed

   Institute for Quantum Information, RWTH Aachen University,Aachen,Germany

2. Michael X. Cao Aachen Institute for Quantum Information

   RWTH Aachen University

   Affiliation as printed

   Institute for Quantum Information, RWTH Aachen University,Aachen,Germany

3. Hao–Chung Cheng

   National Taiwan University

   Affiliation as printed

   National Taiwan University,Department of Electrical Engineering,Taipei,Taiwan

4. Mario Berta Aachen Institute for Quantum Information

   RWTH Aachen University

   Affiliation as printed

   Institute for Quantum Information, RWTH Aachen University,Aachen,Germany