Quantum Teleportation Over a Noisy Relay Channel

AI summary

Overview

Research area: Quantum information theory — specifically quantum Shannon theory, relay channels, and capacity theorems for quantum communication.

Technical level: Advanced. The paper assumes fluency in quantum entropy, coherent information, quantum channel capacities, and classical network information theory (typicality, covering lemmas, converses).

Scope (one sentence): The paper introduces two quantum relay-channel models in which a relay holds classical side information about Pauli errors and forwards a compressed description over a rate-limited link, and derives closed-form capacities for both, with matching achievability and converse proofs.

What This Paper Is About

Quantum teleportation and superdense coding both rely on a receiver learning which Pauli error occurred so it can be corrected. The paper asks what happens when that error information must travel through a relay that can only send a limited number of classical bits per channel use. It models this as a "primitive" relay channel — the sender transmits qubits, the relay observes the error flags and talks to the receiver over a separate orthogonal link of rate R_0 ∈ [0, 2] — and determines exactly how many qubits (or classical bits) can be reliably communicated.

Key Contributions

1. Two new quantum relay-channel models. A dephasing relay channel (Figure 2), motivated by teleportation with imperfect correction communication, where the relay observes a phase-flip flag ℓ ~ Bernoulli(q_Z); and a depolarizing relay channel (Figure 3), motivated by superdense coding with a noisy Bell measurement, where the relay observes side information on a Pauli error pair (k, ℓ).

2. Closed-form quantum capacity for the dephasing relay channel: C_Q = min{1, 1 - h_2(q_Z) + R_0}, valid for q_Z ∈ (0, 1/2), where h_2 is the binary entropy function.

3. Closed-form entanglement-assisted classical capacity for the Pauli relay channel: C_EA = min{2, 2 - h_2(q_X) - h_2(q_Z) + R_0} for independent bit- and phase-flip errors, and C_EA = min{2, 2 - h_4(3q/4) + R_0} for depolarizing noise, where h_d(t) = -(1-t)log(1-t) - t log(t/(d-1)).

4. A quantum compress-forward scheme and matching converses. The relay compresses the Pauli-error sequence into bins and sends only the bin index; the receiver uses this partial error information to reduce the effective noise before quantum decoding. Converse bounds prove this is optimal for both models, unlike the decode-and-forward schemes in the authors' prior relay work.

Main Findings

• Relay rate converts directly into capacity. Each additional bit per channel use on the relay link raises the capacity by one unit, until the noiseless limit is reached. The capacity curves in Figures 6–7 increase linearly in R_0 up to a saturation point.

• Dephasing relay channel saturates at 1 qubit per channel use. If R_0 ≥ h_2(q_Z), the relay can send the entire error sequence ℓ^n by lossless compression, the receiver cancels the error completely, and C_Q = 1.

• Dephasing capacity formula: for R_0 < h_2(q_Z), C_Q = 1 - h_2(q_Z) + R_0. Figure 4 plots this against q_Z at a relay limit of R_0 = 0.4 bits per channel use.

• Depolarizing relay channel saturates at 2 bits per qubit channel use, matching noiseless superdense coding, once the relay link is fast enough.

• Fully depolarizing noise is rescued by the relay. For q = 1, C_EA = R_0, whereas without the relay the capacity is zero in this case. Figure 7 plots C_EA versus R_0 at depolarization probability q = 0.3.

• The achievability argument uses channel decomposition. For the dephasing case, the phase-flip variable L is written as L = T ⊕ V with independent T ~ Bernoulli(α) and V ~ Bernoulli(β), β = (q_Z - α)/(1 - 2α), where α satisfies h_2(α) = h_2(q_Z) - R_0 + ε. The relay conveys enough about V (via the covering lemma, requiring R_0 > I(V;L) = h_2(q_Z) - h_2(α)) that the residual channel is a dephasing channel with flip probability α, giving rate Q = 1 - h_2(α) = 1 - h_2(q_Z) + R_0 - ε.

• The multi-error case splits the relay budget. For independent bit- and phase-flip errors, the relay rate is divided as λR_0 and (1-λ)R_0 with λ = (h_2(q_X) - δ)/R_0, yielding R = 2 - h_2(α_X) - h_2(α_Z) = 2 - h_2(q_X) - h_2(q_Z) + R_0 - 2ε. For depolarizing noise, the residual noise parameter satisfies β = (q - α)/(1 - α) and h_4(3α/4) = h_4(3q/4) - R_0 + ε.

