Pith. sign in

REVIEW 4 major objections 3 minor 82 references

Relaying Quantum Information

T0 review · 4 major / 3 minor · reviewed 2026-08-06 · deepseek-v4-flash

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

Pith's one-line read This paper proves that a finite-dimensional quantum relay channel can generate entanglement at any rate up to $Q_{\rm PD-F}(N)=\max_\sigma\min\{I(A_1A_2\rangle B)_\omega, I(A_1\rangle E)_\omega+I(A_2\rangle BA_1)_\omega\}$ using a partial…

desk verdict Promising new lower bounds for fully quantum relay channels, but the unassisted proofs rest on a missing recycling lemma and a questionable data-processing step; send to review with major revision. read the letter →

arxiv 2507.06770 v2 pith:AIY75AQL submitted 2025-07-09 quant-ph cs.ITmath.IT

Yigal Ilin , Uzi Pereg This is my paper · ORCID
classification quant-phcs.ITmath.IT MSC 81P4594A40 PACS 03.67.Hk03.67.-a
keywords quantumrelaychannelpartialdecode-forwardcapacityentanglementgenerationcoherentinformationblockMarkovcodingFQSWprotocolassistance
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

Quantum relays are a proposed remedy for photon loss and decoherence in long-distance quantum communication, but their information-theoretic limits are only partially understood. This paper establishes achievable rates for a three-terminal relay channel in which the relay decodes only part of the quantum message and forwards it, while the receiver decodes the other part directly. The main unassisted result says the entanglement-generation rate can be at least the minimum of two coherent-information expressions; the full decode-forward special case gives a lower bound on the ordinary quantum capacity, and an entanglement-assisted version is derived as well. These bounds matter because they quantify when a relay genuinely helps, and because the unassisted protocol achieves them by recycling the entanglement that the relay's own decoding produces as a by-product.

What carries the argument

The paper builds on the fully quantum Slepian–Wolf (FQSW) protocol, a procedure that sends quantum information while also outputting EPR pairs as a by-product, and embeds it in a block-Markov code over many blocks. At the relay, FQSW decoding of one block produces an entangled resource that the protocol feeds forward into the next block, so the unassisted rates do not need to consume preshared entanglement. Three decoupling steps (encoder, relay, destination) convert the protocol's error constraints into the coherent-information terms of the rate formulas, and rate splitting into $A_1$ and $A_2$ realizes the partial decode-forward tradeoff.

What would settle it

Run the two-block protocol on the orthogonal erasure relay channel of Sec. VI and compute the joint state of the fed-forward by-product EPR pairs and the relay's decoded message after FQSW decoding; if the trace distance from a product state does not vanish exponentially in the block length, or if the predicted rate $2(1-2q)+(1-2\gamma)$ is not attained, the reuse step in the proof of Theorem 3 is broken.

Watch

Extended reading notes

Core claim

The central claim, on the authors' own terms, is an achievability theorem: for a memoryless finite-dimensional quantum relay channel $N_{AD\to BE}$, the entanglement-generation capacity without assistance is at least $Q_{\rm PD-F}(N)$, the maximum over pure input states $\sigma_{A_1A_2AD}$ of $\min\{I(A_1A_2\rangle B)_\omega, I(A_1\rangle E)_\omega + I(A_2\rangle BA_1)_\omega\}$, where $\omega = N_{AD\to BE}(\sigma_{A_1A_2AD})$ and $A_1,A_2$ are auxiliary systems for the relay path and the direct path. When the relay decodes everything, the unassisted quantum capacity is at least $\max_\sigma\min\{I(A_1\rangle B)_\omega, I(A_1\rangle E)_\omega\}$; with unlimited entanglement assistance, the quantum capacity is at least $\max_\sigma[\frac{1}{2}I(A_1;B)_\omega-\frac{1}{2}I(A_1;D)_\sigma]$. All three are lower bounds on capacity, not exact characterizations.

Load-bearing premise

The unassisted rates assume that entanglement produced as a by-product of the relay's decoding in one block can be carried into the next block as a clean, uncorrelated resource at no rate cost, a reuse the paper states but does not prove as a separate lemma.

Editorial extensions

If this is right

  • For orthogonal links, the full decode-forward bound becomes $\min\{I_c(M), I_c(P)\}$, so a non-orthogonal channel with entangled sender–relay inputs can beat a repeater chain built from independent links.
  • When the receiver's channel is a degraded version of the relay's channel, the full decode-forward bound reduces to $I(A_1\rangle B)_\omega$: the last hop is the bottleneck.
  • On a quantum erasure relay channel with erasure probabilities $\alpha,\beta,\gamma$, the partial decode-forward rate is $2(1-2q)+(1-2\gamma)$ with $q=\alpha+(1-\alpha)\beta$, which exceeds either the relay-only or direct-only rate.
  • With entanglement assistance, the same relay setup supports classical communication at rate at least $2Q_{\rm EA,D-F}$ by superdense coding.

Reading between the lines

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

  • If the by-product entanglement reuse is made fully rigorous with its own lemma, the same block-Markov and FQSW construction should yield rate formulas for assist-forward and compress-forward relaying, with the compression cost appearing as a conditional entropy term alongside the coherent-information minima.
  • Applied to bosonic channels, the min-of-coherent-informations structure predicts a rate-distance curve for relays that interpolates between the repeaterless rate-distance limit and an ideal repeater bound; the split between $A_1$ and $A_2$ would become a continuous optimization over how much entanglement to allocate to each segment.
  • The orthogonal erasure example suggests a design rule for practical repeaters: allocate the sender's entanglement budget between the relay and direct paths according to the erasure probabilities, since the achievable rate is a sum of two independent terms.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

