arXiv:2610.25334
Can Quantum Entanglement Increase the Capacity of a Classical Relay Channel?
Elsa Mizrahi, Uzi Pereg
Abstract
We show positive and negative results on classical relay channels with entanglement assistance, revealing a sharp contrast between strictly causal and causal relay encoding. First, we consider van der Meulen's setting of a unit-delay relay, with strictly causal encoding. We show that the standard cutset upper bound continues to hold with entanglement assistance, and deduce that entanglement does not increase the capacity for several classes of relay channels. Second, we consider a zero-delay relay, where the encoding is causal. We present an example in which entanglement enables rates that exceed the cutset upper bound by at least 12.5%. Namely, entanglement shared between the source and relay significantly increases the capacity of a classical zero-delay relay channel.
AI Summary
The paper asks whether entanglement shared between the source and relay can increase the capacity of an otherwise classical relay channel. It distinguishes strictly causal relaying, where transmission depends only on past observations, from causal relaying, where the current observation is also available. For strictly causal, unit-delay relays, it proves that entanglement-assisted capacity obeys the usual cutset bound, $C_{\mathrm{ET}}^{(1)}\leq\max_{p_{XX_r}}\min\{I(XX_r;Y),I(X;YY_r\mid X_r)\}$. Consequently, entanglement cannot improve capacity for channel classes where this bound is achievable classically, including degraded, reversely degraded, semi-deterministic, and orthogonal-sender-component channels. The converse tracks mutual information in the relay’s residual quantum memory and uses data processing to bound information gained across successive channel uses. For causal, zero-delay relays, it constructs a channel from the magic-square game. The relay receives a uniformly random column question; successful game responses transmit the source’s row question noiselessly, while unsuccessful responses produce uniform noise. Two shared Bell pairs per use enable perfect play, giving $C_{\mathrm{ET}}^{(0)}=\log_2 3$. A classical causal broadcast-cut bound, followed by an optimization relaxation and an entropy inequality, yields $C_{\mathrm{unassisted}}^{(0)}\leq\frac89\log_2 3$, establishing at least a $12.5\%$ gain. The exact unassisted capacity remains unresolved: the demonstrated bounds are $1.2721\leq C_{\mathrm{unassisted}}^{(0)}\leq1.4089$ bits per use, versus approximately $1.5850$ with entanglement. The unit-delay result does not rule out advantages when the classical cutset bound is not tight; broader game-based relay constructions are left for future study.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.