One-Shot Point-to-Point Channel Simulation

Abstract

We study the problem of one-shot channel simulation of DMCs with unlimited shared randomness. For any fixed tolerance measured in total variational distance, we propose an achievability bound and a converse bound on the size of the code to simulate the channel. The achievability bound utilizes the convex split lemma, whereas the converse bound is the result of the relationships between smoothed max-divergences and the max-mutual information. The achievability proof does not rely on a "universal state" (compared with some previous related works), and provides a tighter bound. Using the two bounds, we also provide an alternative proof to the reverse Shannon theorem.