Pith. sign in

REVIEW 1 major objections 5 minor 2 cited by

Quantum Relay Channels

T0 review · 1 major / 5 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The paper establishes the first exact capacity formula for Hadamard quantum relay channels, plus three lower bounds for general fully quantum relays.

desk verdict Solid new lower bounds for fully quantum relay channels, but the Hadamard capacity theorem has a load-bearing converse gap that is not fixed in this version. read the letter →

arxiv 2411.16263 v2 pith:HAWGNA44 submitted 2024-11-25 quant-ph cs.ITmath.IT

Uzi Pereg This is my paper · ORCID
classification quant-phcs.ITmath.IT MSC 81P4594A40 PACS 03.67.Hk03.67.-a
keywords quantumrelaychannelHadamardpartialdecode-forwardmeasure-forwardassist-forwardentanglementassistanceShannontheorycapacity
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper claims to give the first general rate bounds for a fully quantum relay channel—a three-terminal memoryless network in which the sender's and relay's transmissions are quantum systems and both receivers are quantum. It establishes three achievable-rate formulas: partial decode-forward, in which the relay decodes part of the message and re-encodes it; measure-forward, in which the relay measures its received system and sends a compressed classical description; and assist-forward, in which the sender uses the broadcast part of the channel to distribute entanglement between relay and destination before the relay transmits with that assistance. For the special class of Hadamard relay channels, where the relay's observation is classical and Bob's channel is a degraded version of the relay's, the partial decode-forward rate is shown to be tight, giving an exact single-letter capacity formula. A sympathetic reader should care because exact capacity formulas for fully quantum relay channels have been open until now, and relay limits are the basic building block for understanding multihop quantum networks and repeaters.

What carries the argument

The load-bearing machinery is block-Markov coding with a strictly-causal quantum relay: at time $i$ the relay encodes $D_i$ from its previously received systems $E^{i-1}$ together with 'leftover' systems $\bar E^{i-1}$ left by earlier encoding operations. Achievability rests on the quantum packing lemma (for decoding measurements) and the gentle measurement lemma (so that successive measurements do not destroy the state), organized with the quantum method of types. For Hadamard channels the converse exploits the degraded structure $N^H = P_{Y_1\to BY_1}\circ M_{AD\to Y_1}$ to reduce an arbitrary code to single-letter mutual information terms via the data-processing inequality, taking $X_0=M$ and $X_1=Y_1^{i-1}$. For assist-forward, the central formula is the rate-limited entanglement-assisted capacity, applied to the relay-to-destination link after Alice distributes entanglement through the broadcast component.

What would settle it

Exhibit a family of $(2^{nR},n,\varepsilon_n)$ codes for a Hadamard relay channel with $\varepsilon_n\to 0$ and $R$ strictly larger than the claimed maximin formula; the natural route is a code whose conditional input state, given $(M=m,Y_1^{i-1}=y^{i-1})$, has non-product correlation between $A_i$ and $D_i$, so that the Appendix C step $I(MB^{i-1};B_i)\le I(MY_1^{i-1};B_i)$ no longer dominates. Concretely, for a two-block code with entangled $AD$ inputs, compute whether the rate exceeds $\max\min\{I(X_0X_1;B),I(X_0;Y_1|X_1)\}$; any such example would refute the tightness of full decode-forward for Hadamard channels.

Watch

Extended reading notes

Core claim

The central discovery, stated as Theorem 3, is that a Hadamard relay channel $N^H_{AD\to BY_1}$—a fully quantum channel whose relay output is a classical letter $Y_1$ and which is degraded so that $N^H = P_{Y_1\to BY_1}\circ M_{AD\to Y_1}$—has capacity $$C(N)=\max_{p_{X_0X_1},\,\$theta^{{x_0}}$_A\otimes\$zeta^{{x_1}}$_D}\min\{ I(X_0X_1;B)_\omega,\; I(X_0;Y_1|X_1)_\omega \},$$ with the maximum over distributions $p_{X_0X_1}$ and product input states, and this is achieved by full decode-forward: the relay decodes the entire message and re-encodes it. For a general fully quantum relay channel, Theorems 1, 4, and 5 respectively establish the partial decode-forward lower bound $R_{\mathrm{PD-F}}$, the measure-forward lower bound $R_{\mathrm{M-F}}$, and the assist-forward lower bound $R_{\mathrm{A-F}}$; the last combines block-Markov coding, constant-composition coding, rate-limited entanglement assistance, and broadcast subspace transmission. The paper also derives the classical-quantum partial decode-forward bound as a special case, and it computes a closed-form measure-forward rate $1-h(p\ast q/2)$ for a depolarizing relay channel with orthogonal receiver components.

