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

arXiv:2410.17198 · IEEE Transactions on Information Theory

One-Shot Multiple Access Channel Simulation

Aditya Nema, Sreejith Sreekumar, Mario Berta

Published Jan 12, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1109/tit.2026.3652087

Related papers

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 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 multi-sender decoupling and simultaneous decoding for the quantum MAC

Chakraborty, Sayantan, Aditya Nema, Sen, Pranab

In this work, we prove a novel one-shot multi-sender decoupling theorem generalising Dupuis result. We start off with a multipartite quantum state, say on A1 A2 R, where A1, A2 are treated as the two sender systems and R is the reference system. We apply independent Haar random unitaries in tensor product on A1 and A2 and then send the resulting systems through a quantum channel. We want the channel output B to be almost in tensor with the untouched reference R. Our main result shows that this is indeed the case if suitable entropic conditions are met. An immediate application of our main result is to obtain a one-shot simultaneous decoder for sending quantum information over a k-sender entanglement unassisted quantum multiple access channel (QMAC). The rate region achieved by this decoder is the natural one-shot quantum analogue of the pentagonal classical rate region. Assuming a simultaneous smoothing conjecture, this one-shot rate region approaches the optimal rate region of Yard, Dein the asymptotic iid limit. Our work is the first one to obtain a non-trivial simultaneous decoder for the QMAC with limited entanglement assistance in both one-shot and asymptotic iid settings; previous works used unlimited entanglement assistance.

arXiv:2102.02187•Feb 3, 2021•4 citations

A multi-sender decoupling theorem and simultaneous decoding for the quantum MAC

Sayantan Chakraborty, Aditya Nema, Pranab Sen

In this work, we prove a novel one-shot ‘multi-sender’ decoupling theorem generalising Dupuis' seminal single sender decoupling theorem. We start off with a multipartite quantum state, say on$A_{1}A_{2}R$, where$A_{1}, A_{2}$are treated as the two ‘sender’ systems and$R$is the reference system. We apply independent Haar random unitaries in tensor product on$A_{1}$and$A_{2}$and then send the resulting systems through a quantum channel. We want the channel output$B$to be almost in tensor with the untouched reference$R$. Our main result shows that this is indeed the case if suitable entropic conditions are met. An immediate application of our main result is to obtain a one-shot simultaneous decoder for sending quantum information over a$k$-sender entanglement unassisted quantum multiple access channel (QMAC). The rate region achieved by this decoder is the natural one-shot quantum analogue of the pentagonal classical rate region. Assuming a simultaneous smoothing conjecture, this one-shot rate region approaches the optimal rate region of Yard et al. [20] in the asymptotic iid limit. Our work is the first one to obtain a non-trivial simultaneous decoder for the QMAC with limited entanglement assistance in both one-shot and asymptotic iid settings; previous works used unlimited entanglement assistance.

IEEE International Symposium on Information Theory (ISIT)•Jul 12, 2021•3 citations

Information-Spectrum General Formulas for the Capacity Region of Classical-Quantum Multiple Access Channels

Takuya Kubo, Hiroshi Nagaoka

For classical-quantum multiple access channels (cq-MACs) with two senders, we give several general expressions for the capacity region, valid for arbitrary sequences of channels. In the case of asymptotically vanishing error ($\varepsilon=0$), the capacity region is expressed in terms of spectral inf-mutual information rates. For every $0\le\varepsilon<1$, the $\varepsilon$-capacity region is expressed in terms of a quantity defined through a linear combination of three alternative hypotheses. In particular, the outer bound of Kubo and Nagaoka (2015) is tight. Our results include the quantum counterpart of the general formula of Han (1998) for the classical MAC. The most important ingredient is the one-shot inner bound of Sen (2021), which we apply to each member of an arbitrary channel sequence.

arXiv:2611.07462•Nov 5, 2026•0 citations

Exponents for Shared Randomness-Assisted Channel Simulation

