2024/11/25 by Uzi Pereg, Pereg, Uzi · 2 citations
Computer Science · Engineering · #FOS: Computer and information sciences #FOS: Physical sciences #Information Theory (cs.IT) #Molecular Communication and Nanonetworks #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph) #Quantum-Dot Cellular Automata
paper · pdf · doi:10.48550/arxiv.2411.16263
openalex publication_date 2024/11/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.