Load-bearing premise

The converse for the Hadamard capacity assumes that, conditioned on the message and the relay's past classical outputs, the sender's and relay's input states factorize as a product $\theta^{x_0}_A\otimes\zeta^{x_1}_D$; if a code uses entanglement between the $A$ and $D$ inputs across time blocks, that factorization can fail and the claimed exact formula would not follow from the proof.

Editorial extensions

If this is right

  • For every Hadamard relay channel, the capacity is a single-letter maximization over product input ensembles, and the full decode-forward strategy attains it; the relay's classical observation $Y_1$ is what limits the rate through $I(X_0;Y_1|X_1)$.
  • The partial decode-forward bound contains direct transmission as the case $U=\varnothing$, so it recovers the direct-transmission lower bound from classical-quantum channel capacity and yields the anti-degraded classical-quantum capacity $\max_{x_1}\max_{p_X} I(X;B|X_1=x_1)$.
  • The measure-forward bound generalizes classical compress-forward to fully quantum relays and produces a positive achievable rate $1-h(p\ast q/2)$ for a depolarizing relay where both marginals are completely depolarizing and direct transmission would give zero.
  • When the relay channel is a Stinespring dilation, the full decode-forward formula reduces to a bound resembling environment-assisted distillation rates, $\min\{H(B),H(E)\}$ over product inputs.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • One extension implicit in the proof is a stochastic-degraded version of Theorem 3: if a degrading map exists only on the marginals rather than on the full channel, the same data-processing argument may still yield the same single-letter formula, though the paper does not claim this.
  • The converse's reduction to product states suggests a precise test: if entangled inputs across time blocks can beat the formula, the capacity would need additional coherent-information terms beyond the two mutual informations in the claimed expression.
  • The assist-forward construction suggests a testable network-level design: even a very noisy relay-to-destination link can carry a positive rate if the sender uses the broadcast phase to pre-distribute entanglement, so comparing the assist-forward rate against a cutset upper bound for the depolarizing example would show how much the block-Markov protocol loses.
  • For the depolarizing relay channel, computing the cutset upper bound and comparing with $1-h(p\ast q/2)$ would reveal whether the measure-forward rate is tight or merely a lower bound; the paper leaves that comparison open.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

1 major / 5 minor

Summary. The paper studies the fully quantum relay channel N_{AD→BE}, where Alice transmits a classical message through a memoryless channel with a strictly causal quantum relay. It presents three achievable-rate bounds: a partial decode-forward bound (Theorem 1), a measure-forward bound (Theorem 4), and an assist-forward bound for orthogonal-receiver-component channels (Theorem 5). It also claims an exact single-letter capacity formula for Hadamard relay channels (Theorem 3), obtained by showing that full decode-forward is optimal. The paper includes a recovery of the classical-quantum relay result of Savov et al., a wired-network example, and a depolarizing-relay example with an explicit lower bound. The appendices contain the achievability proofs and the Hadamard converse.

Significance. If correct, Theorem 3 would be the first exact single-letter capacity formula for a fully quantum relay channel, and Theorems 1, 4, and 5 would provide the first general achievable-rate bounds for this model. The achievability proofs use standard quantum packing, covering, and gentle-measurement arguments, and the depolarizing example is worked out in explicit algebra. The paper is also commendably candid about the lack of cardinality bounds on auxiliary variables. However, the Hadamard converse as written contains a load-bearing gap: the reduction from an arbitrary code-induced ensemble to the product-state ensemble in Eq. (24) is not justified. The significance of the result therefore depends on whether this gap can be repaired.

