One-shot Multiple Access Channel Simulation

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 [Anantharam et 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 [Kurri et 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 [Atif et 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.

Total 42 pages, main text 23 pages, References and Appendices 19 pages, 2 Figures, Updated with the journal version. Characterization of smooth Imax for bounding cardinality of auxiliaries

References in corpus (22)

• Quantum Information Processing with Finite Resources -- Mathematical Foundations
• A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
• Tight uniform continuity bounds for quantum entropies: conditional entropy, relative entropy distance and energy constraints
• Coordination Capacity
• Distributed Channel Synthesis
• The Quantum Reverse Shannon Theorem based on One-Shot Information Theory
• Continuity of quantum channel capacities
• Quantum message compression with applications
• Smooth Max-Information as One-Shot Generalization for Mutual Information
• Transition Probability (Fidelity) and Its Relatives
• On Marton's Inner Bound for the General Broadcast Channel
• Position-based coding and convex splitting for private communication over quantum channels
• Moderate deviation analysis for classical communication over quantum channels
• Partially smoothed information measures
• Convex-split and hypothesis testing approach to one-shot quantum measurement compression and randomness extraction
• Two Measures of Dependence
• Multiple Access Channel Simulation
• Some continuity properties of quantum Rényi divergences
• Communication Complexity of One-Shot Remote State Preparation
• Channel Simulation: Finite Blocklengths and Broadcast Channels
• Unified framework for continuity of sandwiched Rényi divergences
• One-Shot Distributed Source Simulation: As Quantum as it Can Get