Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.25334

Can Quantum Entanglement Increase the Capacity of a Classical Relay Channel?

Elsa Mizrahi, Uzi Pereg

quant-phcs.ITSubmitted Oct 18, 2026• Announced Oct 20, 2026• 0 citations
arXivHTMLPDF

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.

Little sign of AI-generated text

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Quantum broadcast channels with cooperating decoders: An information-theoretic perspective on quantum repeaters

Uzi Pereg, Christian Deppe, Holger Boche

Communication over a quantum broadcast channel with cooperation between the receivers is considered. The first form of cooperation addressed is classical conferencing, where receiver 1 can send classical messages to receiver 2. Another cooperation setting involves quantum conferencing, where receiver 1 can teleport a quantum state to receiver 2. When receiver 1 is not required to recover information and its sole purpose is to help the transmission to receiver 2, the model reduces to the quantum primitive relay channel. The quantum conferencing setting is intimately related to quantum repeaters as the sender, receiver 1, and receiver 2 can be viewed as the transmitter, the repeater, and the destination receiver, respectively. We develop lower and upper bounds on the capacity region in each setting. In particular, the cutset upper bound and the decode-forward lower bound are derived for the primitive relay channel. Furthermore, we present an entanglement-formation lower bound, where a virtual channel is simulated through the conference link. At last, we show that as opposed to the multiple access channel with entangled encoders, entanglement between decoders does not increase the classical communication rates for the broadcast dual.

arXiv:2011.09233•Journal of Mathematical Physics•Jun 1, 2021•27 citations

Quantum Entanglement Assistance Improves the Capacity and Activates the Zero-Error Capacity of Classical Channels with Causal CSIT

Yuhang Yao, Syed A. Jafar

For classical point-to-point channels, it has been shown by Bennett et al. that quantum entanglement assistance cannot improve their capacity, and by Cubitt et al. that entanglement assistance cannot activate (increase from zero to non-zero) their zero-error capacity. In contrast, we show that for classical point-to-point channels with causal CSIT (channel state information at the transmitter), quantum entanglement assistance can in some cases improve their capacity, and in some cases activate their zero-error capacity.

quant-pharXiv:2603.20416•Mar 24, 2026•4 citations

Quantum Relay Channels

Uzi Pereg

Communication over a fully quantum relay channel is considered. We establish three bounds based on different coding strategies, i.e., partial decode-forward, measure-forward, and assist-forward. Using the partial decode-forward strategy, the relay decodes part of the information, while the other part is decoded without the relay’s help. The result by Savov et al. (2012) for a classical-quantum relay channel is obtained as a special case. Based on our partial decode-forward bound, the capacity is determined for Hadamard relay channels. In the measure-forward coding scheme, the relay performs a sequence of measurements and then sends a compressed representation of the measurement outcome to the destination receiver. The measure-forward strategy can be viewed as a generalization of the classical compress-forward bound. At last, we consider quantum relay channels with orthogonal receiver components. The assist-forward bound is based on a new approach, whereby the transmitter sends the message to the relay and simultaneously generates entanglement assistance between the relay and the destination receiver. Subsequently, the relay can transmit the message to the destination receiver with rate-limited entanglement assistance.

arXiv:2411.16263•IEEE Transactions on Information Theory•Sep 22, 2025•7 citations

Causal Limit on Quantum Communication

Robert Pisarczyk, Zhikuan Zhao, Yingkai Ouyang +2 more

The capacity of a channel is known to be equivalent to the highest rate at which it can generate entanglement. Analogous to entanglement, the notion of a causality measure characterizes the temporal aspect of quantum correlations. Despite holding an equally fundamental role in physics, temporal quantum correlations have yet to find their operational significance in quantum communication. Here we uncover a connection between quantum causality and channel capacity. We show the amount of temporal correlations between two ends of the noisy quantum channel, as quantified by a causality measure, implies a general upper bound on its channel capacity. The expression of this new bound is simpler to evaluate than most previously known bounds. We demonstrate the utility of this bound by applying it to a class of shifted depolarizing channels, which results in improvement over previously known bounds for this class of channels.

arXiv:1804.02594•Physical Review Letters•Oct 10, 2019•32 citations

Quantum Relay Channels

Uzi Pereg

Communication over a fully quantum relay channel is considered. We establish three bounds based on different coding strategies, i.e., partial decode-forward, measure-forward, and assist-forward. Using the partial decode-forward strategy, the relay decodes part of the information, while the other part is decoded without the relay's help. Based on our partial decode-forward bound, the capacity is determined for Hadamard relay channels. In the measure-forward coding scheme, the relay performs a sequence of measurements and then transmits a compressed representation. At last, the assist-forward bound is based on a new approach, whereby the transmitter sends the message to the relay and simultaneously generates entanglement assistance between the relay and the destination receiver. Subsequently, the relay can transmit with rate-limited entanglement assistance.

IEEE International Symposium on Information Theory (ISIT)•Jun 22, 2025•0 citations

Entanglement required in achieving entanglement-assisted channel capacities

Garry Bowen

Entanglement shared between the two ends of a quantum-communication channel has been shown to be a useful resource in increasing both the quantum and classical capacities for these channels. The entanglement-assisted capacities were derived assuming an unlimited amount of shared entanglement per channel use. In this paper, bounds are derived on the minimum amount of entanglement required per use of a channel, in order to asymptotically achieve the capacity. This is achieved by introducing a class of entanglement-assisted quantum codes. Codes for classes of qubit channels are shown to achieve the quantum entanglement-assisted channel capacity when an amount of shared entanglement per channel given by, ${\mathcal{E}}_{Q}^{\mathrm{Random}}>~1\ensuremath{-}{Q}_{E},$ is provided. It is also shown that for very noisy channels, as the capacities become small, the amount of required entanglement converges for the classical and quantum capacities.