• Converse via coherent information. For the quantum case, Q ≤ min{1, (1/n) I_c(Z^{⊗n}) + R_0} + ε(n), and I_c(Z^{⊗n}) = n[1 - h_2(q_Z)] for the dephasing channel. For the entanglement-assisted case, R ≤ min{2, I(D) + R_0} + ε(n), with I(D) = 2 - h_4(3q/4) for the depolarizing channel.

• No experimental or numerical simulation data is reported. All results are analytical; the figures are plots of the closed-form capacity expressions, and no datasets, benchmarks, or hardware demonstrations appear in the paper.

Methodology in Plain English

The authors take the standard teleportation story — Alice's Bell measurement produces a two-bit outcome (k, ℓ), and Bob must apply X^k Z^ℓ to recover the state — and insert a bottleneck. Alice still sends the state, but the error information has to pass through a relay that only has a narrow classical pipe to Bob.

The coding strategy is a quantum version of "compress-forward." Rather than decoding the transmitted message (as decode-and-forward relays do), the relay treats the Pauli error string as data to be compressed. It looks at the string of errors it observed and finds a matching codeword in a pre-agreed random codebook, then sends only that codeword's index. Bob applies corrections according to the codeword he is told, which cancels part of the noise. What remains is a weaker, well-understood channel — a dephasing channel with flip probability α in the first model, a Pauli channel with reduced flip probabilities α_X, α_Z in the second — whose capacity is already known. Combining the two gives the final rate.

To prove nothing better is possible, they bound what any protocol could achieve. The receiver's classical message from the relay can contribute at most nR_0 bits, expressible through a chain-rule bound H(M|B^n S_0) ≥ H(M|B^n) - nR_0. The quantum part is bounded by the coherent information of the channel without the relay, and the classical part by the depolarizing channel's mutual information. Both bounds match the achievable rates, closing the problem.

Why This Matters

Impact on research. The paper gives a rare thing in quantum network information theory: exact, closed-form capacities for a nontrivial multi-node quantum setting. Most quantum relay results are achievable-rate characterizations or single-letter expressions that are not computable; here the multi-letter bottleneck collapses because the relay's side information is classical and the noise is Pauli. It also establishes a clean separation between decode-and-forward and compress-forward in the quantum domain, showing that when the relay's job is to describe noise rather than data, compression is the right primitive.

Potential applications (implied by the models, not demonstrated in the paper):

• Quantum repeaters and long-distance quantum communication, where intermediate nodes must help without full error-correction capability.
• Teleportation-based quantum networking with imperfect classical correction channels, where the two-bit Bell outcome is partially lost.
• Entanglement-assisted classical communication and superdense coding over links with noisy Bell-state discrimination.
• Design of quantum network architectures where control-plane classical bandwidth is the scarce resource and must be budgeted between bit-flip and phase-flip information.

Industry relevance. The results give network architects a concrete exchange rate — one classical bit per channel use on the relay link buys exactly one unit of capacity — which is directly useful for provisioning classical control channels in quantum hardware and network deployments. The explicit treatment of rate-limited, orthogonal classical links mirrors how real quantum nodes are wired: a quantum channel plus a separate authenticated classical channel.

Future Directions

• Beyond Pauli noise. The authors explicitly ask to what extent rate-limited information about the channel environment can increase quantum rates for more general noise models. Pauli structure is what makes the closed forms possible; arbitrary channels would need new techniques.
• Quantum side information at the relay. Allowing the relay to receive and process quantum rather than classical side information is proposed as a path toward capacities for more general quantum relay channels.
• General primitive quantum relay channels. The classical primitive relay channel's capacity remains unknown in general; this paper solves structured quantum instances, leaving the general quantum analogue open.
• Tightening the operational picture. The results assume an orthogonal, noiseless (or rate-limited) relay-to-receiver link and asymptotically long blocklengths; finite-blocklength behavior and non-orthogonal relay links are not treated.

Target Audience

Graduate students and researchers in quantum information theory and quantum Shannon theory; network information theorists interested in how classical relay results transfer to quantum settings; and quantum networking engineers who want a quantitative grip on how much classical side-channel bandwidth is worth relative to quantum channel quality. Readers without a background in coherent information and typicality will find Sections III and IV heavy going, though the capacity formulas and the discussion in Section V are accessible on their own.

Authors’ abstract

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.