arxiv: 2605.00132 · v1 · submitted 2026-04-30 · 🪐 quant-ph · cs.IT· math.IT

Recognition: unknown

Entanglement Enabled Data Transmission over an Arbitrarily Varying Channel

Janis N\"otzel , Florian Seitz

Authors on Pith no claims yet

Pith reviewed 2026-05-09 20:29 UTC · model grok-4.3

classification 🪐 quant-ph cs.ITmath.IT

keywords entanglementarbitrarily varying channeljammingtwo-mode squeezed statesoptical communicationshared randomnessquantum communicationdata transmission

0 comments

The pith

Sender and receiver use entangled two-mode squeezed states to overcome an energy-limited jammer during randomness distribution in optical channels.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper shows that in standard optical models, sender and receiver can employ entangled two-mode squeezed states to generate shared randomness that resists jamming attacks from an energy-limited adversary. This addresses the core difficulty in arbitrarily varying channels, where a jammer can disrupt symmetrizable systems unless randomness is already available. By restricting both the legitimate parties and the jammer to binary phase shift keying and two-mode squeezed vacuum states, the approach stabilizes transmission during the distribution phase without relying on external sources. A sympathetic reader would care because it demonstrates a concrete way quantum resources can bootstrap reliable communication in adversarial settings. If correct, it means optical links can maintain positive capacity even when an active jammer is present from the start.

Core claim

Based on the most standard optical communication model, sender and receiver employ entangled two-mode squeezed states to counter the jamming attack of an energy-limited jammer during the distribution phase, when both the sender and jammer are allowed to use binary phase shift keying and two-mode squeezed vacuum states.

What carries the argument

Entangled two-mode squeezed states that the sender and receiver share to generate the randomness needed to stabilize the channel against the jammer's attacks.

Load-bearing premise

The jammer must be strictly energy-limited and restricted to binary phase shift keying and two-mode squeezed vacuum states under the standard optical model with no extra noise.

What would settle it

Measure whether the achievable rate or error probability remains strictly positive when the jammer uses its allowed states but the legitimate parties do not employ entanglement; if the rate drops to zero, the claim is falsified.

Figures

Figures reproduced from arXiv: 2605.00132 by Florian Seitz, Janis N\"otzel.

**Figure 1.** Figure 1: Depicted are O and ∆ as part of the convex polytope P({0, 1} 2 ), using r = A = 2. We observe that O approaches q0 and q1 in its limits. From the above study it is immediate that q ∈ ∆δ implies w˜ = bξ for ξ = 1 4 λcδ + (1−λc) [PITH_FULL_IMAGE:figures/full_fig_p005_1.png] view at source ↗

read the original 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 entangled two-mode squeezed states to counter the jamming attack of an energy-limited jammer during the distribution phase when both the sender and jammer are allowed to use binary phase shift keying and two-mode squeezed vacuum states.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper shows internal entanglement can counter a jammer during shared randomness distribution in optical channels, but only because the jammer is restricted to the same BPSK and TMSV states as the sender.

read the letter

The main thing to know is that this paper proposes using entangled two-mode squeezed states internally to protect the distribution of shared randomness against an energy-limited jammer in optical channels. However, the setup limits the jammer to binary phase shift keying and two-mode squeezed vacuum states, just like the sender. The new element is applying internal entanglement for this countermeasure task, as opposed to the external source methods mentioned in the abstract. It builds on the standard optical communication model without adding extra assumptions about noise, which keeps the analysis straightforward and relevant to real systems. On the positive side, the approach directly addresses the distribution phase problem in the presence of a jammer, which is a practical concern in stabilizing communication systems. The restriction to specific modulations allows for a concrete analysis using familiar quantum optics tools. The soft spot is that this does not cover general arbitrarily varying attacks. In true AVC settings, the jammer could use other energy-limited states or operations beyond BPSK and TMSV, such as coherent states or more complex entanglements. The paper's result therefore applies only within this limited alphabet, which is a significant caveat given the title's reference to arbitrarily varying channels. Without seeing detailed proofs or numerical validations in the full text, it's hard to gauge if the math supports even this restricted case robustly. This paper is for quantum information theorists and optical communication experts interested in jamming resistance and shared randomness. A reader in that area might appreciate the entanglement-based idea for the specific scenario, but it won't satisfy those seeking broad AVC results. I recommend sending it for peer review, provided the authors expand on the proofs and adjust the claims to match the restricted jammer model. The core idea has enough substance to warrant referee input.

Referee Report

2 major / 1 minor