arXiv:quant-ph/0205117•Physical Review A•Nov 21, 2002•118 citations
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.
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, CET(1)≤max⁡pXXrmin⁡{I(XXr;Y),I(X;YYr∣Xr)}C_{\mathrm{ET}}^{(1)}\leq\max_{p_{XX_r}}\min\{I(XX_r;Y),I(X;YY_r\mid X_r)\}CET(1)​≤maxpXXr​​​min{I(XXr​;Y),I(X;YYr​∣Xr​)}. 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 CET(0)=log⁡23C_{\mathrm{ET}}^{(0)}=\log_2 3CET(0)​=log2​3. A classical causal broadcast-cut bound, followed by an optimization relaxation and an entropy inequality, yields Cunassisted(0)≤89log⁡23C_{\mathrm{unassisted}}^{(0)}\leq\frac89\log_2 3Cunassisted(0)​≤98​log2​3, establishing at least a 12.5%12.5\%12.5% gain.
The exact unassisted capacity remains unresolved: the demonstrated bounds are 1.2721≤Cunassisted(0)≤1.40891.2721\leq C_{\mathrm{unassisted}}^{(0)}\leq1.40891.2721≤Cunassisted(0)​≤1.4089 bits per use, versus approximately 1.58501.58501.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.
Communication over a quantum broadcast channel with cooperation between the receivers is considered. The first form of cooperation addressed is classical conferencing, where receiver 1 can send classical messages to receiver 2. Another cooperation setting involves quantum conferencing, where receiver 1 can teleport a quantum state to receiver 2. When receiver 1 is not required to recover information and its sole purpose is to help the transmission to receiver 2, the model reduces to the quantum primitive relay channel. The quantum conferencing setting is intimately related to quantum repeaters as the sender, receiver 1, and receiver 2 can be viewed as the transmitter, the repeater, and the destination receiver, respectively. We develop lower and upper bounds on the capacity region in each setting. In particular, the cutset upper bound and the decode-forward lower bound are derived for the primitive relay channel. Furthermore, we present an entanglement-formation lower bound, where a virtual channel is simulated through the conference link. At last, we show that as opposed to the multiple access channel with entangled encoders, entanglement between decoders does not increase the classical communication rates for the broadcast dual.
For classical point-to-point channels, it has been shown by Bennett et al. that quantum entanglement assistance cannot improve their capacity, and by Cubitt et al. that entanglement assistance cannot activate (increase from zero to non-zero) their zero-error capacity. In contrast, we show that for classical point-to-point channels with causal CSIT (channel state information at the transmitter), quantum entanglement assistance can in some cases improve their capacity, and in some cases activate their zero-error capacity.
Communication over a fully quantum relay channel is considered. We establish three bounds based on different coding strategies, i.e., partial decode-forward, measure-forward, and assist-forward. Using the partial decode-forward strategy, the relay decodes part of the information, while the other part is decoded without the relay’s help. The result by Savov et al. (2012) for a classical-quantum relay channel is obtained as a special case. Based on our partial decode-forward bound, the capacity is determined for Hadamard relay channels. In the measure-forward coding scheme, the relay performs a sequence of measurements and then sends a compressed representation of the measurement outcome to the destination receiver. The measure-forward strategy can be viewed as a generalization of the classical compress-forward bound. At last, we consider quantum relay channels with orthogonal receiver components. The assist-forward bound is based on a new approach, whereby the transmitter sends the message to the relay and simultaneously generates entanglement assistance between the relay and the destination receiver. Subsequently, the relay can transmit the message to the destination receiver with rate-limited entanglement assistance.
The capacity of a channel is known to be equivalent to the highest rate at which it can generate entanglement. Analogous to entanglement, the notion of a causality measure characterizes the temporal aspect of quantum correlations. Despite holding an equally fundamental role in physics, temporal quantum correlations have yet to find their operational significance in quantum communication. Here we uncover a connection between quantum causality and channel capacity. We show the amount of temporal correlations between two ends of the noisy quantum channel, as quantified by a causality measure, implies a general upper bound on its channel capacity. The expression of this new bound is simpler to evaluate than most previously known bounds. We demonstrate the utility of this bound by applying it to a class of shifted depolarizing channels, which results in improvement over previously known bounds for this class of channels.
Communication over a fully quantum relay channel is considered. We establish three bounds based on different coding strategies, i.e., partial decode-forward, measure-forward, and assist-forward. Using the partial decode-forward strategy, the relay decodes part of the information, while the other part is decoded without the relay's help. Based on our partial decode-forward bound, the capacity is determined for Hadamard relay channels. In the measure-forward coding scheme, the relay performs a sequence of measurements and then transmits a compressed representation. At last, the assist-forward bound is based on a new approach, whereby the transmitter sends the message to the relay and simultaneously generates entanglement assistance between the relay and the destination receiver. Subsequently, the relay can transmit with rate-limited entanglement assistance.
Entanglement shared between the two ends of a quantum-communication channel has been shown to be a useful resource in increasing both the quantum and classical capacities for these channels. The entanglement-assisted capacities were derived assuming an unlimited amount of shared entanglement per channel use. In this paper, bounds are derived on the minimum amount of entanglement required per use of a channel, in order to asymptotically achieve the capacity. This is achieved by introducing a class of entanglement-assisted quantum codes. Codes for classes of qubit channels are shown to achieve the quantum entanglement-assisted channel capacity when an amount of shared entanglement per channel given by, ${\mathcal{E}}_{Q}^{\mathrm{Random}}>~1\ensuremath{-}{Q}_{E},$ is provided. It is also shown that for very noisy channels, as the capacities become small, the amount of required entanglement converges for the classical and quantum capacities.