Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Symposium on Information Theory (ISIT)

One-Shot Point-to-Point Channel Simulation

Michael X. Cao, Navneeth Ramakrishnan, Mario Berta, Marco Tomamichel

Published Jun 26, 2022• 6 citations
Publisher

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.

DOI
10.1109/isit50566.2022.9834411

Related papers

Broadcast Channel Simulation

Michael X. Cao, Navneeth Ramakrishnan, Mario Berta +1 more

We study the problem of random-assisted simulation of discrete broadcast channel in one-shot and i.i.d. setups. We derive one-shot inner and outer bounds of the set of attainable message-size pairs for simulating WYZ|Xwithin some total variation distance (TVD) tolerance of ϵ. The inner bounds are based on the bipartite convex split lemma. Whereas the outer bounds are based on the properties of the multi-partite max information. Using these bounds, we establish a single-letter expression of the simulation region of a broadcast channel.

IEEE International Symposium on Information Theory (ISIT)•Jun 25, 2023•4 citations

Channel Simulation: Finite Blocklengths and Broadcast Channels

Michael X. Cao, Navneeth Ramakrishnan, Mario Berta +1 more

We study channel simulation under common randomness assistance in the finite-blocklength regime and identify the smooth channel max-information as a linear program one-shot converse on the minimal simulation cost for fixed error tolerance. We show that this one-shot converse can be achieved exactly using no-signaling-assisted codes, and approximately achieved using common randomness-assisted codes. Our one-shot converse thus takes on an analogous role to the celebrated meta-converse in the complementary problem of channel coding, and we find tight relations between these two bounds. We asymptotically expand our bounds on the simulation cost for discrete memoryless channels, leading to the second-order as well as the moderate-deviation rate expansion, which can be expressed in terms of the channel capacity and channel dispersion known from noisy channel coding. Our bounds imply the well-known fact that the optimal asymptotic rate of one channel to simulate another under common randomness assistance is given by the ratio of their respective capacities. Additionally, our higher-order asymptotic expansion shows that this reversibility falls apart in the second order. Our techniques extend to discrete memoryless broadcast channels. In stark contrast to the elusive broadcast channel capacity problem, we show that the reverse problem of broadcast channel simulation under common randomness assistance allows for an efficiently computable single-letter characterization of the asymptotic rate region in terms of the broadcast channel’s multipartite mutual information.

arXiv:2212.11666•IEEE Transactions on Information Theory•Aug 19, 2024•18 citations

One-shot Interference Channel Simulation

Aditya Nema, Michael X. Cao, Sreejith Sreekumar +1 more

We consider the problem of shared randomness-assisted simulation of interference channel in the one-shot setup. We derive almost-matching inner and outer bounds in terms of the partial smoothed max-divergence, with the help of auxiliary random variables. The achievability relies on a rejection-sampling algorithm to simulate two auxiliary broadcast channels between each sender and both receivers, and producing the final output based on the output of these intermediate channels, which can be thought of as gluing these auxiliary broadcast channels via multiple access channels (MACs), to preserve all the correlations between each sender-receiver pair induced by the channel. The converse follows via information-spectrum based arguments.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2026•0 citations

One-Shot Multiple Access Channel Simulation

Aditya Nema, Sreejith Sreekumar, Mario Berta

We consider the problem of simulating a two-sender multiple access channel (MAC) for fixed product inputs, where each sender transmits a message to the decoder over a rate-limited noiseless link based on its input and unlimited randomness shared with the decoder. As our main contribution, we characterize the one-shot communication cost region via almost-matching inner and outer bounds phrased in terms of the smooth max-information of the channel. The achievability relies on a rejection-sampling algorithm to simulate a quantization channel between each sender and decoder, and producing the final output based on the output of these intermediate channels. The converse follows via information-spectrum based arguments relating operational quantities to information measures. Our one-shot results recover the single-letter asymptotic rate region for MAC simulation with fixed, independent and identically distributed product inputs, that was obtained in [Kurri et al., IEEE Transactions on Information Theory 68, 7575 (2022)]. We extend our result to quantum-to-classical channels with a separable decomposition [Atif et al., IEEE Transactions on Information Theory 68, 1085 (2022)], for which we obtain a similar characterization.

IEEE International Symposium on Information Theory (ISIT)•Jul 7, 2024•5 citations

One-Shot Multiple Access Channel Simulation

Aditya Nema, Sreejith Sreekumar, Mario Berta

We consider the problem of shared randomness-assisted multiple access channel (MAC) simulation for product inputs and characterize the one-shot communication cost region via almost-matching inner and outer bounds in terms of the smooth max-information of the channel, featuring auxiliary random variables of bounded size. The achievability relies on a rejection-sampling algorithm to simulate an auxiliary channel between each sender and the decoder, and producing the final output based on the output of these intermediate channels. The converse follows via information-spectrum based arguments. To bound the cardinality of the auxiliary random variables, we employ the perturbation method from [Anantharamet al., IEEE Trans. Inf. Theory (2019)] in the one-shot setting. For the asymptotic setting and vanishing errors, our result expands to a tight single-letter rate characterization and consequently extends a special case of the simulation results of [Kurriet al., IEEE Trans. Inf. Theory (2022)] for fixed, independent and identically distributed (iid) product inputs to universal simulation for any product inputs. We broaden our discussion into the quantum realm by studying feedback simulation of quantum-to-classical (QC) MACs with product measurements [Atifet al., IEEE Trans. Inf. Theory (2022)]. For fixed product inputs and with shared randomness assistance, we give a quasi tight one-shot communication cost region with corresponding single-letter asymptotic iid expansion.