4 major / 3 minor

Summary. The paper studies a three-terminal quantum relay channel N_{AD→BE} and proposes block-Markov coding schemes based on the fully quantum Slepian-Wolf (FQSW) protocol. It states Proposition 1, a rate region for transmission with rate-limited entanglement assistance, and then derives unassisted lower bounds for full decode-forward (Theorem 2) and partial decode-forward (Theorem 3), an entanglement-assisted bound (Theorem 4), and an erasure-channel example in Section VI. The claimed unassisted bounds are Q_D-F = max min{I(A1>B), I(A1>E)} and Q_PD-F = max min{I(A1A2>B), I(A1>E)+I(A2>BA1)}. The proof is based on decoupling inequalities in Appendix B, Uhlmann's theorem, and taking all entanglement-consumption and by-product-generation rates to zero.

Significance. The topic is timely: quantum relay channels are central to repeater architectures and distributed quantum computing, and a rigorous achievable-rate framework would be a useful contribution. The paper correctly identifies the importance of block-Markov coding and uses standard tools (FQSW, decoupling, typical subspaces). However, the main unassisted claims are not established. The proof that Eq. (30) is inactive uses a data-processing inequality that does not hold for the channel N_{AD→BE}, and the reuse of by-product entanglement across blocks is asserted but never proved. In addition, the full decode-forward bound in Theorem 2 is subject to a complementarity relation between coherent informations to the two outputs B and E, which makes the stated maximum zero for every channel under the paper's own nonnegativity constraints. These are load-bearing issues in the central results.

