The Quantum Multiple-Access Channel with Cribbing Encoders
- URL: http://arxiv.org/abs/2111.15589v2
- Date: Mon, 9 May 2022 10:05:07 GMT
- Title: The Quantum Multiple-Access Channel with Cribbing Encoders
- Authors: Uzi Pereg, Christian Deppe, and Holger Boche
- Abstract summary: Communication over a quantum multiple-access channel (MAC) with cribbing encoders is considered.
Based on the no-cloning theorem, perfect cribbing is impossible.
A partial decode-forward region is derived for a quantum MAC with non-robust cribbing.
- Score: 78.7611537027573
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Communication over a quantum multiple-access channel (MAC) with cribbing
encoders is considered, whereby Transmitter 2 performs a measurement on a
system that is entangled with Transmitter 1. Based on the no-cloning theorem,
perfect cribbing is impossible. This leads to the introduction of a MAC model
with noisy cribbing. In the causal and non-causal cribbing scenarios,
Transmitter 2 performs the measurement before the input of Transmitter 1 is
sent through the channel. Hence, Transmitter 2's cribbing may inflict a "state
collapse" for Transmitter 1. Achievable regions are derived for each setting.
Furthermore, a regularized capacity characterization is established for robust
cribbing, i.e. when the cribbing system contains all the information of the
channel input. Building on the analogy between the noisy cribbing model and the
relay channel, a partial decode-forward region is derived for a quantum MAC
with non-robust cribbing. For the classical-quantum MAC with cribbing encoders,
the capacity region is determined with perfect cribbing of the classical input,
and a cutset region is derived for noisy cribbing. In the special case of a
classical-quantum MAC with a deterministic cribbing channel, the inner and
outer bounds coincide.
Related papers
- Continuous variable dense coding under realistic non-ideal scenarios [0.0]
We derive a general formalism for the dense coding capacity (DCC) of generic two-mode Gaussian states.
We investigate the pattern of DCC of the two-mode squeezed vacuum state (TMSV) by varying the strength of the noise.
arXiv Detail & Related papers (2024-07-10T12:49:17Z) - High Capacity Noisy Unruh--DeWitt Quantum Channels with Bosonic
Dephasing [0.0]
UDW quantum gates provide a framework for evaluating quantum Shannon theory properties of qubit-field systems.
UDW quantum channels consist of qubits encoding/decoding quantum information onto/off of quantum fields.
We show that UDW quantum channels have an unexpected representation as certain bosonic dephasing channels with dephasing parameters.
arXiv Detail & Related papers (2023-09-13T18:00:01Z) - Eavesdropper localization for quantum and classical channels via
nonlinear scattering [58.720142291102135]
Quantum key distribution (QKD) offers theoretical security based on the laws of physics.
We present a novel approach to eavesdropper location that can be employed in quantum as well as classical channels.
We demonstrate that our approach outperforms conventional OTDR in the task of localizing an evanescent outcoupling of 1% with cm precision inside standard optical fibers.
arXiv Detail & Related papers (2023-06-25T21:06:27Z) - The Multiple-Access Channel with Entangled Transmitters [67.92544792239086]
Communication over a classical multiple-access channel (MAC) with entanglement resources is considered.
We establish inner and outer bounds on the capacity region for the general MAC with entangled transmitters.
Using superdense coding, entanglement can double the conferencing rate.
arXiv Detail & Related papers (2023-03-18T16:51:08Z) - Multiple-Access Channel Coding with Non-Signaling Correlations [7.215767098253206]
We address the problem of coding for classical multiple-access channels (MACs) with the assistance of non-signaling correlations between parties.
We show that using non-signaling assistance, the sum-rate $1.5425$ can be reached even with zero error.
We also show that the capacity region with non-signaling assistance shared only between each sender and the receiver independently is the same as without assistance.
arXiv Detail & Related papers (2022-06-22T10:36:47Z) - Classical State Masking over a Quantum Channel [78.7611537027573]
Transmission of classical information over a quantum state-dependent channel is considered, when the encoder can measure channel side information (CSI) and is required to mask information on the quantum channel state from the decoder.
Regularized formula is derived for the masking equivocation region, and a full characterization is established for a class of measurement channels.
arXiv Detail & Related papers (2021-09-26T16:29:27Z) - Queue-Channel Capacities with Generalized Amplitude Damping [4.971638713979981]
We consider a symmetric GAD channel characterized by the parameter $n=1/2,$ and derive its exact classical capacity.
We show that the Holevo quantity for the GAD channel equals the Shannon capacity of the induced binary symmetric channel.
We exploit a conditional independence property in conjunction with additivity of the channel model, to obtain a capacity expression for the GAD queue channel.
arXiv Detail & Related papers (2021-07-28T16:52:24Z) - Computation-aided classical-quantum multiple access to boost network
communication speeds [61.12008553173672]
We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC.
We show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design.
arXiv Detail & Related papers (2021-05-30T11:19:47Z) - Bosonic Dirty Paper Coding [12.437226707039448]
The single-mode bosonic channel is addressed with classical interference in the modulation and with side information at the transmitter.
We show that the effect of the channel parameter can be canceled even when the decoder has no side information.
Considering the special case of a pure-loss bosonic channel, we demonstrate that the optimal coefficient for dirty paper coding is not necessarily the MMSE estimator coefficient as in the classical setting.
arXiv Detail & Related papers (2021-01-03T09:48:08Z) - On Sparsifying Encoder Outputs in Sequence-to-Sequence Models [90.58793284654692]
We take Transformer as the testbed and introduce a layer of gates in-between the encoder and the decoder.
The gates are regularized using the expected value of the sparsity-inducing L0penalty.
We investigate the effects of this sparsification on two machine translation and two summarization tasks.
arXiv Detail & Related papers (2020-04-24T16:57:52Z)
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.