Quantum teleportation and Bell measurements are considered in a noisy relay setting. We introduce two quantum relay-channel models with closed-form capacity formulas, motivated by the canonical quantum communication protocols of teleportation and superdense coding. In both models, the sender transmits a qubit, while the relay observes side information about the Pauli errors that occur in the channel and communicates with the receiver through an orthogonal rate-limited link. We develop a compress-forward coding scheme in which the relay compresses the Pauli-error sequence into bins and sends the bin index to the receiver. The receiver uses this partial error information to reduce the effective channel noise before quantum decoding. We show that this strategy is optimal by establishing matching converse bounds for both models.
Quantum teleportation and Bell measurements are considered in a noisy relay setting. We introduce two quantum relay-channel models with closed-form capacity formulas, motivated by the canonical quantum communication protocols of teleportation and superdense coding. In both models, the sender transmits a qubit, while the relay observes side information about the Pauli errors that occur in the channel and communicates with the receiver through an orthogonal rate-limited link. We develop a compress-forward coding scheme in which the relay compresses the Pauli-error sequence into bins and sends the bin index to the receiver. The receiver uses this partial error information to reduce the effective channel noise before quantum decoding. We show that this strategy is optimal by establishing matching converse bounds for both models.
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.
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.
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.
This paper investigates the feasibility and potential benefits of employing quantum relays to enhance secure communication over noisy channels. Traditional direct quantum communication suffers from signal degradation and loss over extended distances, severely limiting its practical application. We propose a novel architecture utilizing quantum entanglement and measurement feedback, where a relay node acts as an intermediary to amplify and correct quantum signals. The core concept involves establishing entanglement between the sender, receiver, and the relay. Measurements performed by the relay, coupled with feedback, enable the relay to effectively combat channel noise and preserve the integrity of the transmitted quantum information. We formally describe the key protocols and mathematical formulations involved, emphasizing the role of entanglement distillation and quantum error correction. The presented approach offers a promising pathway to overcoming the distance limitations of direct quantum communication and establishing secure quantum networks. This work focuses on theoretical development and lays the groundwork for future experimental investigations.
Quantum relays are central to both quantum communication and distributed quantum computing, enabling long-distance transmission and modular architectures. Unlike classical repeaters, quantum repeaters preserve coherence without amplifying quantum information, relying on entanglement swapping and quantum error correction to overcome loss and decoherence. In this work, we investigate the transmission of quantum information via quantum relay channels. Our three-terminal relay model captures the trade-off between repeater-assisted and repeaterless communication strategies. Specifically, we propose a partial decode-forward strategy, in which quantum ``message system" consists of two components. The first component is decoded by the relay and then sent to the destination receiver, whereas the second component is decoded by the destination receiver without the relay's help. We analyze both entanglement-assisted and unassisted scenarios. As a special case, the full decode-forward strategy is recovered, with the relay decoding, re-encoding, and forwarding the entire message. Our framework allows for different entanglement topologies between the transmitter, the relay and the destination receiver, recovering known results on entanglement-assisted and unassisted communication. Furthermore, we discuss the interpretation of coding with quantum side information. These findings provide a foundation for designing secure, efficient, and reliable quantum networks and for realizing practical quantum repeaters and long-range quantum key distribution.
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.