major comments (1)
  1. [Appendix C, Eq. (108)] The converse for Theorem 3 does not justify the passage from the code-induced states to the product-state maximization in Eq. (24). In (106) the proof defines X0,i = M and X1,i = Y1^{i-1}, and in (108) it asserts that the resulting expression is an instance of the RHS of (24). But the RHS of (24) maximizes over ensembles in which, for each pair (x0, x1), the channel input is θ^{x0}_A ⊗ ζ^{x1}_D with θ indexed only by x0. For a general encoding map F_{M→A^n}, the system A_i can be entangled with A^{i-1}; since Y1^{i-1} depends on A^{i-1}, the reduced state of A_i conditioned on (M, Y1^{i-1}) can depend on Y1^{i-1}. A collection θ^{x0}_A indexed by x0 = M alone need not reproduce that conditional state, and the paper does not prove that the code-induced ensemble can be replaced by a product-state ensemble without changing the value of the min in (105). The proof also does not address the fact that the alphabet of X1,i = Y1^{i-1} grows with i, so the single-letterization step in (108) is not established. A repair may exist by exploiting the entanglement-breaking or degraded structure of the Hadamard channel, or by enlarging X0 to include the past relay outputs, but as written the exact-capacity conclusion does not follow from the given converse.
minor comments (5)
  1. [Appendix C, first paragraph] The phrase "full dicode-forward strategy" appears to be a typo for "full decode-forward strategy."
  2. [Section VI-B, paragraph 2] The word "Thoerem 3" should be "Theorem 3."
  3. [Appendix B, Eq. (95)] Equation (95) has a missing closing parenthesis: the exponent should be n(1+2δ)H(B|U X0 X1)_ω, with the closing parenthesis after the entropy expression.
  4. [Example 2 and Appendix F] The parameter α in Example 2 is introduced as a free variable in the derivation and later set to α = q/2; the notation p ∗ q/2 in Eq. (44) is ambiguous and should be parenthesized, e.g., p ∗ (q/2), to avoid confusion with the binary operation associativity.
  5. [Section VI-B] The acknowledgment that no cardinality bounds are given for U, X0, X1, Y1, Z1, G0, G1 is useful; it would be helpful to state explicitly that the three rate formulas are therefore not known to be computable in finite time.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity; the rate formulas are derived from coding schemes and optimized over free ensembles, and self-citations are not load-bearing.

full rationale

This paper's claims are lower bounds obtained from explicit coding strategies and one capacity formula obtained by combining an achievability scheme (full decode-forward) with a converse. I traced the derivation chain: Theorem 1 is proved directly from block-Markov coding, the quantum packing lemma, classical covering, and gentle measurements; the rate expression (15) is an optimization over free distributions and states, not a quantity fitted from data. Theorem 3's achievability uses U=X0 in that same proven bound; its converse uses Fano, the chain rule, and data processing on a Hadamard/degraded channel, ending at upper bounds (101a)-(101b). The step (105)-(108) labels code-induced quantities as X0 and X1 and passes to the formula's min; if this step is not fully justified for entangled codebooks, that is a proof gap (a converse gap), not circularity—the converse nowhere assumes formula (24), and the right-hand side remains a maximization over product-state ensembles. Theorems 4 and 5 are likewise achievability proofs with standard ingredients (covering, packing, Shor's rate-limited entanglement assistance, Dupuis et al.'s broadcast father protocol). The paper's own stated limitation—no alphabet-cardinality bounds for U, X0, X1, Y1, Z1, G0, G1—is an open technical issue, not an input-to-output reduction. Self-citations ([41], [25], [42], [57]) provide proof techniques and context, not the capacity results; the target formulas are not imported from them.

Assumptions & free parameters 1 free parameters · 8 assumptions · 0 invented entities

The list captures the external tools the proofs rely on. No new physical entities are introduced; the only hand-set numeric value is alpha=q/2 in the depolarizing example. The auxiliary random variables in the rate formulas are optimization variables, not fitted constants.

free parameters (1)
  • Compression parameter alpha in Example 2 = alpha = q/2
    Chosen in Appendix F to satisfy the measure-forward constraint I(Z1;Y1|B1) <= I(X1;B2); this is an example-specific optimization choice, not a fitted parameter in the general theorems.