Summary. The manuscript proposes a method for distributing shared randomness over an optical arbitrarily varying channel by having the sender and receiver employ entangled two-mode squeezed vacuum (TMSV) states to counter an energy-limited jammer. The setup restricts both the legitimate parties and the jammer to binary phase shift keying (BPSK) and TMSV states within the standard optical communication model.

Significance. If the analysis holds, the result supplies a concrete entanglement-based countermeasure for the shared-randomness distribution phase that is required to stabilize symmetrizable systems against jamming. The reliance on the most standard optical model and a finite input alphabet permits explicit calculations that could be checked against existing AVC capacity formulas.

major comments (2)

[Abstract] Abstract: the central claim is that entangled TMSV states counter 'the jamming attack of an energy-limited jammer' in an 'arbitrarily varying channel,' yet the same sentence immediately restricts the jammer to BPSK and TMSV states. This finite-alphabet limitation is load-bearing; a general energy-constrained jammer may employ coherent states, displaced squeezed states, or other operations outside the stated alphabet while still obeying the energy bound.
[Model and main result sections] Model and main result sections: the paper must either (i) prove that the TMSV countermeasure remains effective when the jammer is permitted any trace-preserving completely-positive map consistent with the energy constraint, or (ii) explicitly re-title and re-scope the work as applying only to the BPSK/TMSV jammer alphabet. The current wording leaves the title's reference to an 'Arbitrarily Varying Channel' unsupported by the stated model.

minor comments (1)

[Abstract] Abstract: no derivation, capacity expression, or numerical verification is supplied, which makes immediate assessment of the quantitative claims difficult.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments. We agree that the finite-alphabet restriction on the jammer must be stated with greater precision to avoid any ambiguity with the term 'arbitrarily varying channel.' We will revise the abstract and model section accordingly while preserving the core contribution.

read point-by-point responses

Referee: [Abstract] Abstract: the central claim is that entangled TMSV states counter 'the jamming attack of an energy-limited jammer' in an 'arbitrarily varying channel,' yet the same sentence immediately restricts the jammer to BPSK and TMSV states. This finite-alphabet limitation is load-bearing; a general energy-constrained jammer may employ coherent states, displaced squeezed states, or other operations outside the stated alphabet while still obeying the energy bound.

Authors: We acknowledge the potential for misreading and will revise the abstract to state explicitly that the model employs a finite input alphabet consisting of BPSK and TMSV states for the sender, receiver, and jammer. Within this alphabet the jammer may still select its state arbitrarily on each use, which is the defining feature of an AVC. The restriction to these states is intentional: it corresponds to the most standard optical communication model and permits explicit capacity calculations that can be compared with known AVC formulas. We do not claim the result holds for arbitrary CPTP maps. revision: yes
Referee: [Model and main result sections] Model and main result sections: the paper must either (i) prove that the TMSV countermeasure remains effective when the jammer is permitted any trace-preserving completely-positive map consistent with the energy constraint, or (ii) explicitly re-title and re-scope the work as applying only to the BPSK/TMSV jammer alphabet. The current wording leaves the title's reference to an 'Arbitrarily Varying Channel' unsupported by the stated model.

Authors: We choose option (ii). The manuscript is scoped to the BPSK/TMSV alphabet from the outset, as stated in the model description and abstract. This finite alphabet still defines a genuine AVC because the jammer's choice among the allowed states can vary arbitrarily from use to use. We will add an explicit clarifying sentence in the model section and introduction that the AVC is defined over this restricted alphabet. We believe this suffices to support the title; a full title change is unnecessary provided the model is unambiguous. Proving the claim for arbitrary energy-constrained CPTP maps lies outside the present work. revision: partial

Circularity Check

0 steps flagged

No circularity; standard model applied to new defensive task under explicit restrictions

full rationale

The paper applies the standard optical communication model and entangled two-mode squeezed states to enable shared randomness distribution against an energy-limited jammer, with both parties restricted to BPSK and TMSV states. No load-bearing steps reduce by construction to self-citations, fitted parameters renamed as predictions, or self-definitional loops; the central claim introduces a countermeasure strategy without redefining inputs in terms of outputs. The explicit alphabet restriction on the jammer is stated as an assumption rather than derived from the result itself, leaving the derivation self-contained.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on standard domain assumptions from quantum optics and information theory. No free parameters or new postulated entities are introduced in the abstract description.

axioms (2)

domain assumption The communication setup follows the most standard optical communication model
Explicitly invoked as the basis for the analysis.
domain assumption The jammer is energy-limited and restricted to BPSK and TMSV states
Required for the entanglement countermeasure to succeed against the jammer.