major comments (4)
  1. [Appendix C-A, Eq. (30)] The proof that Eq. (30) is inactive relies on the identity H(A1|D)_σ = I(A1>A)_σ and on the statement that "the data processing inequality for the coherent information" gives I(A1>A)_σ ≥ I(A1>B)_ω. The identity is correct, but the data-processing step is not: the channel N_{AD→BE} acts jointly on A and D, so standard coherent-information data processing applies to the combined input AD, giving I(A1>AD)_σ ≥ I(A1>B)_ω, not I(A1>A)_σ ≥ I(A1>B)_ω. A concrete counterexample is σ_{A1 A D} = EPR(X,A) ⊗ EPR(Y,D) with A1=(X,Y), A=X, D=Y, and N the identity channel from AD to B with E trivial: then I(A1>A)_σ = 0 while I(A1>B)_ω = 2. Thus Eq. (30) may be active, and the derivation of Theorems 2 and 3 is incomplete.
  2. [Section IV-B, Theorem 2] There is a more basic obstruction to the stated full decode-forward bound. For any pure input σ_{A1AD} and any isometric extension V_{AD→BEJ} of the channel, the state on A1 B E J is pure. By weak monotonicity (equivalently strong subadditivity), H(B)+H(E) ≤ H(BJ)+H(EJ), which immediately gives I(A1>B)_ω + I(A1>E)_ω ≤ 0. Therefore, under the paper's own constraints I(A1>B)_ω ≥ 0 and I(A1>E)_ω ≥ 0, both quantities must be zero for every feasible σ. Hence Q_D-F(N) as defined in Eq. (10) is identically zero for every quantum relay channel, making Theorem 2 vacuous. A non-vanishing decode-forward rate must involve two different channel uses (first hop to the relay and second hop from the relay), with different input states, but the paper's formula and proof use the same ω = N(σ) for both terms.
  3. [Section I and Appendix C] The unassisted rates in Theorems 2 and 3 depend on reusing the by-product entanglement generated by FQSW decoding in block j-1 as a clean resource in block j. The paper asserts this in Section I ("allow the protocol to reuse entanglement generated as a by-product in block i-1 during block i") and in the proof it sets the by-product generation rates \hat L to zero. However, no lemma in Appendix B or C proves that the by-product systems \hat G'_1,A, \hat G'_2,A, and \hat G''_A are uncorrelated with the relay's decoded message M', survive the relay's subsequent decoding and re-encoding operations, and remain available at no rate cost. The decoupling bounds in Eqs. (29), (33), and (36) only establish closeness of reduced states; they do not address correlations with M' or consumption by the decoding operations. Without this lemma, taking the by-product rates to zero is not justified, and the claimed unassisted rates may require an additional entanglement cost.
  4. [Section VI, Eqs. (18)-(22)] The erasure example appears to model B' and E as two independent erasure outputs of the same input, with B' obtained by erasure α and E obtained by a further erasure β applied to B'. For a valid quantum channel, two outputs of the same transmission cannot both carry positive coherent information about the same quantum input; the complementarity relation I(A1>B')+I(A1>E) ≤ 0 holds for any isometric channel. A channel that outputs a noiseless copy to B' and a degraded copy to E would violate no-cloning unless B' is correspondingly disturbed. The rate computations in Eqs. (18)-(22), which give positive values for both I(A1>B') and I(A1>E), are therefore not achieved by a physically realizable quantum channel, and the example needs to be replaced by a model with a genuine quantum tradeoff between the two outputs.
minor comments (3)
  1. [Throughout] There are several typos and grammatical issues, including "strictly casual" instead of "strictly causal" in Section III, "fideluty" in Appendix A, "intepretation" in Section IV, and "a the US National Security Agency" in the Introduction; these should be corrected.
  2. [Eq. (23)] The expression in Eq. (23) is missing a trace-distance norm symbol on the left-hand side; as printed, it is not a well-formed inequality.
  3. [Section IV-A] The definition of the rate region in Proposition 1 would benefit from explicitly stating that all rates are nonnegative and from defining the notational convention for the by-product systems in one place rather than only in Appendix B.

Circularity Check

0 steps flagged · score 2.0 of 10

No significant circularity: the claimed rates are algebraic consequences of the assisted rate region and external FQSW bounds, not of fitted inputs or self-citations.

full rationale

The derivation chain is self-contained relative to its stated tools. Proposition 1 is proved directly from FQSW decoupling bounds (Eqs. (29), (33), and (36)) built on the externally cited FQSW theorem [51, 74], Uhlmann's theorem, and standard typical-subspace inequalities; none of these ingredients presupposes the final rate formulas. The unassisted Theorems 2 and 3 are obtained by taking the entanglement-assistance and by-product-generation rates to zero in Proposition 1 and simplifying the constraints, with the min expression following explicitly from the entropy chain rule in Eq. (44) (e.g., I(A1A2>B) = I(A1>B) + I(A2>BA1)). The paper contains self-citations to prior work by the first author (e.g., Refs. [35], [39]-[42], [49]), but these are background and context citations; the load-bearing proof ingredients are not self-citations. The reviewer concern about reusing FQSW by-product entanglement across block-Markov rounds is a possible proof-gap or correctness issue, not a circularity: the text asserts this reuse ('In the unassisted case, we leverage the fact that communication occurs over multiple rounds, allowing the protocol to reuse entanglement generated as a by-product in block i − 1 during block i') but does not prove that the by-product remains clean and uncorrelated after decoding. If valid, that concern would mean the unassisted rate is not fully established, but it would not make the claimed rate equal by construction to a fitted input or to the paper's own assumptions. No equation or definition in the paper reduces the target theorem to its own input, so no specific circular step can be exhibited.

Assumptions & free parameters 0 free parameters · 6 assumptions · 0 invented entities

The paper introduces no fitted parameters and no new physical entities, particles, mediators, or dimensions. The auxiliary registers A1 and A2 are coding ancillas, not invented entities. The central claim rests on standard decoupling tools plus two structural assumptions about the relay protocol, the second and sixth of which are the most fragile.

assumptions (6)
  • standard math The fully quantum Slepian-Wolf (FQSW) protocol achieves the decoupling behavior and error bounds stated in Eqs. (23)-(25).
    Used as a black box in Appendix A and throughout Appendix B to justify the encoder and decoder partial isometries.
  • standard math Uhlmann's theorem with non-normalized purifications and the trace-distance approximation in Sec. II is valid.
    Invoked to construct encoder isometries in Appendix B.1 and relay decoders in Appendix B.2.
  • standard math Typical subspace projectors satisfy the standard entropy estimates quoted from Wilde [63].
    Used to convert decoupling error expressions into exponential rate conditions in Appendix B.
  • domain assumption The relay operates strictly causally: at time i, the relay sends D_i before receiving E_i.
    This is the defining model assumption in Sec. III and is required for the block-Markov scheme.
  • ad hoc to paper By-product entanglement generated by FQSW decoding in block j-1 can be reused as a clean resource in block j.
    Stated in the introduction and used implicitly in the unassisted partial and full decode-forward proofs, but no separate lemma proves that the by-product is uncorrelated with the decoded message and fully reusable.
  • ad hoc to paper The inequality in Eq. (30) is inactive because H(A1|D)_sigma = I(A1>A)_sigma and DPI gives I(A1>A)_sigma >= I(A1>B)_omega.
    This assertion in Appendix C-A is not justified for a channel whose relay input D is correlated with A1; it is a load-bearing step for Theorems 2 and 3.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Relaying Quantum Information." pith.science (2026). https://pith.science/paper/AIY75AQL

@misc{pith2026250706770,
  author       = {Pith},
  title        = {Pith review of: Relaying Quantum Information},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/AIY75AQL}},
  note         = {Machine review of arXiv:2507.06770}
}
read the original abstract

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.

Figures

Figures reproduced from arXiv: 2507.06770 by the authors.