Aadil Oufkir, Michael X. Cao, Hao–Chung Cheng +1 more

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´enyi 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. We derive our results by asymptotically expanding the meta-converse for channel simulation [Caoet al., IEEE Trans. Inf. Theory (2024)], which corresponds to nonsignaling assisted codes. We prove this to be asymptotically tight by employing the approximation algorithms from [Bertaet al., Proc. IEEE ISIT (2024)], which show how to round any non-signaling assisted strategy to a strategy that only uses shared randomness. Notably, this implies that any additional quantum entanglement-assistance does not change the error or the strong converse exponents.

IEEE Transactions on Information Theory•Feb 16, 2026•5 citations
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.
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.
In this work, we prove a novel one-shot multi-sender decoupling theorem generalising Dupuis result. We start off with a multipartite quantum state, say on A1 A2 R, where A1, A2 are treated as the two sender systems and R is the reference system. We apply independent Haar random unitaries in tensor product on A1 and A2 and then send the resulting systems through a quantum channel. We want the channel output B to be almost in tensor with the untouched reference R. Our main result shows that this is indeed the case if suitable entropic conditions are met. An immediate application of our main result is to obtain a one-shot simultaneous decoder for sending quantum information over a k-sender entanglement unassisted quantum multiple access channel (QMAC). The rate region achieved by this decoder is the natural one-shot quantum analogue of the pentagonal classical rate region. Assuming a simultaneous smoothing conjecture, this one-shot rate region approaches the optimal rate region of Yard, Dein the asymptotic iid limit. Our work is the first one to obtain a non-trivial simultaneous decoder for the QMAC with limited entanglement assistance in both one-shot and asymptotic iid settings; previous works used unlimited entanglement assistance.
In this work, we prove a novel one-shot ‘multi-sender’ decoupling theorem generalising Dupuis' seminal single sender decoupling theorem. We start off with a multipartite quantum state, say onA1A2RA_{1}A_{2}RA1​A2​R, whereA1,A2A_{1}, A_{2}A1​,A2​are treated as the two ‘sender’ systems andRRRis the reference system. We apply independent Haar random unitaries in tensor product onA1A_{1}A1​andA2A_{2}A2​and then send the resulting systems through a quantum channel. We want the channel outputBBBto be almost in tensor with the untouched referenceRRR. Our main result shows that this is indeed the case if suitable entropic conditions are met. An immediate application of our main result is to obtain a one-shot simultaneous decoder for sending quantum information over akkk-sender entanglement unassisted quantum multiple access channel (QMAC). The rate region achieved by this decoder is the natural one-shot quantum analogue of the pentagonal classical rate region. Assuming a simultaneous smoothing conjecture, this one-shot rate region approaches the optimal rate region of Yard et al. [20] in the asymptotic iid limit. Our work is the first one to obtain a non-trivial simultaneous decoder for the QMAC with limited entanglement assistance in both one-shot and asymptotic iid settings; previous works used unlimited entanglement assistance.
For classical-quantum multiple access channels (cq-MACs) with two senders, we give several general expressions for the capacity region, valid for arbitrary sequences of channels. In the case of asymptotically vanishing error (ε=0\varepsilon=0ε=0), the capacity region is expressed in terms of spectral inf-mutual information rates. For every 0≤ε<10\le\varepsilon<10≤ε<1, the ε\varepsilonε-capacity region is expressed in terms of a quantity defined through a linear combination of three alternative hypotheses. In particular, the outer bound of Kubo and Nagaoka (2015) is tight. Our results include the quantum counterpart of the general formula of Han (1998) for the classical MAC. The most important ingredient is the one-shot inner bound of Sen (2021), which we apply to each member of an arbitrary channel sequence.
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´enyi 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. We derive our results by asymptotically expanding the meta-converse for channel simulation [Caoet al., IEEE Trans. Inf. Theory (2024)], which corresponds to nonsignaling assisted codes. We prove this to be asymptotically tight by employing the approximation algorithms from [Bertaet al., Proc. IEEE ISIT (2024)], which show how to round any non-signaling assisted strategy to a strategy that only uses shared randomness. Notably, this implies that any additional quantum entanglement-assistance does not change the error or the strong converse exponents.