--- title: Quantum Relay Channels Overview url: https://www.emergentmind.com/topics/quantum-relay-channels type: topic --- # Quantum Relay Channels Overview Searching arXiv for recent and foundational papers on quantum relay channels to support the article. Quantum relay channels are communication models in which an intermediate node assists transmission between remote parties, but the operational meaning of “relay” varies sharply across subfields. In quantum key distribution, a relay may be a trusted intercept/resend node or a passive optical station; in classical–quantum network information theory, it is a helper between a source and a destination in a memoryless channel with classical inputs and quantum outputs; in fully quantum settings, it is a strictly causal quantum processor inserted into a CPTP map \(\mathcal{N}_{AD\rightarrow BE}\); and in continuous-variable architectures, it is often a measurement node performing a Bell detection and broadcasting classical outcomes [1203.0628], [1208.4188], [1201.0011], [2411.16263], [1509.01113]. Across these formulations, the central issue is the same: how an intermediate station changes achievable distance, rate, or capacity without violating no-cloning, while the detailed answer depends on whether the relay measures, forwards, compresses, localizes entanglement, or distributes side information. ## 1. Conceptual scope and canonical models A quantum relay channel is not a single primitive but a family of channel models. In one broad line of work, the relay channel is a **classical–quantum relay channel** with classical inputs at the source and relay and quantum outputs at the relay and destination, specified by a map \[ \mathcal{N}^{XX_1 \to B_1B} : (x,x_1) \mapsto \rho^{B_1B}_{x,x_1}, \] with memoryless extension over \(n\) uses [1201.0011]. In a more general formulation, a **fully quantum relay channel** is a CPTP map \[ \mathcal{N}_{AD\rightarrow BE} : \mathfrak{D}(\mathcal{H}_A\otimes\mathcal{H}_D)\to\mathfrak{D}(\mathcal{H}_B\otimes\mathcal{H}_E), \] where Alice transmits on \(A\), the relay transmits on \(D\) and receives \(E\), and Bob receives \(B\); the channel is memoryless and the relay is strictly causal [2411.16263]. A related primitive appears in the quantum broadcast-with-cooperation setting, where the **primitive relay channel** is obtained from a broadcast channel with conferencing by setting the relay’s own message rate to zero, so that the relay serves only to help the destination [2011.09233]. These information-theoretic models coexist with operational relay architectures from quantum cryptography and optical networking. Barnett and Phoenix consider a linear chain \[ \text{Alice} - R_1 - R_2 - \dots - R_{n-2} - \text{Bob}, \] where each \(R_j\) measures in a BB84 basis and resends a fresh photon, making the overall connection a series composition of quantum channels punctuated by measure-and-prepare maps [1203.0628]. In continuous-variable measurement-device-independent QKD, the relay instead receives two incoming modes and performs a CV Bell detection, publishing a classical outcome \(\gamma\) that correlates the users’ data [1509.01113]. In underwater optics, passive relays perform no measurement at all: they collect, re-collimate, and redirect qubits so that the end-to-end channel is a concatenation of lossy turbulent links rather than a sequence of measurement–reprepare operations [2206.06514]. This variety suggests that “quantum relay channel” is best understood as an umbrella term. A plausible implication is that the decisive classification is not the mere presence of an intermediate node, but whether the relay is **trusted or untrusted**, **measurement-based or coherence-preserving**, and **analyzed as a network protocol or as a Shannon-theoretic channel model**. ## 2. Trusted intercept/resend relays and passive optical relays in QKD In BB84-based relay networks, Barnett and Phoenix analyze **active relays** that act as trusted intercept/resend devices: each relay receives a photon, measures it in a randomly chosen BB84 basis, prepares a new photon in the measured state, and sends it onward [1203.0628]. Although this operation is identical to an eavesdropper’s intercept/resend attack at the quantum layer, the relay is assumed to be trusted and cooperative, and participates in classical post-processing. In the naive view, end-to-end usability appears to decay exponentially because only transmissions for which all nodes choose the same basis are directly useful, with probability \(1/2^{n-1}\) for \(n\) total nodes [1203.0628]. Barnett and Phoenix argue that this pessimism is unwarranted: by cooperative post-processing that pairs timeslots and performs logical bit “flips,” all timeslots except fully alternating basis patterns can be marshaled into an Alice–Bob key, so that the usable fraction is restored to exactly \(1/2\), the same as in standard BB84 [1203.0628]. The associated distance argument is also modified: relays need not resend only when they detect a photon, but can use **delay/batching** or **padding**, so that the second hop maintains acceptable SNR even when the first hop is lossy [1203.0628]. The later paper on **bit transport** generalizes this viewpoint to relay QKD networks by treating each relay as a “trusted eavesdropper” and explicitly pairing partially open basis configurations with dual configurations [1502.06319]. In that construction, a relay can tell Alice and Bob which timeslot pair to use so that a bit value is effectively transported across a broken link without revealing the bit itself. The result is again that the asymptotic sifted key fraction is \(1/2\), independent of the number of relays, rather than \(2^{-(n+1)}\) under a naive all-bases-match criterion [1502.06319]. The same work also studies random relay drop-out and secret-sharing over logical channels; for a channel that needs \(n-1\) relays to span the distance, adding one extra relay and using XOR-combined shares can force an adversary to compromise all relays on that path, at the price of a reduced fraction of useful timeslots [1502.06319]. A physically different QKD relay appears in underwater free-space optics. There the intermediate nodes are **passive relays** that simply redirect the qubits to the next relay or receiver without any measurement [2206.06514]. The end-to-end link of total length \(L\) is divided into \(K+1\) equal hops of length \(l=L/(K+1)\), with per-hop transmissivity \[ \gamma = h(l)\hat{\mu}, \] where \(h(l)\) accounts for absorption and scattering and \(\hat{\mu}\) for turbulence-induced fading [2206.06514]. The fraction of photons reaching Bob becomes \[ \gamma_{\text{Bob}} = \gamma^{K+1} = \left(h(l)\hat{\mu}\right)^{K+1}, \] while background photons accumulate across hops [2206.06514]. The QBER analysis shows a trade-off: in non-turbulent clear ocean, relaying does not improve distance, whereas under strong turbulence a small number of relays can improve maximum secure distance because shorter hops improve the turbulence-averaged coupling \(\mu\) enough to offset extra background [2206.06514]. This architecture preserves end-to-end security precisely because the relays are non-measuring. Taken together, these QKD relay models mark three distinct regimes: trusted active relays that classicalize each hop, trusted-node architectures that rely on bit transport or secret-sharing, and passive relays that remain transparent to the quantum state. This suggests that in cryptographic settings, the word “relay” chiefly denotes a constraint on **network trust and optical processing**, rather than a unique channel law. ## 3. Classical–quantum relay channels and partial decode-forward The cq relay channel entered quantum network information theory through coding theorems that adapt classical relay strategies to channels with classical inputs and quantum outputs. In the thesis on classical–quantum channels, the relay channel is defined by finite alphabets \(\mathcal{X}\) and \(\mathcal{X}_1\) and bipartite output states \[ \rho_{x,x_1}^{B_1B} \equiv \mathcal{N}^{XX_1\to B_1B}(x,x_1), \] with the relay seeing \(B_1\) and the destination seeing \(B\) [1208.4188]. The communication task is reliable transmission of a classical message \(M\) from source to destination using a block-Markov code, relay POVMs, and destination sliding-window measurements over two consecutive blocks [1208.4188]. The main achievable result is a **partial decode-forward inner bound** \[ R \le \max_{p(u,x,x_1)} \min\left\{ I(XX_1;B)_\theta,\; I(U;B_1|X_1)_\theta + I(X;B|X_1U)_\theta \right\}, \] with respect to the cq state \[ \theta^{UXX_1B_1B} = \sum_{x,u,x_1} p(u,x,x_1)\, \ketbra{u}{u}^U\otimes \ketbra{x}{x}^X\otimes \ketbra{x_1}{x_1}^{X_1}\otimes \rho_{x,x_1}^{B_1B} \] [1208.4188], [1201.0011]. The first term is a multiple-access-type bound at the destination, while the second decomposes into the rate at which the relay can decode the auxiliary \(U\) plus the residual direct rate from source to destination once \(U\) and \(X_1\) are known [1208.4188]. Savov, Wilde, and Vu formulate the same channel as a cc–qq relay channel and prove the same partial decode-forward structure using randomized block-Markov codebooks, HSW decoding at the relay, and a sliding-window “AND”-measurement at the destination [1201.0011]. The relay’s decoder is a standard square-root measurement built from typical projectors for the cq ensemble seen on \(B_1\), giving the constraint \[ R_\ell \le I(U;B_1|X_1)_\theta \] for the partial message rate [1201.0011]. The destination then performs a joint square-root measurement on two consecutive blocks, combining a test for the source message in block \(j\) with a test for the relay-forwarded partial message in block \(j+1\), which yields the overall bound quoted above [1201.0011]. The use of conditional typical projectors, the Hayashi–Nagaoka inequality, and the gentle operator lemma is the quantum analogue of the classical relay packing argument [1201.0011]. A distinct but related cq relay model appears in two-phase bidirectional relaying. There the first phase is a cq multiple-access channel \(N_{Y_2Y_1-X}\) from two terminals to the relay, and the second phase is a cq broadcast channel \(N_{X-Y_1Y_2}\) from the relay back to the terminals [1401.3682]. The broadcast-phase capacity region is determined by the individual Holevo quantities to the two receivers: \[ R_1 \le \limsup_{n\to\infty}\frac{1}{n}\chi(P^n;\sigma^{Y_1^{\otimes n}}),\qquad R_2 \le \limsup_{n\to\infty}\frac{1}{n}\chi(P^n;\sigma^{Y_2^{\otimes n}}) \] [1401.3682]. The overall bidirectional rate region is the intersection of the MAC and BC regions [1401.3682]. This is still decode-and-forward, but in a half-duplex bidirectional topology rather than a one-way relay chain. These cq results establish a consistent pattern: the relay channel is treated as a multi-user coding problem, the relay decodes either a whole message or an auxiliary layer, and the quantum novelty lies not in the high-level strategy but in the use of joint measurements and Holevo-information bounds. A plausible implication is that for classical communication over quantum networks, the main challenge is often **decoder design**, whereas the combinatorial structure of relay coding remains recognizably classical. ## 4. Fully quantum relay channels, quantum cooperation, and relay-specific bounds The fully quantum relay channel replaces classical channel inputs by quantum systems at both sender and relay. In Pereg’s formulation, the channel is a CPTP map \[ \mathcal{N}_{AD\rightarrow BE}, \] used memorylessly, with a strictly causal relay that chooses each input \(D_i\) from past outputs \(E_1,\dots,E_{i-1}\) [2411.16263]. The communication task is **quantum communication** from Alice to Bob: Alice encodes a quantum message system \(M\), the relay applies a sequence of CPTP maps \(\Gamma^{(i)}\), and Bob decodes an approximate copy \(\hat{M}\), with error measured in trace distance against a reference-purified state [2411.16263]. The main contribution is a fully quantum **decode-forward** scheme based on FQSW and block-Markov coding, yielding the achievable unassisted rate \[ \mathsf{Q}_{\text{D-F}}(\mathcal{N}) = \max_{|\sigma\rangle_{A_1 A D}} \min\left\{ I(A_1\rangle B)_\omega,\; I(A_1\rangle E)_\omega \right\}, \] where \(\omega_{A_1BE}=\mathcal{N}_{AD\rightarrow BE}(\sigma_{A_1AD})\) [2507.06770]. In the entanglement-assisted case the paper gives \[ \mathsf{Q}_{\text{EA,D-F}}(\mathcal{N}) = \max_{|\sigma\rangle_{A_1 A D}} \left[ \frac{1}{2} I(A_1;B)_\omega - \frac{1}{2} I(A_1;D)_\sigma \right], \] again as an achievable rate [2507.06770]. The same framework is interpreted as coding with quantum side information, because \(A_1\) can be entangled with the relay input \(D\) and thereby act as distributed side information for the transmitter [2507.06770]. A broader information-theoretic treatment is given in “Quantum Relay Channels,” which studies the fully quantum model \[ \mathcal{N}_{AD\rightarrow BE} \] for classical communication and develops three lower bounds: **partial decode-forward**, **measure-forward**, and **assist-forward** [2411.16263]. The partial decode-forward bound generalizes the Savov–Wilde–Vu cq result and reduces to it in the c-q special case [2411.16263]. For a c-q relay channel \(\mathcal{N}_{XX_1\to BE}\), the bound is \[ C(\mathcal{N})\geq \max_{p_{UXX_1}} \min\left\{ I(XX_1;B)_\omega,\; I(U;E|X_1)_\omega + I(X;B|X_1U)_\omega \right\} \] [2411.16263]. The **measure-forward** strategy is explicitly presented as a generalization of classical compress-forward: the relay measures its quantum output \(E\), compresses the resulting classical outcome, and forwards that compressed description to Bob, with an achievable rate \(I(X_0;Z_1B|X_1)_\omega\) subject to a compression constraint [2411.16263]. The **assist-forward** bound is developed for channels with orthogonal receiver components \[ \mathcal{N}_{AD\to B_1B_2E} = \mathcal{M}_{A\to B_1E}\otimes \mathcal{P}_{D\to B_2}, \] and uses the broadcast component to send the message to the relay while simultaneously generating entanglement between relay and Bob, which is then consumed as rate-limited entanglement assistance over \(\mathcal{P}_{D\to B_2}\) [2411.16263]. This paper also identifies a class where capacity is known exactly: for **Hadamard relay channels**, full decode-forward is optimal and \[ C(\mathcal{N})= \max_{p_{X_0X_1},\,\theta_A^{x_0}\otimes\zeta_D^{x_1}} \min\left\{ I(X_0X_1;B)_\omega,\; I(X_0;Y_1|X_1)_\omega \right\} \] [2411.16263]. By contrast, the primitive relay channel derived from a quantum broadcast channel with receiver cooperation yields a multi-letter **cutset upper bound** \[ C_{\mathrm{Q}}(\mathcal{N}^{\text{relay}}) \le \lim_{n\to\infty} \sup_{\rho_{ATA'^n}} \frac{1}{n} \min\Bigl\{ I(AT\rangle B_2^n)_\rho + C_{Q,12},\; I(A\rangle B_1^nB_2^n)_\rho \Bigr\}, \] and a single-letter **decode-forward lower bound** \[ C_{\mathrm{Q}}(\mathcal{N}^{\text{relay}}) \ge \max_{|\phi_{A_1A_2A'}\rangle} \Bigl[ I(A_2\rangle B_2)_\rho + \min\bigl(I(A_1\rangle B_1)_\rho,\; C_{Q,12}\bigr) \Bigr] \] [2011.09233]. That formulation explicitly interprets the relay as a quantum repeater with a bottleneck between the sender–relay coherent information and the relay–destination conference link [2011.09233]. Across these fully quantum developments, the relay is no longer a measurement station or trusted node but a strictly causal quantum processor. This suggests that the modern theory of relay channels is converging on a sharper distinction between **classical relays that manage secrecy or distance** and **fully quantum relays that manage coherent information and entanglement topologies**. ## 5. Continuous-variable, measurement-based, and environment-assisted relay channels A major family of quantum relay channels is measurement-based and continuous-variable. In the ideal local-relay limit of CV-MDI-QKD, Alice and Bob send coherent states to a relay that performs a CV Bell detection and broadcasts the outcome \(\gamma\) [1509.01113]. The relay is local to Alice, Alice’s channel is lossless, and the Bell detection is ideal, allowing the authors to characterize the ultimate performance benchmark for the protocol [1509.01113]. The key rate under large modulation and ideal reconciliation is \[ R = h\!\left( \frac{\chi}{1+\tau} - 1 \right) - h\!\left[ \frac{\tau \chi - (1+\tau)^2}{1-\tau^2} \right] + \log_2\!\left[ \frac{2(1+\tau)}{e(1-\tau)\chi} \right], \] with \(\chi=\chi_{\text{loss}}+\varepsilon\) and \[ \chi_{\text{loss}} = \frac{2(1+\tau)}{\tau}, \] while in the pure-loss case it simplifies to \[ R_{\text{loss}} = h\!\left( \frac{2-\tau}{\tau} \right) + \log_2\!\left[\frac{\tau}{(1-\tau)e}\right] \] [1509.01113]. The rate remains positive for all \(\tau>0\) in this idealized model, decaying with Bob’s channel transmissivity [1509.01113]. Conceptually, the relay is a measurement node with classical output only; it does not preserve or forward quantum states, but still constitutes a quantum relay channel because the relay’s joint measurement is what creates the correlations between remote users. A more general and striking CV relay phenomenon appears in environment-assisted bosonic communications. There the relay channel is a two-input bosonic Gaussian channel \( \mathcal{E}_{AB} \) feeding a CV Bell measurement at Charlie, with correlated Gaussian noise injected by a separable environment \[ \mathbf{V}_{E_1E_2}(\omega,g,g') = \begin{pmatrix} \omega \mathbf I & \mathbf G\\ \mathbf G & \omega \mathbf I \end{pmatrix}, \qquad \mathbf G=\mathrm{diag}(g,g') \] [2003.09246]. In the memoryless case \(g=g'=0\), sufficiently large thermal noise makes each link entanglement-breaking. The paper shows that **separable correlations** in the environment can reactivate the relay: although all bipartite and tripartite entanglement are lost, strong enough environmental correlations can generate quadripartite \(1\times 3\) entanglement, which the relay’s Bell detection then localizes into bipartite entanglement between Alice and Bob [2003.09246]. For the conditional swapped state, the smallest partially transposed symplectic eigenvalue is \[ \varepsilon(\mu,\kappa,\kappa') = \sqrt{\frac{(1+\mu\kappa)(1+\mu\kappa')}{(\mu+\kappa)(\mu+\kappa')}}, \] with \[ \kappa = (\tau^{-1}-1)(\omega-g),\qquad \kappa' = (\tau^{-1}-1)(\omega+g'), \] and the large-\(\mu\) limit \[ \varepsilon_{\rm opt} = \sqrt{\kappa\kappa'} \] determines swapping, teleportation, distillation, and QKD thresholds [2003.09246]. The work further shows that in the correlated-additive-noise limit the practical QKD rate can surpass the **single-repeater bound** derived for memoryless links, because correlated noise turns a relay that would be dead under independent entanglement-breaking channels into a usable non-Markovian resource [2003.09246]. Measurement-based relays also appear in modern untrusted architectures using quantum dot single-photon sources. In a five-node network with trusted users Alice and Bob and three untrusted intermediate nodes \(N_S\), \(M_A\), and \(M_B\), the central source node emits a single photon that is split toward two measurement stations, where it interferes with users’ coherent states [2508.21479]. Each measurement node announces whether a valid click occurred and which detector fired, and Alice and Bob retain rounds with valid dual-node events and suitable phase relations [2508.21479]. The security analysis treats all three intermediate nodes as one untrusted Bell-state measurement box and applies a phase-matching/MDI proof, with key fraction \[ r = 1 - h(e_p) - f\,h(E_Z) \] [2508.21479]. This realizes a multi-node relay channel in which the relay operation is entirely measurement-based and untrusted. These CV and measurement-based results reinforce a recurring theme: a relay need not preserve a flying qubit or store quantum information to be a genuine quantum relay. In many practically relevant architectures, the relay’s power comes from **joint measurement**, **correlation localization**, or **non-Markovian noise structure**, not from direct forwarding of a quantum state. ## 6. Experimental implementations, network architectures, and open issues Several experimental lines instantiate quantum relay channels in distinct physical forms. A teleportation-based relay at telecom wavelength uses a quantum dot emitting polarization-entangled photon pairs in the telecom O-band, with a partial Bell-state measurement between Alice’s weak coherent pulse and one photon of the entangled pair, teleporting the state to Bob’s photon [1704.07765]. The process tomography shows a dominant \(\sigma_x\) component \[ \chi_{xx} = 0.754 \pm 0.016, \] corresponding to an average gate fidelity \[ F_{\text{avg}} = 83.6 \pm 1.1\% \] to the ideal bit-flip teleporter, while the maximum fidelity for a standard 4-state protocol reaches \(94.5\%\) [1704.07765]. This is a memoryless quantum relay in the traditional teleportation sense: it uses entanglement and a Bell-state measurement but has no quantum memory and does not qualify as a full repeater [1704.07765]. The recent untrusted intermediate relay architecture using a quantum dot single-photon source realizes a five-node network with total fiber lengths of 100, 200, and 300 km and effective total losses of 19.34, 35.58, and 52.33 dB, respectively [2508.21479]. The source is an InAs/GaAs quantum dot frequency-converted to 1550.2 nm, with \[ g^{(2)}(0)=0.0015 \] and intrinsic indistinguishability about \(98.6\%\) [2508.21479]. The experiment reports secure key establishment over 300 km and highlights a modular architecture in which a five-node unit can be extended into longer chains or star-like topologies [2508.21479]. The interference statistics, gains \(Q_\mu\), bit error rates \(E_Z\), and phase error estimates \(e_p\) play the role of operational channel descriptors rather than an explicit CPTP relay-channel law [2508.21479]. On the theoretical side, private coding for quantum relay networks introduces a different kind of relay limitation: a probabilistic relay encoder \(\mathcal{E}_2\) that adds amplitude information only with probability \(p_{\mathcal{E}_2}\), initially assumed in the regime \(0