pith-pipeline@v0.9.0 · 5390 in / 1318 out tokens · 48430 ms · 2026-05-09T20:29:04.130327+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

31 extracted references · 10 canonical work pages

[1]

The capacities of cer- tain channel classes under random coding,

D. Blackwell, L. Breiman, and A. J. Thomasian, “The capacities of cer- tain channel classes under random coding,”The Annals of Mathematical Statistics, vol. 31, no. 3, pp. 558–567, 1960

1960
[2]

Exponential error bounds for random codes in the arbitrarily varying channel,

T. Ericson, “Exponential error bounds for random codes in the arbitrarily varying channel,”IEEE Transactions on Information Theory, vol. 31, no. 1, pp. 42–48, 1985

1985
[3]

Elimination of correlation in random codes for arbitrarily varying channels,

R. Ahlswede, “Elimination of correlation in random codes for arbitrarily varying channels,”Z. Wahrscheinlichkeitstheorie verw Gebiete, vol. 44, pp. 159 – 175, 1978

1978
[4]

The capacity of the arbitrarily varying chan- nel revisited: positivity, constraints,

I. Csiszar and P. Narayan, “The capacity of the arbitrarily varying chan- nel revisited: positivity, constraints,”IEEE Transactions on Information Theory, vol. 34, no. 2, pp. 181–193, 1988

1988
[5]

Classical capacity of classical-quantum arbitrarily varying channels,

R. Ahlswede and V . Blinovsky, “Classical capacity of classical-quantum arbitrarily varying channels,”IEEE Transactions on Information Theory, vol. 53, no. 2, pp. 526–533, 2007

2007
[6]

Capacity of the gaussian arbitrarily varying channel,

I. Csiszar and P. Narayan, “Capacity of the gaussian arbitrarily varying channel,”IEEE Transactions on Information Theory, vol. 37, no. 1, pp. 18–26, 1991

1991
[7]

Data transmission over a bosonic channel under classical noise,

J. N ¨otzel, “Data transmission over a bosonic channel under classical noise,” in2024 IEEE International Symposium on Information Theory (ISIT), 2024, pp. 1227–1232

2024
[8]

Classical-quantum arbitrarily varying wiretap channel: Secret message transmission under jamming attacks,

H. Boche, M. Cai, C. Deppe, and J. N ¨otzel, “Classical-quantum arbitrarily varying wiretap channel: Secret message transmission under jamming attacks,”Journal of Mathematical Physics, vol. 58, no. 10, p. 102203, 10 2017. [Online]. Available: https://doi.org/10.1063/1.5005947

work page doi:10.1063/1.5005947 2017
[9]

Classical-quantum arbitrarily varying wiretap channel: common randomness assisted code and continuity,

——, “Classical-quantum arbitrarily varying wiretap channel: common randomness assisted code and continuity,”Quantum Information Processing, vol. 16, no. 1, 12 2016. [Online]. Available: http://dx.doi.org/10.1007/s11128-016-1473-y

work page doi:10.1007/s11128-016-1473-y 2016
[10]

Positivity, discontinuity, finite resources, and nonzero error for arbitrarily varying quantum channels,

H. Boche and J. N ¨otzel, “Positivity, discontinuity, finite resources, and nonzero error for arbitrarily varying quantum channels,”Journal of Mathematical Physics, vol. 55, no. 12, p. 122201, 12 2014. [Online]. Available: https://doi.org/10.1063/1.4902930

work page doi:10.1063/1.4902930 2014
[11]

Detectability of denial-of-service attacks on communication systems,

H. Boche, R. F. Schaefer, and H. Vincent Poor, “Detectability of denial-of-service attacks on communication systems,” inICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2019, pp. 2532–2536

2019
[12]

Detecting symmetrizability in physical systems,

F. Seitz and J. N ¨otzel, “Detecting symmetrizability in physical systems,” pp. 4687–4692, 2025

2025
[13]

Correlated sources help transmission over an arbitrarily varying channel,

R. Ahlswede and N. Cai, “Correlated sources help transmission over an arbitrarily varying channel,”IEEE Transactions on Information Theory, vol. 43, no. 4, pp. 1254–1255, 1997

1997
[14]

Arbitrarily small amounts of correlation for arbitrarily varying quantum channels,

H. Boche and J. N ¨otzel, “Arbitrarily small amounts of correlation for arbitrarily varying quantum channels,”Journal of Mathematical Physics, vol. 54, no. 11, p. 112202, 11 2013. [Online]. Available: https://doi.org/10.1063/1.4825159