Figure 1
Figure 1. Comparison of classical and quantum repeater architectures. Classical repeaters amplify signals, while quantum repeaters utilize entanglement. arXiv:2507.06770v2 [quant-ph] 31 Aug 2025 [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. Coding for a quantum relay channel NAD→BE. central to our analysis, while detailed proofs of the achievable rates are given in Appendix B and Appendix C. II. PRELIMINARIES AND NOTATION In this section, we introduce the basic definitions and nota￾tion used throughout the paper. A quantum state is represented by a density operator ρ acting on a Hilbert space H, satisfying Tr(ρ) = 1 and ρ ⪰ 0. We assume all Hilbert spa… view at source ↗
Figure 3
Figure 3. Three-terminal quantum relay schematic. The transmitters at the sender and relay are denoted by A and D, respectively, while the receivers at the relay and destination are labeled E and B. quantum information transfer and entanglement generation. As outlined in Sec. I, the full decode-forward strategy addresses quantum information transfer, while the partial decode-forward strategy deals with entanglement generation… view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: A quantum relay channel with orthogonal components considered in our example. Alice’s (sender’s) input A splits into A′ and A′′, entangled with auxiliaries A1 and A2. A′ is sent through a relay-assisted link, while A′′ is sent directly to Bob (receiver). The receiver o…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

82 extracted references · 46 canonical work pages

  1. [1]

    Strong coordination over a three-terminal relay network,

    M. R. Bloch and J. Kliewer, “Strong coordination over a three-terminal relay network,” in 2014 IEEE Information Theory Workshop (ITW 2014) . IEEE, Nov. 2014, p. 646–650. [Online]. Available: http: //dx.doi.org/10.1109/ITW.2014.6970911

    work page arXiv 2014

  2. [2]

    Secure non-linear network code over a one-hop relay network,

    M. Hayashi and N. Cai, “Secure non-linear network code over a one-hop relay network,” IEEE Journal on Selected Areas in Information Theory , vol. 2, no. 1, p. 296–305, Mar. 2021. [Online]. Available: http://dx.doi.org/10.1109/JSAIT.2021.3053697

    work page arXiv 2021

  3. [3]

    Quantum error correction below the surface code threshold,

    G. Q. AI and Collaborators, “Quantum error correction below the surface code threshold,” arXiv, 2024. [Online]. Available: https://arxiv.org/abs/2408.13687

    arXiv 2024

  4. [4]

    Techniques for combining fast local decoders with global decoders under circuit-level noise,

    C. Chamberland, L. Goncalves, P. Sivarajah, E. Peterson, and S. Grimberg, “Techniques for combining fast local decoders with global decoders under circuit-level noise,” Quantum Science and Technology , vol. 8, no. 4, p. 045011, Jul. 2023. [Online]. Available: http://dx.doi.org/10.1088/2058-9565/ace64d

    doi:10.1088/2058-9565/ace64d 2023

  5. [5]

    Parallel window decoding enables scalable fault tolerant quantum computation,

    L. Skoric, D. E. Browne, K. M. Barnes, N. I. Gillespie, and E. T. Campbell, “Parallel window decoding enables scalable fault tolerant quantum computation,” Nature Communications , vol. 14, no. 1, Nov. 2023. [Online]. Available: http://dx.doi.org/10.1038/s41467-023-42482-1

    doi:10.1038/s41467-023-42482-1 2023

  6. [6]

    Distributed quantum computing: A survey,

    M. Caleffi, M. Amoretti, D. Ferrari, J. Illiano, A. Manzalini, and A. S. Cacciapuoti, “Distributed quantum computing: A survey,” Computer Networks , vol. 254, p. 110672, Dec. 2024. [Online]. Available: http://dx.doi.org/10.1016/j.comnet.2024.110672

    arXiv 2024

  7. [7]

    Optical fibers with memory effects and their quantum communication capacities,

    F. A. Mele, G. D. Palma, M. Fanizza, V . Giovannetti, and L. Lami, “Optical fibers with memory effects and their quantum communication capacities,” IEEE Transactions on Information Theory , vol. 70, no. 12, p. 8844–8869, Dec. 2024. [Online]. Available: http: //dx.doi.org/10.1109/TIT.2024.3450501

    work page arXiv 2024

  8. [8]

    Efficient quantum network communication using optimized entanglement swapping trees,

    M. Ghaderibaneh, C. Zhan, H. Gupta, and C. R. Ramakrishnan, “Efficient quantum network communication using optimized entanglement swapping trees,” IEEE Transactions on Quantum Engineering , vol. 3, p. 1–20, 2022. [Online]. Available: http://dx.doi.org/10.1109/TQE.2022.3168784

    work page arXiv 2022

Show all 82 references
  1. [9]

    When entanglement meets classical communications: Quantum teleportation for the quantum internet,

    A. S. Cacciapuoti, M. Caleffi, R. Van Meter, and L. Hanzo, “When entanglement meets classical communications: Quantum teleportation for the quantum internet,” IEEE Transactions on Communications , vol. 68, no. 6, p. 3808–3833, Jun. 2020. [Online]. Avail- able: http://dx.doi.or...

    2020

  2. [10]

    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, p. 122498–122510, 2020. [Online]. Available: http://dx.doi.org/10.1109/ACCESS. 2020.3007461

    2020

  3. [11]

    Quantum repeaters in space,

    C. Liorni, H. Kampermann, and D. Bruß, “Quantum repeaters in space,” New Journal of Physics , vol. 23, no. 5, p. 053021, May 2021. [Online]. Available: http://dx.doi.org/10.1088/1367-2630/abfa63

    2021 doi

  4. [12]

    Long- distance secure communication based on quantum repeater deployment with quantum-key distribution,

    S. Baskar, M. K. Roberts, and K. Sridhar, “Long- distance secure communication based on quantum repeater deployment with quantum-key distribution,” in 2024 3rd International Conference on Artificial Intelligence For Internet of Things (AIIoT) . IEEE, May 2024, p. 1–6. [Online]...

    2024

  5. [13]

    Quantum key distribution (qkd) and quantum cryptography (qc),

    National Security Agency (NSA), “Quantum key distribution (qkd) and quantum cryptography (qc),” https://www.nsa.gov/Cybersecurity/ Quantum-Key-Distribution-QKD-and-Quantum-Cryptography-QC/, n.d., accessed: 2025-07-02

    2025

  6. [14]

    The debate over qkd: A rebuttal to the nsa’s objections,

    R. Renner and R. Wolf, “The debate over qkd: A rebuttal to the nsa’s objections,” 2023. [Online]. Available: https://arxiv.org/abs/2307.15116

    2023 arXiv

  7. [15]

    Quantum advantage in cryptography,

    ——, “Quantum advantage in cryptography,” AIAA Journal, vol. 61, no. 5, p. 1895–1910, May 2023. [Online]. Available: http://dx.doi.org/10.2514/1.J062267

    1910 doi

  8. [16]

    Quantum repeaters: The role of imperfect local operations in quan- tum communication,

    H.-J. Briegel, W. Dür, J. I. Cirac, and P. Zoller, “Quantum repeaters: The role of imperfect local operations in quan- tum communication,” Physical Review Letters , vol. 81, no. 26, p. 5932–5935, Dec. 1998. [Online]. Available: http://dx.doi.org/10.1103/PhysRevLett.81.5932

    1998 doi

  9. [17]

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

    ——, “Quantum repeaters: The role of imperfect local operations in quantum communication,” Physical Review Letters , vol. 81, no. 26, p. 5932–5935, Dec

  10. [18]

    All-photonic quantum repeaters,

    K. Azuma, K. Tamaki, and H.-K. Lo, “All-photonic quantum repeaters,” Nature Communications , vol. 6, no. 1, Apr. 2015. [Online]. Available: http://dx.doi.org/ 10.1038/ncomms7787

    2015 doi

  11. [19]

    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, Dec

  12. [20]

    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, P. Michler, F. Schmidt, and H. Weinfurter, “Extending quantum links: Modules for fiber- and memory-based quantum repeaters,” Advanced Quantum Technologies , vol. 3, no. 11, Oct...

    2020 doi

  13. [21]

    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, S. Sun, M. F. Karim, H. Cai, L. C. Kwek, and A. Q. Liu, “Recent progress in quantum photonic chips for quantum communication and internet,” Light: Science and Applications , vol. 12, no. 1, Jul...

    2023 doi

  14. [22]

    Increasing communication rates using photonic hyperentangled states,

    L. Nemirovsky-Levy, U. Pereg, and M. Segev, “Increasing communication rates using photonic hyperentangled states,” in Frontiers in Optics + Laser Science 2022 (FIO, LS) , ser. FiO. Optica Publishing Group, 2022, p. JTu5A.41. [Online]. Available: http://dx.doi.org/10.1364/FIO.2...

    2022 doi

  15. [23]

    Bassoli, H

    R. Bassoli, H. Boche, C. Deppe, R. Ferrara, F. H. P. Fitzek, G. Janssen, and S. Saeedi- naeeni, Quantum Communication Networks . Springer International Publishing, 2021. [Online]. Available: http://dx.doi.org/10.1007/978-3-030-62938-0

    2021 doi

  16. [24]

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

    C. Bennett, P. Shor, J. Smolin, and A. Thapliyal, “Entanglement-assisted capacity of a quantum channel and the reverse shannon theorem,” IEEE Transactions on Information Theory, vol. 48, no. 10, p. 2637–2655, Oct

  17. [25]

    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,” Physical Review Letters , vol. 118, no. 20, May 2017. [Online]. Available: http: //dx.doi.org/10.1103/PhysRevLett.118.200503

    2017 doi

  18. [26]

    Communication with unreliable entanglement assistance,

    U. Pereg, C. Deppe, and H. Boche, “Communication with unreliable entanglement assistance,” in 2022 IEEE International Symposium on Information Theory (ISIT) . IEEE, Jun. 2022, p. 2231–2236. [Online]. Available: http://dx.doi.org/10.1109/ISIT50566.2022.9834764

    2022

  19. [27]

    Fundamental limits of repeaterless quantum communications,

    S. Pirandola, R. Laurenza, C. Ottaviani, and L. Banchi, “Fundamental limits of repeaterless quantum communications,” Nature Communications , vol. 8, no. 1, Apr. 2017. [Online]. Available: http://dx.doi.org/10.1038/ncomms15043

    2017 doi

  20. [28]

    End-to-end capacities of a quantum communication network,

    S. Pirandola, “End-to-end capacities of a quantum communication network,” Communications Physics , vol. 2, no. 1, May 2019. [Online]. Available: http: //dx.doi.org/10.1038/s42005-019-0147-3

    2019 doi

  21. [29]

    Overcoming the repeaterless bound in continuous-variable quantum communication without quantum memories,

    M. S. Winnel, J. J. Guanzon, N. Hosseinidehaj, and T. C. Ralph, “Overcoming the repeaterless bound in continuous-variable quantum communication without quantum memories,” 2021. [Online]. Available: https: //arxiv.org/abs/2105.03586

    2021 arXiv

  22. [30]

    Overcoming the rate–distance limit of quantum key distribution without quantum repeaters,

    M. Lucamarini, Z. L. Yuan, J. F. Dynes, and A. J. Shields, “Overcoming the rate–distance limit of quantum key distribution without quantum repeaters,” Nature, vol. 557, no. 7705, p. 400–403, May 2018. [Online]. Available: http://dx.doi.org/10.1038/s41586-018-0066-6

    2018 doi

  23. [31]

    Long-distance coherent quantum communications in deployed telecom networks,

    M. Pittaluga, Y . S. Lo, A. Brzosko, R. I. Woodward, D. Scalcon, M. S. Winnel, T. Roger, J. F. Dynes, K. A. Owen, S. Juárez, P. Rydlichowski, D. Vicinanza, G. Roberts, and A. J. Shields, “Long-distance coherent quantum communications in deployed telecom networks,” Nature, vol....

    2025 doi

  24. [32]

    Cooperative strategies and capacity theorems for relay networks,

    G. Kramer, M. Gastpar, and P. Gupta, “Cooperative strategies and capacity theorems for relay networks,” IEEE Transactions on Information Theory , vol. 51, no. 9, p. 3037–3063, Sep. 2005. [Online]. Available: http://dx.doi.org/10.1109/TIT.2005.853304

    2005

  25. [33]

    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, p. 265–444,

  26. [34]

    Three-terminal communication channels,

    E. C. Van Der Meulen, “Three-terminal communication channels,” Advances in Applied Probability , vol. 3, no. 1, p. 120–154, 1971. [Online]. Available: http: //dx.doi.org/10.2307/1426331

    1971 doi

  27. [35]

    The arbitrarily varying relay channel,

    U. Pereg and Y . Steinberg, “The arbitrarily varying relay channel,” Entropy, vol. 21, no. 5, p. 516, May 2019. [Online]. Available: http://dx.doi.org/10.3390/e21050516

    2019 doi

  28. [36]

    Causal state communication,

    C. Choudhuri, Y .-H. Kim, and U. Mitra, “Causal state communication,” 2012. [Online]. Available: https: //arxiv.org/abs/1203.6027

    2012 arXiv

  29. [37]

    Partial decode-forward for quantum relay channels,

    I. Savov, M. M. Wilde, and M. Vu, “Partial decode-forward for quantum relay channels,” in 2012 IEEE International Symposium on Information Theory Proceedings. IEEE, Jul. 2012, p. 731–735. [Online]. Available: http://dx.doi.org/10.1109/ISIT.2012.6284655

    2012

  30. [38]

    Network information theory for classical- quantum channels,

    I. Savov, “Network information theory for classical- quantum channels,” 2012. [Online]. Available: https: //arxiv.org/abs/1208.4188

    2012 arXiv

  31. [39]

    Communication over quantum channels with parameter estimation,

    U. Pereg, “Communication over quantum channels with parameter estimation,” IEEE Transactions on Information Theory , vol. 68, no. 1, p. 359–383, Jan

  32. [40]

    The quantum multiple-access channel with cribbing encoders,

    U. Pereg, C. Deppe, and H. Boche, “The quantum multiple-access channel with cribbing encoders,” IEEE Transactions on Information Theory , vol. 68, no. 6, p. 3965–3988, Jun. 2022. [Online]. Available: http: //dx.doi.org/10.1109/TIT.2022.3149827

    2022

  33. [41]

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

    ——, “Quantum broadcast channels with cooperating decoders: An information-theoretic perspective on quantum repeaters,” Journal of Mathematical Physics , vol. 62, no. 6, Jun. 2021. [Online]. Available: http://dx.doi.org/10.1063/5.0038083

    2021 doi

  34. [42]

    Quantum relay channels,

    U. Pereg, “Quantum relay channels,” 2024. [Online]. Available: https://arxiv.org/abs/2411.16263

    2024 arXiv

  35. [43]

    Capacity-approaching quantum repeaters for quantum communications,

    M. Ghalaii and S. Pirandola, “Capacity-approaching quantum repeaters for quantum communications,” Physical Review A , vol. 102, no. 6, Dec. 2020. [Online]. Available: http://dx.doi.org/10.1103/PhysRevA. 102.062412

    2020 doi

  36. [44]

    Gyongyosi and S

    L. Gyongyosi and S. Imre, Private Quantum Coding for Quantum Relay Networks . Springer Berlin Heidelberg, 2012, p. 239–250. [Online]. Available: http://dx.doi.org/ 10.1007/978-3-642-32808-4_22

    2012 doi

  37. [45]

    Capacities of repeater-assisted quantum communications,

    S. Pirandola, “Capacities of repeater-assisted quantum communications,” 2016. [Online]. Available: https: //arxiv.org/abs/1601.00966

    2016 arXiv

  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 Conference Proceedings , vol. 1635. AIP Publishing LLC, 2014, p. 165–167. [Online]. Available: http://dx.doi.org/10.1063/1.4903125

    2014 doi

  39. [47]

    Lower bounds on the capacities of quantum relay channels,

    J.-J. Shi, R.-H. Shi, X.-Q. Peng, Y . Guo, L.-Y . Yi, and M.-H. Lee, “Lower bounds on the capacities of quantum relay channels,” Communications in Theoretical Physics, vol. 58, no. 4, p. 487–492, Oct. 2012. [Online]. Available: http://dx.doi.org/10.1088/0253-6102/58/4/06

    2012 doi

  40. [48]

    Chakrabarti, A

    A. Chakrabarti, A. Sabharwal, and B. Aazhang, Cooperative Communications . Kluwer Academic Publishers, 2006, p. 29–68. [Online]. Available: http://dx.doi.org/10.1007/1-4020-4711-8_2

    2006 doi

  41. [49]

    Entanglement coordination rates in multi-user networks,

    H. Nator and U. Pereg, “Entanglement coordination rates in multi-user networks,” 2024. [Online]. Available: https://arxiv.org/abs/2403.11893

    2024 arXiv

  42. [50]

    Quantum de finetti theorems under local measurements with applications,

    F. G. S. L. Brandão and A. W. Harrow, “Quantum de finetti theorems under local measurements with applications,” Communications in Mathematical Physics, vol. 353, no. 2, p. 469–506, Apr. 2017. [Online]. Available: http://dx.doi.org/10.1007/s00220-017-2880-3

    2017 doi

  43. [51]

    The capacity of quantum channels with side information at the transmitter,

    F. Dupuis, “The capacity of quantum channels with side information at the transmitter,” in 2009 IEEE International Symposium on Information Theory . IEEE, Jun. 2009, p. 948–952. [Online]. Available: http: //dx.doi.org/10.1109/ISIT.2009.5205591

    2009

  44. [52]

    Perfect quantum error correcting code,

    R. Laflamme, C. Miquel, J. P. Paz, and W. H. Zurek, “Perfect quantum error correcting code,” Physical Review Letters, vol. 77, no. 1, p. 198–201, Jul. 1996. [Online]. Available: http://dx.doi.org/10.1103/PhysRevLett.77.198

    1996 doi

  45. [53]

    Theory of quantum error-correcting codes,

    E. Knill and R. Laflamme, “Theory of quantum error-correcting codes,” Physical Review A , vol. 55, no. 2, p. 900–911, Feb. 1997. [Online]. Available: http://dx.doi.org/10.1103/PhysRevA.55.900

    1997 doi

  46. [54]

    Demonstration of fault-tolerant steane quantum error correction,

    L. Postler, F. Butt, I. Pogorelov, C. D. Marciniak, S. Heußen, R. Blatt, P. Schindler, M. Rispler, M. Müller, and T. Monz, “Demonstration of fault-tolerant steane quantum error correction,” PRX Quantum, vol. 5, no. 3, Aug. 2024. [Online]. Available: http://dx.doi.org/10. 1103/...

    2024

  47. [55]

    Quantum error correction for quantum memories,

    B. M. Terhal, “Quantum error correction for quantum memories,” Reviews of Modern Physics , vol. 87, no. 2, p. 307–346, Apr. 2015. [Online]. Available: http://dx.doi.org/10.1103/RevModPhys.87.307

    2015 doi

  48. [56]

    Nisq+: Boosting quantum computing power by approximating quantum error correction,

    A. Holmes, M. R. Jokar, G. Pasandi, Y . Ding, M. Pedram, and F. T. Chong, “Nisq+: Boosting quantum computing power by approximating quantum error correction,” in 2020 ACM/IEEE 47th Annual International Symposium on Computer Architecture (ISCA) . IEEE, May 2020, p. 556–569. [On...

    2020

  49. [57]

    Multistage entanglement swapping,

    A. M. Goebel, C. Wagenknecht, Q. Zhang, Y .-A. Chen, K. Chen, J. Schmiedmayer, and J.-W. Pan, “Multistage entanglement swapping,” Physical Review Letters, vol. 101, no. 8, Aug. 2008. [Online]. Available: http://dx.doi.org/10.1103/PhysRevLett.101.080403

    2008 doi

  50. [58]

    Long distance quantum teleportation in a quantum relay configuration,

    H. de Riedmatten, I. Marcikic, W. Tittel, H. Zbinden, D. Collins, and N. Gisin, “Long distance quantum teleportation in a quantum relay configuration,” Physical Review Letters, vol. 92, no. 4, Jan. 2004. [Online]. Avail- able: http://dx.doi.org/10.1103/PhysRevLett.92.047904

    2004 doi

  51. [59]

    Quantum teleportation on a photonic chip,

    B. J. Metcalf, J. B. Spring, P. C. Humphreys, N. Thomas-Peter, M. Barbieri, W. S. Kolthammer, X.-M. Jin, N. K. Langford, D. Kundys, J. C. Gates, B. J. Smith, P. G. R. Smith, and I. A. Walmsley, “Quantum teleportation on a photonic chip,” Nature Photonics , vol. 8, no. 10, p. 7...

    2014 doi

  52. [60]

    Real-time decoding for fault-tolerant quantum computing: progress, challenges and outlook,

    F. Battistel, C. Chamberland, K. Johar, R. W. J. Overwater, F. Sebastiano, L. Skoric, Y . Ueno, and M. Usman, “Real-time decoding for fault-tolerant quantum computing: progress, challenges and outlook,” Nano Futures , vol. 7, no. 3, p. 032003, Aug

  53. [61]

    Experimental demonstration of secure relay in quantum secure direct communication network,

    M. Wang, W. Zhang, J. Guo, X. Song, and G. Long, “Experimental demonstration of secure relay in quantum secure direct communication network,” Entropy, vol. 25, no. 11, p. 1548, Nov. 2023. [Online]. Available: http://dx.doi.org/10.3390/e25111548

    2023 doi

  54. [62]

    Entanglement- assisted capacities of compound quantum channels,

    M. Berta, H. Gharibyan, and M. Walter, “Entanglement- assisted capacities of compound quantum channels,” IEEE Transactions on Information Theory , p. 1–1, 2017. [Online]. Available: http://dx.doi.org/10.1109/TIT.2017. 2672981

    2017 doi

  55. [63]

    M. M. Wilde, Quantum Information Theory , 2nd ed. Cambridge, England: Cambridge University Press, Feb. 2017

    2017

  56. [64]

    M. A. Nielsen and I. L. Chuang, Quantum computation and quantum information . Cambridge university press, 2010

    2010

  57. [65]

    Codes for the quantum erasure channel,

    M. Grassl, T. Beth, and T. Pellizzari, “Codes for the quantum erasure channel,” Physical Review A , vol. 56, no. 1, p. 33–38, Jul. 1997. [Online]. Available: http://dx.doi.org/10.1103/PhysRevA.56.33

    1997 doi

  58. [66]

    Available: http://dx.doi.org/10.1088/ 2399-1984/aceba6

    [Online]. Available: http://dx.doi.org/10.1088/ 2399-1984/aceba6

    1984

  59. [67]

    Limitations on quantum key repeaters,

    S. Bäuml, M. Christandl, K. Horodecki, and A. Winter, “Limitations on quantum key repeaters,” Nature Communications, vol. 6, no. 1, Apr. 2015. [Online]. Available: http://dx.doi.org/10.1038/ncomms7908

    2015 doi

  60. [68]

    On the optimal compressions in the compress-and-forward relay schemes,

    X. Wu and L.-L. Xie, “On the optimal compressions in the compress-and-forward relay schemes,” IEEE Transactions on Information Theory , vol. 59, no. 5, p. 2613–2628, May 2013. [Online]. Available: http: //dx.doi.org/10.1109/TIT.2013.2241818

    2013

  61. [69]

    Composable end-to-end security of gaussian quantum networks with untrusted relays,

    M. Ghalaii, P. Papanastasiou, and S. Pirandola, “Composable end-to-end security of gaussian quantum networks with untrusted relays,” npj Quantum Information, vol. 8, no. 1, Sep. 2022. [Online]. Available: http://dx.doi.org/10.1038/s41534-022-00620-5

    2022 doi

  62. [70]

    Classical capacity of the lossy bosonic channel: The exact solution,

    V . Giovannetti, S. Guha, S. Lloyd, L. Maccone, J. H. Shapiro, and H. P. Yuen, “Classical capacity of the lossy bosonic channel: The exact solution,” Physical Review Letters, vol. 92, no. 2, Jan. 2004. [Online]. Available: http://dx.doi.org/10.1103/PhysRevLett.92.027902

    2004 doi

  63. [71]

    Learning a quantum channel from its steady-state,

    Y . Ilin and I. Arad, “Learning a quantum channel from its steady-state,” New Journal of Physics , vol. 26, no. 7, p. 073003, Jul. 2024. [Online]. Available: http://dx.doi.org/10.1088/1367-2630/ad5464

    2024 doi

  64. [72]

    Capacities of quantum erasure channels,

    C. H. Bennett, D. P. DiVincenzo, and J. A. Smolin, “Capacities of quantum erasure channels,” Physical Review Letters , vol. 78, no. 16, p. 3217–3220, Apr

  65. [73]

    Evaluating the noise resilience of variational quantum algorithms,

    E. Fontana, N. Fitzpatrick, D. M. Ramo, R. Duncan, and I. Rungger, “Evaluating the noise resilience of variational quantum algorithms,” Physical Review A , vol. 104, no. 2, Aug. 2021. [Online]. Available: http://dx.doi.org/10.1103/PhysRevA.104.022403

    2021 doi

  66. [74]

    The mother of all protocols: restructuring quantum information’s family tree,

    A. Abeyesinghe, I. Devetak, P. Hayden, and A. Winter, “The mother of all protocols: restructuring quantum information’s family tree,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 465, no. 2108, p. 2537–2563, Jun. 2009. [Online]. Ava...

    2009 doi

  67. [75]

    A fully quantum asymptotic equipartition property,

    M. Tomamichel, R. Colbeck, and R. Renner, “A fully quantum asymptotic equipartition property,” IEEE Transactions on Information Theory , vol. 55, no. 12, p. 5840–5847, Dec. 2009. [Online]. Available: http: //dx.doi.org/10.1109/TIT.2009.2032797

    2009

  68. [79]

    Dissipative variational quantum algorithms for gibbs state preparation,

    ——, “Dissipative variational quantum algorithms for gibbs state preparation,” IEEE Transactions on Quantum Engineering, vol. 6, p. 1–12, 2025. [Online]. Available: http://dx.doi.org/10.1109/TQE.2024.3511419

    2025

  69. [1997]

    Available: http://dx.doi.org/10.1103/ PhysRevLett.78.3217

    [Online]. Available: http://dx.doi.org/10.1103/ PhysRevLett.78.3217

  70. [1998]

    Available: http://dx.doi.org/10.1103/ PhysRevLett.81.5932

    [Online]. Available: http://dx.doi.org/10.1103/ PhysRevLett.81.5932

  71. [2002]

    Available: http://dx.doi.org/10.1109/TIT

    [Online]. Available: http://dx.doi.org/10.1109/TIT. 2002.802612

    2002

  72. [2008]

    Available: http://dx.doi.org/10.1561/ 0100000028

    [Online]. Available: http://dx.doi.org/10.1561/ 0100000028

  73. [2022]

    Available: http://dx.doi.org/10.1109/TIT

    [Online]. Available: http://dx.doi.org/10.1109/TIT. 2021.3123221

    2021

  74. [2023]

    Available: http://dx.doi.org/10.1103/ RevModPhys.95.045006

    [Online]. Available: http://dx.doi.org/10.1103/ RevModPhys.95.045006

Pith tools

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