assumptions (8)
  • domain assumption Memoryless finite-dimensional CPTP relay channel NAD->BE
    Section II-B; all results assume n-fold tensor product uses and finite dimensions.
  • domain assumption Strictly causal relay encoding with a central clock
    Definition 3; the coding scheme and bounds depend on the relay not knowing future outputs.
  • standard math Quantum packing lemma
    Lemma 6; used throughout Appendices B-D for decoding measurements.
  • standard math Gentle measurement lemma
    Lemma 7; guarantees that multiple decoding measurements do not destroy the output state.
  • standard math Classical covering lemma for joint typicality
    Used in the measure-forward proof in Appendix D and in the partial decode-forward proof.
  • standard math Shor's rate-limited entanglement assistance theorem
    Used in the assist-forward proof in Appendix E to bound the relay-to-Bob rate with limited entanglement Q.
  • standard math Dupuis-Hayden-Li broadcast subspace transmission theorem
    Used in the assist-forward proof in Appendix E to generate entanglement at rate Q over the broadcast channel.
  • standard math Fano's inequality and data processing for quantum mutual information
    Used in the Hadamard converse in Appendix C.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Quantum Relay Channels." pith.science (2026). https://pith.science/paper/HAWGNA44

@misc{pith2026241116263,
  author       = {Pith},
  title        = {Pith review of: Quantum Relay Channels},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/HAWGNA44}},
  note         = {Machine review of arXiv:2411.16263}
}
read the original abstract

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.

Figures

Figures reproduced from arXiv: 2411.16263 by the authors.