work page doi:10.1063/1.4825159 2013
[15]

The arbitrarily varying channel with colored gaussian noise,

U. Pereg and Y . Steinberg, “The arbitrarily varying channel with colored gaussian noise,”IEEE Transactions on Information Theory, vol. 67, no. 6, pp. 3781–3817, 2021

2021
[16]

Quantum capacity under adversarial quantum noise: Arbitrarily varying quantum channels,

R. Ahlswede, I. Bjelakovic, H. Boche, and J. N ¨otzel, “Quantum capacity under adversarial quantum noise: Arbitrarily varying quantum channels,” Communications in Mathematical Physics, vol. 317, pp. 103 – 156,
[17]

Available: https://doi.org/10.1007/s00220-012-1613-x

[Online]. Available: https://doi.org/10.1007/s00220-012-1613-x

work page doi:10.1007/s00220-012-1613-x
[18]

Fully quantum arbitrarily varying channels: Random coding capacity and capacity dichotomy,

H. Boche, C. Deppe, J. N ¨otzel, and A. Winter, “Fully quantum arbitrarily varying channels: Random coding capacity and capacity dichotomy,” in2018 IEEE International Symposium on Information Theory (ISIT). IEEE, jun 2018. [Online]. Available: https://doi.org/10.1109

2018
[19]

Shared randomness in arbitrarily varying channels,

S. Bhattacharya, A. J. Budkuley, and S. Jaggi, “Shared randomness in arbitrarily varying channels,” in2019 IEEE International Symposium on Information Theory (ISIT), 2019, pp. 627–631

2019
[20]

Classical information capacity of the bosonic broadcast channel,

S. Guha and J. H. Shapiro, “Classical information capacity of the bosonic broadcast channel,” in2007 IEEE International Symposium on Information Theory, 2007, pp. 1896–1900

2007
[21]

Classical capacity of bosonic broadcast communication and a minimum output entropy conjecture,

S. Guha, J. H. Shapiro, and B. I. Erkmen, “Classical capacity of bosonic broadcast communication and a minimum output entropy conjecture,”Phys. Rev. A, vol. 76, p. 032303, Sep 2007. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.76.032303

work page doi:10.1103/physreva.76.032303 2007
[22]

Gaussian states and operations – a quick reference,

J. B. Brask, “Gaussian states and operations – a quick reference,”
[23]

Available: https://arxiv.org/abs/2102.05748

[Online]. Available: https://arxiv.org/abs/2102.05748

work page arXiv
[24]

A note on the existence of the weak capacity for channels with arbitrarily varying channel probability functions and its relation to shannon’s zero error capacity,

R. Ahlswede, “A note on the existence of the weak capacity for channels with arbitrarily varying channel probability functions and its relation to shannon’s zero error capacity,”The Annals of Mathematical Statistics, vol. 41, no. 3, pp. 1027–1033, 1970. [Online]. Available: http://www.jstor.org/stable/2239255

work page arXiv 1970
[25]

A. S. Holevo,Quantum Systems, Channels, Information: A Mathematical Introduction. Berlin, Boston: De Gruyter, 06 Dec
[26]

Available: https://www.degruyter.com/view/title/122902

[Online]. Available: https://www.degruyter.com/view/title/122902
[27]

The spectrum of clipped noise,

J. Van Vleck and D. Middleton, “The spectrum of clipped noise,” Proceedings of the IEEE, vol. 54, no. 1, pp. 2–19, 1966

1966
[28]

Quantum nonlocality as an axiom,

S. Popescu and D. Rohrlich, “Quantum nonlocality as an axiom,” F oundations of Physics, vol. 24, pp. 379–385, 1994

1994
[29]

Quantum communication with zero-capacity channels,

G. Smith and J. Yard, “Quantum communication with zero-capacity channels,”Science, vol. 321, no. 5897, pp. 1812–1815, 2008. [Online]. Available: https://www.science.org/doi/abs/10.1126/science.1162242

work page doi:10.1126/science.1162242 2008
[30]

The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabet,

R. Ahlswede and J. Wolfowitz, “The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabet,”Zeitschrift f ¨ur Wahrscheinlichkeitstheorie und V erwandte Gebiete, vol. 15, pp. 186 –194, 1970. [Online]. Available: https://doi.org/10.1007/BF00534915

work page doi:10.1007/bf00534915 1970
[31]

A reduction formula for normal multivariate integrals,

R. L. Plackett, “A reduction formula for normal multivariate integrals,” Biometrika, vol. 41, no. 3/4, pp. 351–360, 1954

1954