Transmitting Correlation for Data Transmission over the Bosonic Arbitrarily Varying Channel

• URL: http://arxiv.org/abs/2603.02078v1
• Date: Mon, 02 Mar 2026 17:02:11 GMT
• Title: Transmitting Correlation for Data Transmission over the Bosonic Arbitrarily Varying Channel
• Authors: Janis Nötzel, Florian Seitz,
• Abstract summary: We show how the sender and receiver can employ classically correlated thermal light or entangled two-mode squeezed states to counter the jamming attack of an energy-limited jammer.<n>Both sender and receiver are only allowed to use homodyne detection in our model, and the sender has to obey a power limit as well.
• Score: 3.276004382817011
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Shared randomness is the central ingredient for stabilizing symmetrizable communication systems against arbitrarily varying jammers. Given the presence of the jammer, however, the question arises how this precious resource could have been distributed. Several works discuss the use of external sources for this task. In this work, we show, based on the most standard optical communication model, how the sender and receiver can employ either classically correlated thermal light or entangled two-mode squeezed states created at and transmitted by the sender to counter the jamming attack of an energy-limited jammer during the distribution phase. Both sender and receiver are only allowed to use homodyne detection in our model, and the sender has to obey a power limit as well.

Related papers

• On (Im)possibility of Network Oblivious Transfer via Noisy Channels and Non-Signaling Correlations [45.59862974645558]
  This work investigates the fundamental limits of implementing network oblivious transfer via noisy multiple access channels and broadcast channels between honest-but-curious parties.<n>By modeling the shared resource as an arbitrary tripartite non-signaling box, we obtain a unified perspective on both the channel behavior and the resulting correlations.
  arXiv  Detail & Related papers  (2026-02-03T11:45:43Z)
• Data Transmission over a Bosonic Arbitrarily Varying Quantum Channel [1.534667887016089]
  We give an explicit capacity formula for the lossy bosonic channel subject to semi-classical attacks.<n>We show how a recently conjectured new quantum entropy power relates to our capacity formula.
  arXiv  Detail & Related papers  (2025-07-24T10:01:16Z)
• Joint Communication and Sensing with Bipartite Entanglement over Bosonic Channels [8.444687277893829]
  We consider a joint communication and sensing problem in an optical link in which a low-power transmitter attempts to communicate with a receiver while simultaneously identifying the range of a defect creating a backscattered signal.<n>Motivated by the envisioned deployment of entanglement sharing quantum networks, we allow the transmitter to exploit entanglement to assist its sensing and communication.<n>Our main result is a characterization of the trade-offs incurred in the form of an achievable rate/error-exponent region which can beat time-sharing in certain cases.
  arXiv  Detail & Related papers  (2025-01-26T21:10:57Z)
• The Multiple-Access Channel with Entangled Transmitters [67.92544792239086]
  Communication over a classical multiple-access channel (MAC) with entanglement resources is considered.<n>We establish inner and outer bounds on the capacity region for the general MAC with entangled transmitters.<n>Using superdense coding, entanglement can double the conferencing rate.
  arXiv  Detail & Related papers  (2023-03-18T16:51:08Z)
• Fault-tolerant Coding for Entanglement-Assisted Communication [46.0607942851373]
  This paper studies the study of fault-tolerant channel coding for quantum channels. We use techniques from fault-tolerant quantum computing to establish coding theorems for sending classical and quantum information in this scenario. We extend these methods to the case of entanglement-assisted communication, in particular proving that the fault-tolerant capacity approaches the usual capacity when the gate error approaches zero.
  arXiv  Detail & Related papers  (2022-10-06T14:09:16Z)
• Reinforcement-learning calibration of coherent-state receivers on variable-loss optical channels [0.0]
  We study the problem of calibrating a quantum receiver for optical coherent states when transmitted on a quantum optical channel with variable transmissivity. We optimize the error probability of legacy adaptive receivers, such as Kennedy's and Dolinar's, on average with respect to the channel transmissivity distribution.
  arXiv  Detail & Related papers  (2022-03-18T09:12:19Z)
• Self-Conditioned Generative Adversarial Networks for Image Editing [61.50205580051405]
  Generative Adversarial Networks (GANs) are susceptible to bias, learned from either the unbalanced data, or through mode collapse. We argue that this bias is responsible not only for fairness concerns, but that it plays a key role in the collapse of latent-traversal editing methods when deviating away from the distribution's core.
  arXiv  Detail & Related papers  (2022-02-08T18:08:24Z)
• Communication with Unreliable Entanglement Assistance [78.7611537027573]
  Entanglement resources can increase transmission rates substantially. In order to generate entanglement for optical communication, the transmitter first prepares an entangled photon pair locally. Without feedback, the transmitter does not know whether the entangled photon has reached the receiver.
  arXiv  Detail & Related papers  (2021-12-16T22:24:56Z)
• Capacities of Gaussian Quantum Channels with Passive Environment Assistance [0.0]
  Passive environment assisted communication takes place via a quantum channel modeled as a unitary interaction between the information carrying system and an environment. We consider both quantum communication and classical communication with helper, as well as classical communication with free classical coordination between sender and helper.
  arXiv  Detail & Related papers  (2021-01-03T10:33:43Z)
• Channel Effects on Surrogate Models of Adversarial Attacks against Wireless Signal Classifiers [42.56367378986028]
  We consider a wireless communication system that consists of a background emitter, a transmitter, and an adversary. The adversary generates adversarial attacks to fool the transmitter into misclassifying the channel as idle. We consider different topologies to investigate how different surrogate models that are trained by the adversary affect the performance of the adversarial attack.
  arXiv  Detail & Related papers  (2020-12-03T18:46:28Z)
• FedRec: Federated Learning of Universal Receivers over Fading Channels [92.15358738530037]
  We propose a neural network-based symbol detection technique for downlink fading channels. Multiple users collaborate to jointly learn a universal data-driven detector, hence the name FedRec. The performance of the resulting receiver is shown to approach the MAP performance in diverse channel conditions without requiring knowledge of the fading statistics.
  arXiv  Detail & Related papers  (2020-11-14T11:29:55Z)

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.