arXiv:2410.17198•IEEE Transactions on Information Theory•Jan 12, 2026•0 citations

Convex Split Lemma without Inequalities

Gilad Gour

We introduce a refinement to the convex split lemma by replacing the max mutual information with the collision mutual information, transforming the inequality into an equality. This refinement yields tighter achievability bounds for quantum source coding tasks, including state merging and state splitting. Furthermore, we derive a universal upper bound on the smoothed max mutual information, where "universal" signifies that the bound depends exclusively on Rényi entropies and is independent of the system's dimensions. This result has significant implications for quantum information processing, particularly in applications such as the reverse quantum Shannon theorem.

arXiv:2502.06526•Feb 10, 2025•5 citations
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.
We study the problem of random-assisted simulation of discrete broadcast channel in one-shot and i.i.d. setups. We derive one-shot inner and outer bounds of the set of attainable message-size pairs for simulating WYZ|Xwithin some total variation distance (TVD) tolerance of ϵ. The inner bounds are based on the bipartite convex split lemma. Whereas the outer bounds are based on the properties of the multi-partite max information. Using these bounds, we establish a single-letter expression of the simulation region of a broadcast channel.
We study channel simulation under common randomness assistance in the finite-blocklength regime and identify the smooth channel max-information as a linear program one-shot converse on the minimal simulation cost for fixed error tolerance. We show that this one-shot converse can be achieved exactly using no-signaling-assisted codes, and approximately achieved using common randomness-assisted codes. Our one-shot converse thus takes on an analogous role to the celebrated meta-converse in the complementary problem of channel coding, and we find tight relations between these two bounds. We asymptotically expand our bounds on the simulation cost for discrete memoryless channels, leading to the second-order as well as the moderate-deviation rate expansion, which can be expressed in terms of the channel capacity and channel dispersion known from noisy channel coding. Our bounds imply the well-known fact that the optimal asymptotic rate of one channel to simulate another under common randomness assistance is given by the ratio of their respective capacities. Additionally, our higher-order asymptotic expansion shows that this reversibility falls apart in the second order. Our techniques extend to discrete memoryless broadcast channels. In stark contrast to the elusive broadcast channel capacity problem, we show that the reverse problem of broadcast channel simulation under common randomness assistance allows for an efficiently computable single-letter characterization of the asymptotic rate region in terms of the broadcast channel’s multipartite mutual information.
We consider the problem of shared randomness-assisted simulation of interference channel in the one-shot setup. We derive almost-matching inner and outer bounds in terms of the partial smoothed max-divergence, with the help of auxiliary random variables. The achievability relies on a rejection-sampling algorithm to simulate two auxiliary broadcast channels between each sender and both receivers, and producing the final output based on the output of these intermediate channels, which can be thought of as gluing these auxiliary broadcast channels via multiple access channels (MACs), to preserve all the correlations between each sender-receiver pair induced by the channel. The converse follows via information-spectrum based arguments.
We consider the problem of simulating a two-sender multiple access channel (MAC) for fixed product inputs, where each sender transmits a message to the decoder over a rate-limited noiseless link based on its input and unlimited randomness shared with the decoder. As our main contribution, we characterize the one-shot communication cost region via almost-matching inner and outer bounds phrased in terms of the smooth max-information of the channel. The achievability relies on a rejection-sampling algorithm to simulate a quantization channel between each sender and decoder, and producing the final output based on the output of these intermediate channels. The converse follows via information-spectrum based arguments relating operational quantities to information measures. Our one-shot results recover the single-letter asymptotic rate region for MAC simulation with fixed, independent and identically distributed product inputs, that was obtained in [Kurri et al., IEEE Transactions on Information Theory 68, 7575 (2022)]. We extend our result to quantum-to-classical channels with a separable decomposition [Atif et al., IEEE Transactions on Information Theory 68, 1085 (2022)], for which we obtain a similar characterization.
We consider the problem of shared randomness-assisted multiple access channel (MAC) simulation for product inputs and characterize the one-shot communication cost region via almost-matching inner and outer bounds in terms of the smooth max-information of the channel, featuring auxiliary random variables of bounded size. The achievability relies on a rejection-sampling algorithm to simulate an auxiliary channel between each sender and the decoder, and producing the final output based on the output of these intermediate channels. The converse follows via information-spectrum based arguments. To bound the cardinality of the auxiliary random variables, we employ the perturbation method from [Anantharamet al., IEEE Trans. Inf. Theory (2019)] in the one-shot setting. For the asymptotic setting and vanishing errors, our result expands to a tight single-letter rate characterization and consequently extends a special case of the simulation results of [Kurriet al., IEEE Trans. Inf. Theory (2022)] for fixed, independent and identically distributed (iid) product inputs to universal simulation for any product inputs. We broaden our discussion into the quantum realm by studying feedback simulation of quantum-to-classical (QC) MACs with product measurements [Atifet al., IEEE Trans. Inf. Theory (2022)]. For fixed product inputs and with shared randomness assistance, we give a quasi tight one-shot communication cost region with corresponding single-letter asymptotic iid expansion.
We introduce a refinement to the convex split lemma by replacing the max mutual information with the collision mutual information, transforming the inequality into an equality. This refinement yields tighter achievability bounds for quantum source coding tasks, including state merging and state splitting. Furthermore, we derive a universal upper bound on the smoothed max mutual information, where "universal" signifies that the bound depends exclusively on Rényi entropies and is independent of the system's dimensions. This result has significant implications for quantum information processing, particularly in applications such as the reverse quantum Shannon theorem.