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:2609.23459

Quantum Teleportation Over a Noisy Relay Channel

Yigal Ilin, Uzi Pereg

quant-phcs.ITSubmitted Sep 20, 2026• Announced Sep 22, 2026• 0 citations
arXivHTMLPDF

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.

AI Summary

The paper asks how much rate-limited classical information about channel noise can improve quantum communication. It studies primitive relay models in which a sender transmits qubits through a Pauli channel, a relay observes the error labels, and the receiver obtains an additional classical message at rate $R_0$ bits per channel use. The models are motivated by teleportation with restricted correction communication and noisy Bell-state discrimination in superdense coding. For dephasing with phase-flip probability $q_Z$, the quantum capacity is $C_Q=\min\{1,1-h_2(q_Z)+R_0\}$. For independent bit- and phase-flip errors, the entanglement-assisted classical capacity is $C_{\mathrm{EA}}=\min\{2,2-h_2(q_X)-h_2(q_Z)+R_0\}$. For depolarizing noise $\mathcal D_q(\rho)=(1-q)\rho+qI/2$, it is $C_{\mathrm{EA}}=\min\{2,2-H(1-3q/4,q/4,q/4,q/4)+R_0\}$. Thus relay communication increases capacity linearly until the noiseless limit is reached; for complete depolarization, $C_{\mathrm{EA}}=R_0$ within the stated range $0\leq R_0\leq2$. Achievability uses a compress-forward construction: the relay selects a compressed error representation from a classical codebook, and the receiver applies corresponding Pauli corrections before decoding the residual noise. Matching converses combine data processing, a bound of $nR_0$ on the information supplied by the relay, and known unassisted-channel capacity expressions. The results concern classical error-label side information and the specified Pauli-noise models. Extensions to more general noise and relays receiving or processing quantum side information are left open.

Little sign of AI-generated textStrong assumptionsPossible errorMissing comparison

Central claim may not hold: The achievability proofs incorrectly infer memoryless effective-channel closeness from empirical typicality, leaving the central decoding guarantee unproved for the block-correlated residual errors. The explicit relay-rate allocation in Section 3.2 can produce a negative allocation fraction and an invalid noise decomposition, although other allocations can satisfy the required constraints.

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

Related papers

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

Quantum Relays for Secure Communication in Noisy Channels

Jincheng Zhang

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.

•Sep 5, 2026•0 citations

Quantum Information Transmission Over Quantum Relay Channels

Yigal Ilin, Uzi Pereg

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.

arXiv:2507.06770•Jul 9, 2025•2 citations

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

Neural-Network Error Mitigation for Quantum Teleportation and Superdense Coding

Hritik Chaudhary, K. C. Gokul

Abstract Quantum teleportation and superdense coding are foundational protocols of quantum communication, but both degrade under channel imperfections. This paper examines whether a small neural network, acting purely as a classical post-processing layer, can mitigate such imperfections when it is given only the information a real receiver could collect. Both protocols are implemented exactly using tensor operations on complex qubit amplitudes, reproducing ideal noiseless behaviour. Realistic imperfections are then introduced and learned mitigation is evaluated under finite-shot conditions, so that the network observes a finite number of discrete measurement outcomes rather than exact probabilities, and is never supplied the noise parameters. The results identify a clear boundary on when learning helps. For superdense coding through a biased Pauli channel followed by asymmetric readout error, a learned decoder exceeds a majority-vote baseline in the low-shot regime, by roughly five percentage points at five shots, with both methods converging toward perfect accuracy as shots grow. For teleportation through a systematic gate miscalibration, the network learns to invert the miscalibration and raises mean state fidelity from about 0.93 to 0.99, with the gain increasing as additional shots reduce tomographic noise. A control experiment replacing the systematic miscalibration with a fully random per-qubit rotation yields no benefit, the expected outcome when noise carries no recurring structure. The findings indicate that lightweight learned post-processing is worthwhile specifically in the low-shot, structured-noise regime, and offers nothing when noise is structureless.

•Sep 2, 2026•0 citations

Quantum communication via noisy channels

Z. Shadman

Quantum communication is at the heart of the quantum information theory. We study two types of quantum communication protocols over noisy transmission channels, i.e. super dense coding and cryptography protocols. In the first part of this thesis, for various scenarios, it is discussed how the super dense coding capacity is influenced by noisy quantum channels. The case of memoryless channels as well as those channels with memory which are modelled by uncorrelated and correlated noise, respectively, are considered. Explicitly Pauli channels over arbitrary dimensions are treated and the super dense coding capacity for some resource states is derived. For the qubit depolarizing channel, when noise is uncorrelated, the super dense coding capacity with respect to the input state is also optimized. This illustrates a threshold value of the noise parameter below which the super dense coding capacity is optimized by a maximally entangled initial state, while above the threshold value the super dense coding capacity is optimized by a product state. For Pauli channels, with correlated noise, the case of non unitary encoding is studied and the super dense coding capacity is derived. The first part of this thesis is concluded with an example for multipartite super dense coding. In the second part of the thesis, the problem of optimal eavesdropping on noisy states in quantum key distribution is investigated. The case of the six state protocol, when the signal states are mixed with white noise, is considered. This situation may arise either when Alice deliberately adds noise to the signal states before they leave her lab, or, in a realistic scenario when the eavesdropper (referred to as Eve) is not assumed to replace the noisy quantum channel by a noiseless one. For individual attacks, we find Eve's optimal mutual information with Alice as a function of the quantum bit error rate. Finally, the results illustrate that adding noise on the quantum level can make quantum key distribution more robust against eavesdropping.