Figure 1
Figure 1. A three-terminal relay network. m Ai mˆ F N Relay Encoder Ei−1 Di Bi [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. Coding for a fully quantum relay channel [PITH_FULL_IMAGE:figures/full_fig_p001_2.png] view at source ↗
Figure 3
Figure 3. A diagram of the quantum relay channel: The transmitters at the sender and the relay are labeled as [PITH_FULL_IMAGE:figures/full_fig_p003_3.png] view at source ↗
Figures from the paper (3 more)
Figure 4
Figure 4. Figure 4: A graphical representation for the noiseless relay channel in Example [PITH_FULL_IMAGE:figures/full_fig_p008_4.png]
Figure 5
Figure 5. Figure 5: Partial decode-forward strategy. The block index [PITH_FULL_IMAGE:figures/full_fig_p014_5.png]
Figure 6
Figure 6. Figure 6: Measure-forward strategy. The block index [PITH_FULL_IMAGE:figures/full_fig_p017_6.png]

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Relaying Quantum Information

    quant-ph 2025-07 conditional novelty 5.0 of 10

    For finite-dimensional quantum relay channels, the paper proves achievable quantum-information and entanglement-generation rates using full and partial decode-forward coding.

  2. Quantum Coordination and Nonlocal Games: Theory and Applications

    quant-ph 2026-08 conditional novelty 3.0 of 10

    A review that gathers rate characterizations for strong and empirical quantum coordination across network topologies and links them to nonlocal games, DI-QKD, and quantum repeaters.

Reference graph

Works this paper leans on

68 extracted references · 63 canonical work pages · cited by 2 Pith papers

  1. [45]

    Lower bounds on the capacities of quantum relay channels,

    S. Jin-Jing, S. Rong-Hua, P. Xiao-Qi, G. Ying, Y . Liu-Yang, and L. Moon-Ho, “Lower bounds on the capacities of quantum relay channels,” Commun. Theo. Phys. , vol. 58, no. 4, p. 487, 2012

    work page 2012

  2. [1]

    Design and performance of relay-assisted satellite free-space optical quantum key distribution systems,

    M. Q. Vu, T. V . Pham, N. T. Dang, and A. T. Pham, “Design and performance of relay-assisted satellite free-space optical quantum key distribution systems,” IEEE Access, vol. 8, pp. 122 498–122 510, 2020

    2020

  3. [2]

    Quantum for 6G communication: A perspective,

    M. Z. Ali, A. Abohmra, M. Usman, A. Zahid, H. Heidari, M. A. Imran, and Q. H. Abbasi, “Quantum for 6G communication: A perspective,” IET Quantum Communication , vol. 4, no. 3, pp. 112–124, 2023

    work page 2023

  4. [3]

    Relay-assisted deep space optical communication system over coronal fading channels,

    G. Xu, Q. Zhang, Z. Song, and B. Ai, “Relay-assisted deep space optical communication system over coronal fading channels,” IEEE Trans. Aerosp. Electron. Syst. , vol. 59, no. 6, pp. 8297–8312, 2023

    work page 2023

  5. [4]

    Quantum communication networks for 6G,

    R. Bassoli, F. H. Fitzek, and H. Boche, “Quantum communication networks for 6G,” Photon. Quantum Technol. Sci. Appl., vol. 2, pp. 715–736, 2023

    work page 2023

  6. [5]

    Quantum repeaters: From quantum networks to the quantum internet,

    K. Azuma, S. E. Economou, D. Elkouss, P. Hilaire, L. Jiang, H.-K. Lo, and I. Tzitrin, “Quantum repeaters: From quantum networks to the quantum internet,” Reviews of Modern Physics , vol. 95, no. 4, p. 045006, 2023

    work page 2023

  7. [6]

    On the capacity of wireless networks: the relay case,

    M. Gastpar and M. Vetterli, “On the capacity of wireless networks: the relay case,” in Proc. Twenty-First Annu. Joint Conf. IEEE Comput. Commun. Soc. , vol. 3, 2002, pp. 1577–1586 vol.3

    work page 2002

  8. [7]

    Recent advances on integrated quantum communications,

    A. Orieux and E. Diamanti, “Recent advances on integrated quantum communications,” Journal of Optics, vol. 18, no. 8, p. 083002, 2016

    work page 2016

Show all 68 references
  1. [8]

    Extending quantum links: Modules for fiber-and memory-based quantum repeaters,

    P. van Loock, W. Alt, C. Becher, O. Benson, H. Boche, C. Deppe, J. Eschner, S. Höfling, D. Meschede, and P. Michler, “Extending quantum links: Modules for fiber-and memory-based quantum repeaters,” Adv. Quantum Technol., no. 3, p. 1900141, 2020

    2020

  2. [9]

    Progress in quantum teleportation,

    X.-M. Hu, Y . Guo, B.-H. Liu, C.-F. Li, and G.-C. Guo, “Progress in quantum teleportation,” Nature Rev. Phys. , vol. 5, no. 6, pp. 339–353, 2023

    2023

  3. [10]

    Recent progress in quantum photonic chips for quantum communication and internet,

    W. Luo, L. Cao, Y . Shi, L. Wan, H. Zhang, S. Li, G. Chen, Y . Li, S. Li, Y . Wang et al. , “Recent progress in quantum photonic chips for quantum communication and internet,” Light: Science & Applications , vol. 12, no. 1, p. 175, 2023

    2023

  4. [11]

    Increasing quantum communication rates using hyperentangled photonic states,

    L. Nemirovsky-Levy, U. Pereg, and M. Segev, “Increasing quantum communication rates using hyperentangled photonic states,” Optica Quantum, vol. 2, no. 3, pp. 165–172, 2024

    2024

  5. [12]

    Bassoli, R

    R. Bassoli, R. Ferrara, S. Saeedinaeeni, C. Deppe, H. Boche, F. H. P. Fitzek, and G. Jansen, Quantum Communication Networks. Springer Nature (unpublished), 2020

    2020

  6. [13]

    Entanglement-assisted capacity of a quantum channel and the reverse shannon theorem,

    C. H. Bennett, P. W. Shor, J. A. Smolin, and A. V . Thapliyal, “Entanglement-assisted capacity of a quantum channel and the reverse shannon theorem,” IEEE Trans. Inf. Theory , vol. 48, no. 10, pp. 2637–2655, Oct 2002

    2002

  7. [14]

    Additive classical capacity of quantum channels assisted by noisy entanglement,

    Q. Zhuang, E. Y . Zhu, and P. W. Shor, “Additive classical capacity of quantum channels assisted by noisy entanglement,” Phys. Rev. Lett., vol. 118, no. 20, p. 200503, 2017

    2017

  8. [15]

    Communication with unreliable entanglement assistance,

    U. Pereg, C. Deppe, and H. Boche, “Communication with unreliable entanglement assistance,” IEEE Trans. Inf. Theory , vol. 69, no. 7, pp. 4579–4599, 2023

    2023

  9. [16]

    Entanglement-assisted private communication over quantum broadcast channels,

    H. Qi, K. Sharma, and M. M. Wilde, “Entanglement-assisted private communication over quantum broadcast channels,” J. Phys. A: Math. and Theo. , vol. 51, no. 37, p. 374001, 2018

    2018

  10. [17]

    Quantum secure direct communication with private dense coding using a general preshared quantum state,

    J. Wu, G.-L. Long, and M. Hayashi, “Quantum secure direct communication with private dense coding using a general preshared quantum state,” Phys. Rev. App., vol. 17, no. 6, p. 064011, 2022

    2022

  11. [18]

    Secure communication with unreliable entanglement assistance,

    M. Lederman and U. Pereg, “Secure communication with unreliable entanglement assistance,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT 2024)" , 2024, pp. 1017–1022

    2024

  12. [19]

    Entanglement-assisted covert communication via qubit depolarizing channels,

    E. Zlotnick, B. Bash, and U. Pereg, “Entanglement-assisted covert communication via qubit depolarizing channels,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT’2023) , 2023, pp. 198–203

    2023

  13. [20]

    Entanglement-assisted covert communication via qubit depolarizing channels,

    ——, “Entanglement-assisted covert communication via qubit depolarizing channels,” Submitted for publication in IEEE Trans. Inf. Theory, 2023

    2023

  14. [21]

    Resource-efficient entanglement-assisted covert communications over bosonic channels,

    S.-Y . Wang, S.-J. Su, and M. R. Bloch, “Resource-efficient entanglement-assisted covert communications over bosonic channels,” in 2024 IEEE International Symposium on Information Theory (ISIT) , 2024, pp. 3106–3111

    2024

  15. [22]

    Playing games with multiple access channels,

    F. Leditzky, M. A. Alhejji, J. Levin, and G. Smith, “Playing games with multiple access channels,” Nature communications, vol. 11, no. 1, pp. 1–5, 2020

    2020

  16. [23]

    The multiple-access channel with entangled transmitters,

    U. Pereg, C. Deppe, and H. Boche, “The multiple-access channel with entangled transmitters,” in Proc. Global Commun. Conf. (GLOBECOM’2023). IEEE, 2023, pp. 3173–3178

    2023

  17. [24]

    The multiple-access channel with entangled transmitters,

    ——, “The multiple-access channel with entangled transmitters,” Accepted for publication in IEEE Trans. Inf. Theory , 2024

    2024

  18. [25]

    Quantum broadcast channels with cooperating decoders: An information-theoretic perspective on quantum repeaters,

    U. Pereg, C. Deppe, and H. Boche, “Quantum broadcast channels with cooperating decoders: An information-theoretic perspective on quantum repeaters,” J. Math. Phys. , vol. 62, no. 6, p. 062204, 2021

    2021

  19. [26]

    Broadcast channel coding: Algorithmic aspects and non-signaling assistance,

    O. Fawzi and P. Fermé, “Broadcast channel coding: Algorithmic aspects and non-signaling assistance,” IEEE Trans. Inf. Theory, vol. 70, no. 11, pp. 7563–7580, 2024

    2024

  20. [27]

    Cooperative communications,

    A. Chakrabarti, A. Sabharwal, and B. Aazhang, “Cooperative communications,” in Cooperation in wireless networks: Principles and applications . Springer, 2006, pp. 29–68

    2006

  21. [28]

    Entanglement coordination rates in multi-user networks,

    H. Nator and U. Pereg, “Entanglement coordination rates in multi-user networks,” Accepted for publication in Proc. IEEE 23 Inf. Theory Workshop (ITW’2024) , 2024

    2024

  22. [29]

    Cooperative strategies and capacity theorems for relay networks,

    G. Kramer, M. Gastpar, and P. Gupta, “Cooperative strategies and capacity theorems for relay networks,” IEEE Trans. Inf. Theory, vol. 51, no. 9, pp. 3037–3063, 2005

    2005

  23. [30]

    Topics in multi-user information theory,

    G. Kramer, “Topics in multi-user information theory,” Foundations and Trends in Communications and Information Theory, vol. 4, no. 4–5, pp. 265–444, 2008

    2008

  24. [31]

    Three-terminal communication channels,

    E. C. van der Meulen, “Three-terminal communication channels,” Adv. Appl. Prob., vol. 3, no. 1, pp. 120–154, 1971

    1971

  25. [32]

    The arbitrarily varying relay channel,

    U. Pereg and Y . Steinberg, “The arbitrarily varying relay channel,” Entropy, vol. 21, no. 5, p. 516, 2019

    2019

  26. [33]

    Partial decode-forward for quantum relay channels,

    I. Savov, M. M. Wilde, and M. Vu, “Partial decode-forward for quantum relay channels,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT’2012), Cambridge, MA, USA, 2012, pp. 731–735

    2012

  27. [34]

    Network information theory for classical-quantum channels,

    I. Savov, “Network information theory for classical-quantum channels,” Ph.D. dissertation, McGill University, Montreal, 2012

    2012

  28. [35]

    The broadcast classical–quantum capacity region of a two-phase bidirectional relaying channel,

    H. Boche, M. Cai, and C. Deppe, “The broadcast classical–quantum capacity region of a two-phase bidirectional relaying channel,” Quantum Information Processing , vol. 14, no. 10, pp. 3879–3897, 2015

    2015

  29. [36]

    Correcting quantum channels by measuring the environment,

    P. Hayden and C. King, “Correcting quantum channels by measuring the environment,” arXiv:quant-ph/0409026, 2004

    2004 arXiv

  30. [37]

    Entanglement of assistance and multipartite state distillation,

    J. A. Smolin, F. Verstraete, and A. Winter, “Entanglement of assistance and multipartite state distillation,” Phys. Rev. A, vol. 72, no. 5, p. 052317, 2005

    2005

  31. [38]

    On environment-assisted capacities of quantum channels,

    A. Winter, “On environment-assisted capacities of quantum channels,” arXiv:quant-ph/0507045, 2005

    2005 arXiv

  32. [39]

    A quantum multiparty packing lemma and the relay channel,

    D. Ding, H. Gharibyan, P. Hayden, and M. Walter, “A quantum multiparty packing lemma and the relay channel,” IEEE Trans. Inf. Theory, vol. 66, no. 6, pp. 3500–3519, June 2020

    2020

  33. [40]

    Causal state communication,

    C. Choudhuri, Y . H. Kim, and U. Mitra, “Causal state communication,” IEEE Trans. Inf. Theory , vol. 59, no. 6, pp. 3709–3719, June 2013

    2013

  34. [41]

    Communication over quantum channels with parameter estimation,

    U. Pereg, “Communication over quantum channels with parameter estimation,” IEEE Trans. Inf. Theory , vol. 68, no. 1, pp. 359–383, 2022

    2022

  35. [42]

    The quantum multiple-access channel with cribbing encoders,

    U. Pereg, C. Deppe, and H. Boche, “The quantum multiple-access channel with cribbing encoders,” IEEE Trans. Inf. Theory, vol. 68, no. 6, pp. 3965–3988, 2022

    2022

  36. [43]

    Quantum repeaters: the role of imperfect local operations in quantum communication,

    H. J. Briegel, W. Dür, J. I. Cirac, and P. Zoller, “Quantum repeaters: the role of imperfect local operations in quantum communication,” Phys. Rev. Lett., vol. 81, no. 26, p. 5932, 1998

    1998

  37. [44]

    Private quantum coding for quantum relay networks,

    L. Gyongyosi and S. Imre, “Private quantum coding for quantum relay networks,” in Meeting Euro. Netw. Univ. Comp. Inf. Commun. Engin. Springer, 2012, pp. 239–250

    2012

  38. [46]

    Reliable quantum communication over a quantum relay channel,

    L. Gyongyosi and S. Imre, “Reliable quantum communication over a quantum relay channel,” in AIP Conf. Proc. , vol. 1633, no. 1. American Institute of Physics, 2014, pp. 165–167

    2014

  39. [47]

    Capacities of repeater-assisted quantum communications,

    S. Pirandola, “Capacities of repeater-assisted quantum communications,” arXiv:1601.00966, 2016

    2016 arXiv

  40. [48]

    Capacity-approaching quantum repeaters for quantum communications,

    M. Ghalaii and S. Pirandola, “Capacity-approaching quantum repeaters for quantum communications,” Phys. Rev. A, vol. 102, no. 6, p. 062412, 2020

    2020

  41. [49]

    Capacity theorems for the relay channel,

    T. Cover and A. E. Gamal, “Capacity theorems for the relay channel,” IEEE Trans. Inf. Theory , vol. 25, no. 5, pp. 572–584, September 1979

    1979

  42. [50]

    Additivity of the classical capacity of entanglement-breaking quantum channels,

    P. W. Shor, “Additivity of the classical capacity of entanglement-breaking quantum channels,” J. Math. Phys. , vol. 43, no. 9, pp. 4334–4340, May 2002

    2002

  43. [51]

    Hadamard quantum broadcast channels,

    Q. Wang, S. Das, and M. M. Wilde, “Hadamard quantum broadcast channels,” Quantum Inform. Process., vol. 16, no. 10, p. 248, 2017

    2017

  44. [52]

    The capacity of the quantum channel with general signal states,

    A. S. Holevo, “The capacity of the quantum channel with general signal states,” IEEE Trans. Inf. Theory , vol. 44, no. 1, pp. 269–273, Jan 1998

    1998

  45. [53]

    The classical capacity achievable by a quantum channel assisted by a limited entanglement,

    P. W. Shor, “The classical capacity achievable by a quantum channel assisted by a limited entanglement,” Quantum Inf. Comp., vol. 4, no. 6, pp. 537–545, Dec 2004

    2004

  46. [54]

    Coding theorem and strong converse for quantum channels,

    A. Winter, “Coding theorem and strong converse for quantum channels,” IEEE Trans. Inf. Theory , vol. 45, no. 7, pp. 2481–2485, Nov 1999

    1999

  47. [55]

    A father protocol for quantum broadcast channels,

    F. Dupuis, P. Hayden, and K. Li, “A father protocol for quantum broadcast channels,” IEEE Trans. Inf. Theory , vol. 56, no. 6, pp. 2946–2956, June 2010

    2010

  48. [56]

    M. M. Wilde, Quantum information theory , 2nd ed. Cambridge University Press, 2017

    2017

  49. [57]

    Quantum channel state masking,

    U. Pereg, C. Deppe, and H. Boche, “Quantum channel state masking,” IEEE Trans. Inf. Theory , vol. 67, no. 4, pp. 2245–2268, 2021

    2021

  50. [58]

    Relative entropy and squashed entanglement,

    K. Li and A. Winter, “Relative entropy and squashed entanglement,” Commun. Math. Phys. , vol. 326, no. 1, pp. 63–80, Jan 2014

    2014

  51. [59]

    Approximate quantum markov chains,

    D. Sutter, “Approximate quantum markov chains,” in Approximate Quantum Markov Chains. Springer, 2018, pp. 75–100

    2018

  52. [60]

    Degradedness under cooperation,

    Y . Steinberg, “Degradedness under cooperation,” arXiv preprint arXiv:2501.08987, 2025. 24

    2025

  53. [61]

    Private and quantum capacities of more capable and less noisy quantum channels,

    S. Watanabe, “Private and quantum capacities of more capable and less noisy quantum channels,” Phys. Rev. A, vol. 85, no. 1, p. 012326, 2012

    2012

  54. [62]

    Quantum repeater with encoding,

    L. Jiang, J. M. Taylor, K. Nemoto, W. J. Munro, R. Van Meter, and M. D. Lukin, “Quantum repeater with encoding,” Phys. Rev. A, vol. 79, no. 3, p. 032325, March 2009

    2009

  55. [63]

    Demonstration of entanglement purification and swapping protocol to design quantum repeater in ibm quantum computer,

    B. K. Behera, S. Seth, A. Das, and P. K. Panigrahi, “Demonstration of entanglement purification and swapping protocol to design quantum repeater in ibm quantum computer,” Quantum Information Processing , vol. 18, no. 4, p. 108, March 2019

    2019

  56. [64]

    Sending classical information via noisy quantum channels,

    B. Schumacher and M. D. Westmoreland, “Sending classical information via noisy quantum channels,” Phys. Rev. A , vol. 56, no. 1, p. 131, July 1997

    1997

  57. [65]

    Entanglement-assisted capacity of quantum multiple-access channels,

    M. Hsieh, I. Devetak, and A. Winter, “Entanglement-assisted capacity of quantum multiple-access channels,” IEEE Trans. Inf. Theory, vol. 54, no. 7, pp. 3078–3090, July 2008

    2008

  58. [66]

    Making good codes for classical-quantum channel coding via quantum hypothesis testing,

    T. Ogawa and H. Nagaoka, “Making good codes for classical-quantum channel coding via quantum hypothesis testing,” IEEE Trans. Inf. Theory , vol. 53, no. 6, pp. 2261–2266, June 2007

    2007

  59. [67]

    T. M. Cover and J. A. Thomas, Elements of Information Theory , 2nd ed. Wiley, 2006

    2006

  60. [68]

    El Gamal and Y

    A. El Gamal and Y . Kim, Network Information Theory . Cambridge University Press, 2011

    2011

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.