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 Access

Common-Randomness-Aware One-Shot Multiple Access Channel Simulation via Smooth Max-Wyner Common Information

Degala Chenchupradeep

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.1109/access.2026.3753769

Related papers

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

Joint Multiple-Access and Channel Intrinsic Randomness

友彦 植松, Tomohiko Uyematsu, 哲直 松田 +1 more

•Oct 1, 2019•0 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

Uniform Common Randomness Generation Over Arbitrary Point-to-Point Channels

Rami Ezzine, Moritz Wiese, Christian Deppe +1 more

IEEE Transactions on Information Theory•Apr 30, 2025•1 citation

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

On Oblivious Transfer Capacity of Noisy Multiple Access Channel

Hadi Aghaee, Christian Deppe

IEEE International Symposium on Information Theory (ISIT)•Jun 22, 2025•5 citations
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 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 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.