•Jan 1, 2011•0 citations
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.
The paper asks how much rate-limited classical information about channel noise can improve quantum communication. It studies primitive relay models in which a sender transmits qubits through a Pauli channel, a relay observes the error labels, and the receiver obtains an additional classical message at rate R0R_0R0​ bits per channel use. The models are motivated by teleportation with restricted correction communication and noisy Bell-state discrimination in superdense coding.
For dephasing with phase-flip probability qZq_ZqZ​, the quantum capacity is CQ=min⁡{1,1−h2(qZ)+R0}C_Q=\min\{1,1-h_2(q_Z)+R_0\}CQ​=min{1,1−h2​(qZ​)+R0​}. For independent bit- and phase-flip errors, the entanglement-assisted classical capacity is CEA=min⁡{2,2−h2(qX)−h2(qZ)+R0}C_{\mathrm{EA}}=\min\{2,2-h_2(q_X)-h_2(q_Z)+R_0\}CEA​=min{2,2−h2​(qX​)−h2​(qZ​)+R0​}. For depolarizing noise Dq(ρ)=(1−q)ρ+qI/2\mathcal D_q(\rho)=(1-q)\rho+qI/2Dq​(ρ)=(1−q)ρ+qI/2, it is CEA=min⁡{2,2−H(1−3q/4,q/4,q/4,q/4)+R0}C_{\mathrm{EA}}=\min\{2,2-H(1-3q/4,q/4,q/4,q/4)+R_0\}CEA​=min{2,2−H(1−3q/4,q/4,q/4,q/4)+R0​}. Thus relay communication increases capacity linearly until the noiseless limit is reached; for complete depolarization, CEA=R0C_{\mathrm{EA}}=R_0CEA​=R0​ within the stated range 0≤R0≤20\leq R_0\leq20≤R0​≤2.
Achievability uses a compress-forward construction: the relay selects a compressed error representation from a classical codebook, and the receiver applies corresponding Pauli corrections before decoding the residual noise. Matching converses combine data processing, a bound of nR0nR_0nR0​ on the information supplied by the relay, and known unassisted-channel capacity expressions.
The results concern classical error-label side information and the specified Pauli-noise models. Extensions to more general noise and relays receiving or processing quantum side information are left open.
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.
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.
Abstract Quantum teleportation and superdense coding are foundational protocols of quantum communication, but both degrade under channel imperfections. This paper examines whether a small neural network, acting purely as a classical post-processing layer, can mitigate such imperfections when it is given only the information a real receiver could collect. Both protocols are implemented exactly using tensor operations on complex qubit amplitudes, reproducing ideal noiseless behaviour. Realistic imperfections are then introduced and learned mitigation is evaluated under finite-shot conditions, so that the network observes a finite number of discrete measurement outcomes rather than exact probabilities, and is never supplied the noise parameters. The results identify a clear boundary on when learning helps. For superdense coding through a biased Pauli channel followed by asymmetric readout error, a learned decoder exceeds a majority-vote baseline in the low-shot regime, by roughly five percentage points at five shots, with both methods converging toward perfect accuracy as shots grow. For teleportation through a systematic gate miscalibration, the network learns to invert the miscalibration and raises mean state fidelity from about 0.93 to 0.99, with the gain increasing as additional shots reduce tomographic noise. A control experiment replacing the systematic miscalibration with a fully random per-qubit rotation yields no benefit, the expected outcome when noise carries no recurring structure. The findings indicate that lightweight learned post-processing is worthwhile specifically in the low-shot, structured-noise regime, and offers nothing when noise is structureless.
Quantum communication is at the heart of the quantum information theory. We study two types of quantum communication protocols over noisy transmission channels, i.e. super dense coding and cryptography protocols. In the first part of this thesis, for various scenarios, it is discussed how the super dense coding capacity is influenced by noisy quantum channels. The case of memoryless channels as well as those channels with memory which are modelled by uncorrelated and correlated noise, respectively, are considered. Explicitly Pauli channels over arbitrary dimensions are treated and the super dense coding capacity for some resource states is derived. For the qubit depolarizing channel, when noise is uncorrelated, the super dense coding capacity with respect to the input state is also optimized. This illustrates a threshold value of the noise parameter below which the super dense coding capacity is optimized by a maximally entangled initial state, while above the threshold value the super dense coding capacity is optimized by a product state. For Pauli channels, with correlated noise, the case of non unitary encoding is studied and the super dense coding capacity is derived. The first part of this thesis is concluded with an example for multipartite super dense coding. In the second part of the thesis, the problem of optimal eavesdropping on noisy states in quantum key distribution is investigated. The case of the six state protocol, when the signal states are mixed with white noise, is considered. This situation may arise either when Alice deliberately adds noise to the signal states before they leave her lab, or, in a realistic scenario when the eavesdropper (referred to as Eve) is not assumed to replace the noisy quantum channel by a noiseless one. For individual attacks, we find Eve's optimal mutual information with Alice as a function of the quantum bit error rate. Finally, the results illustrate that adding noise on the quantum level can make quantum key distribution more robust against eavesdropping.