One-shot Multiple Access Channel Simulation

• URL: http://arxiv.org/abs/2410.17198v1
• Date: Tue, 22 Oct 2024 17:18:38 GMT
• Title: One-shot Multiple Access Channel Simulation
• Authors: Aditya Nema, Sreejith Sreekumar, Mario Berta,
• Abstract summary: We consider the problem of shared randomness-assisted multiple access channel (MAC) simulation for product inputs. We characterize the one-shot communication cost region via almost-matching inner and outer bounds in terms of the smooth max-information of the channel.
• Score: 9.271640666465364
• License:
• 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.

Related papers

• Programmable Quantum Processors: Equivalence and Learning [0.0]
  A programmable quantum processor is a device able to transform input data states in a desired way. Three types of probabilistic equivalences - strong, weak, and structural - were defined. It was found that spans of operators of structurally equivalent processors are identical.
  arXiv  Detail & Related papers  (2024-11-04T17:18:18Z)
• Resolvability of classical-quantum channels [54.825573549226924]
  We study the resolvability of classical-quantum channels in two settings, for the channel output generated from the worst input, and form the fixed independent and identically distributed (i.i.d.) input. For the fixed-input setting, while the direct part follows from the known quantum soft covering result, we exploit the recent alternative quantum Sanov theorem to solve the strong converse.
  arXiv  Detail & Related papers  (2024-10-22T05:18:43Z)
• Exponents for Shared Randomness-Assisted Channel Simulation [10.437113494732605]
  We determine the exact error and strong converse exponents of shared randomness-assisted channel simulation in worst case total-variation distance. 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.
  arXiv  Detail & Related papers  (2024-10-09T16:45:58Z)
• Joint State-Channel Decoupling and One-Shot Quantum Coding Theorem [16.05946478325466]
  We propose a joint state-channel decoupling approach to obtain a one-shot error exponent bound without smoothing. We establish a one-shot error exponent bound for quantum channel coding given by a sandwiched R'enyi coherent information.
  arXiv  Detail & Related papers  (2024-09-23T15:59:16Z)
• Channel Simulation: Finite Blocklengths and Broadcast Channels [13.561997774592667]
  We study channel simulation under common randomness assistance in the finite-blocklength regime. We identify the smooth channel max-information as a linear program one-shot converse on the minimal simulation cost for fixed error tolerance.
  arXiv  Detail & Related papers  (2022-12-22T13:08:55Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Deep Reinforcement Learning for IRS Phase Shift Design in Spatiotemporally Correlated Environments [93.30657979626858]
  We propose a deep actor-critic algorithm that accounts for channel correlations and destination motion. We show that, when channels aretemporally correlated, the inclusion of the SNR in the state representation with function approximation in ways that inhibit convergence.
  arXiv  Detail & Related papers  (2022-11-02T22:07:36Z)
• Random Orthogonalization for Federated Learning in Massive MIMO Systems [85.71432283670114]
  We propose a novel communication design for federated learning (FL) in a massive multiple-input and multiple-output (MIMO) wireless system. Key novelty of random orthogonalization comes from the tight coupling of FL and two unique characteristics of massive MIMO -- channel hardening and favorable propagation. We extend this principle to the downlink communication phase and develop a simple but highly effective model broadcast method for FL.
  arXiv  Detail & Related papers  (2022-10-18T14:17:10Z)
• Accurate methods for the analysis of strong-drive effects in parametric gates [94.70553167084388]
  We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach. We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
  arXiv  Detail & Related papers  (2021-07-06T02:02:54Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Coherence dynamics induced by attenuation and amplification Gaussian channels [0.0]
  We study the coherence dynamics introduced by these channels on input states. We write a simple expression for computing the entropy production due to the coherence for both channels. This can be useful to simulate many processes in quantum thermodynamics, as finite-time driving on bosonic modes.
  arXiv  Detail & Related papers  (2020-10-29T01:21:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.