Pith. sign in

REVIEW 2 major objections 5 minor 1 cited by

The Interference Channel with Entangled Transmitters

T0 review · 2 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 inner and outer bounds on the capacity region of the interference channel with entangled transmitters and exhibits a magic-square channel where entanglement strictly beats every classical strategy.

desk verdict Useful inner bound and a nice example, but the outer bound proof has an unjustified conditioning swap, so the bracketing theorem is not proven. read the letter →

arxiv 2411.10067 v2 pith:DXM7T3GO submitted 2024-11-15 quant-ph cs.ITmath.IT

Jonas Hawellek , Athin Mohan , Hadi Aghaee , Christian Deppe This is my paper · ORCID
classification quant-phcs.ITmath.IT MSC 94A1594A4081P45 PACS 03.67.-a03.67.Hk
keywords interferencechannelentanglement-assistedcommunicationcapacityregionHan-Kobayashiinnerboundoutermagicsquaregamequantumadvantagemultipleaccess
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 asks whether shared quantum entanglement between the two senders can raise communication rates over a classical two-sender, two-receiver interference channel. It supplies general capacity-region bounds for this setting: an achievable inner region RET-HK built from rate-splitting and superposition coding, and an outer region RET-o obtained from Fano-type arguments. The bounds are single-letter expressions that mirror the classical Han-Kobayashi and standard outer bounds, with the entangled measurement encoders recorded through a union over shared states and POVMs. The paper then exhibits a concrete channel, derived from the magic square game, where entanglement-assisted coding achieves sum rate $2\log_2(3)\approx 3.17$ bits per use while every classical strategy is limited to $3.02$, so the answer is yes: entanglement between transmitters can strictly enlarge the capacity region.

What carries the argument

The machinery is a Han-Kobayashi-style rate-splitting/superposition code in which the encoders are POVMs $L_1,L_2$ acting on a shared bipartite entangled state $\varphi_{E_1E_2}$, so the channel inputs $X_1,X_2$ inherit correlations from the entanglement and the auxiliary variables $V_k$ cannot be collapsed into $X_k$. The outer bound uses the same POVM structure with a time-sharing variable $V_0$ and Fano-based single-letterization. For the concrete advantage, the magic square game supplies a perfect quantum strategy with winning probability 1 and a classical optimum of 8/9, and the channel outputs the question pair only on winning inputs; this makes the entanglement-assisted sum rate $2\log_2(3)$ achievable while the merged-output MAC argument caps classical strategies at 3.02.

What would settle it

Compute the true classical sum capacity of the magic-square interference channel without merging the outputs; if any classical strategy reaches $R_1+R_2 \ge 2\log_2(3)\approx 3.17$, the claimed strict quantum advantage is false. A second check is to search for an entanglement-assisted code exceeding the outer bound $R_{\mathrm{ET-o}}$, which would refute the outer bound itself.

Watch

Extended reading notes

Core claim

The central claim is that for every discrete memoryless interference channel with entangled transmitters the capacity region $C_{\mathrm{ET}}$ satisfies $R_{\mathrm{ET-HK}} \subseteq C_{\mathrm{ET}} \subseteq R_{\mathrm{ET-o}}$, where $R_{\mathrm{ET-HK}}$ is the union over rate-splitting/superposition distributions, shared entangled states, and POVMs of the seven inequalities (17)-(23), and $R_{\mathrm{ET-o}}$ is the union of the three inequalities (27)-(29). The inner bound is achieved by Han-Kobayashi-style random coding in which each message is split into a common and a private part and the channel input is produced by measuring a shared entangled state; the outer bound follows from Fano's inequality after single-letterizing with a time-sharing variable. The paper's example is an interference channel built from the magic square game, for which the entanglement-assisted region contains the point $R_1+R_2 = 2\log_2(3)$, while every classical strategy has $R_1+R_2 \le 3.02$. This establishes a strict gap between classical and entanglement-assisted capacity for a concrete two-sender, two-receiver channel.

Load-bearing premise

The strict quantum-advantage example rests on an external result that every classical strategy on the magic-square MAC has sum rate at most 3.02 bits per use, together with the transfer of that bound to the interference channel by merging the receiver outputs into one MAC; if either the external bound or the transfer is invalid, the claimed 3.17-versus-3.02 separation collapses.

Editorial extensions

If this is right

  • The inner bound $R_{\mathrm{ET-HK}}$ is achievable for every discrete memoryless interference channel, so any rate pair inside it is a lower bound on the entanglement-assisted capacity region.
  • The outer bound $R_{\mathrm{ET-o}}$ is a single-letter ceiling for every entanglement-assisted code, giving a concrete target that any claimed quantum advantage must beat.
  • On the magic-square-game channel, entanglement-assisted coding reaches $R_1+R_2 = 2\log_2(3)$, and the paper's merged-output argument shows this advantage persists for any non-local-game channel whose MAC version has a quantum-versus-classical gap.
  • For channels built from non-local games, receiver cooperation in the IC is equivalent to a MAC, so the same classical sum-rate bound applies and the quantum strategy consistently wins.

Reading between the lines

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

  • The 3.17-versus-3.02 gap is computed through the MAC ceiling obtained by merging the two receiver outputs; a direct classical IC bound would likely give a smaller ceiling, so the true quantum advantage on this channel may be larger than the stated gap.
  • The inner and outer bounds do not coincide, so the paper leaves open whether entanglement helps on channels where the classical Han-Kobayashi region is already tight; finding strong-interference-type conditions for entangled encoders would close this gap.
  • Because any non-local game with a quantum-versus-classical winning gap yields a candidate IC by the same construction, the magic-square example is evidence that entanglement-assisted transmitter coordination is a general resource in interference networks, not an isolated example.
  • A concrete finite bound on the auxiliary alphabets and the entangled-state dimension is still missing; without it, the regions are defined by infinite unions and are not directly computable.
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

2 major / 5 minor

Summary. The paper studies the two-sender, two-receiver classical interference channel with entanglement shared between the transmitters. It proposes an inner bound RET-HK (Theorem 3) obtained by a Han-Kobayashi-type superposition coding scheme with quantum measurements, and an outer bound RET-o (Theorem 6) obtained by single-letterizing the Fano-type inequalities. It also constructs a concrete example based on the magic-square game (Theorem 8) in which entanglement is claimed to strictly enlarge the capacity region: the classical sum-rate is at most 3.02 bits per use, while the entanglement-assisted sum-rate reaches 2 log2(3) ≈ 3.17 bits per use. The inner-bound proof follows the standard typicality analysis with the measurement layer folded into the input distribution, and the example uses a published classical upper bound for the corresponding MAC. The central claim is the bracketing relationship RET-HK ⊆ CET ⊆ RET-o.

Significance. If the bounds are correct, the paper extends entanglement-assisted communication from the multiple-access channel to the interference channel, a central network model, and provides a clean example of a quantum advantage. The inner-bound construction is a natural adaptation of Han-Kobayashi coding to entangled transmitters, and the magic-square example is well matched to known non-local-game techniques. The paper is also transparent about its limitations, explicitly noting the absence of cardinality bounds for the auxiliary variables U1 and U2. However, the outer bound proof contains a load-bearing gap in its single-letterization step, so the bracketing result is not established as written. The inner bound and the example are not affected by this specific gap, but the headline claim of a capacity-region bracketing relies on the validity of the outer bound.

major comments (2)
  1. [Section VII, Eqs. (64) and (70)] The proof of Theorem 6 does not establish the claimed single-letterization for the individual-rate bounds. Starting from n(R1 - ε) ≤ Σ_i I(M1; Y1[i] | Y1^{i-1}, M2), the paper defines V0[i] = (Y1^{i-1}, Y2^{i-1}) and Vk[i] = (Mk, Y1^{i-1}, Y2^{i-1}) and then rewrites the sum as (1/n) Σ_i I(V1[i]; Y1[i] | V0[i], V2[i]). With these definitions, the summand equals I(M1; Y1[i] | Y1^{i-1}, Y2^{i-1}, M2), which is not equal to I(M1; Y1[i] | Y1^{i-1}, M2) in general. Conditioning on the additional Y2^{i-1} can strictly decrease the mutual information; for example, in a deterministic code for a channel with Y1 = X1 ⊕ Z and Y2 = X1 with X1 = f(M1) injective, Y2^{i-1} reveals M1 and makes the new sum strictly smaller than the quantity it is supposed to upper-bound. Consequently the inequality nR1 ≤ (1/n) Σ_i I(V1[i]; Y1[i] | V0[i], V2[i]) is not justified, and the proof of the individual outer bounds (27) and (28) fails. The sum-rate bound (29) is not affected, since it follows directly from the chain rule with (Y1^{i-1}, Y2^{i-1}) as the natural past. Because Theorem 6 is the outer-bound half of the central bracketing result, this gap is load-bearing and requires a corrected proof.
  2. [Section VII, after Eq. (69)] The single-letterization also relies on the assertion that the channel inputs Xk[i] can be represented by a product of measurements of the form Lk(xk|i, V0[i], Vk[i]) for a shared state φ. For a general block code whose encoding POVMs act jointly on n copies of the shared state, the marginal measurement at position i is a valid measurement on the full n-copy system, but it is not automatically a product of single-copy measurements on a fixed single-copy state. The paper refers to [21] for this technique; if the analogy is exact, the authors should state and prove the relevant lemma in their own notation, since the outer bound's region P′ requires the specific factorization in (26). This is part of the same proof gap and should be addressed together with the step from (64) to (70).
minor comments (5)
  1. [Section IV-A, paragraph 2] There is a typo: "advanatges" should be "advantages".
  2. [Section V-B, paragraph 4] The phrase "As as result" should be "As a result"; also "winning the the game" should be "winning the game".
  3. [Section VII, Eq. (68)] In the tensor product on the left-hand side, the second factor should be L̃(i,m2)_{E2→X2}, not L̃(i,m1)_{E1→X1}.
  4. [Section VIII, final paragraph] The text says "the bounds in (17) – (17)" but should refer to (17)–(23).
  5. [Remark 2, Section IV-A] The absence of cardinality bounds for U1 and U2 is acknowledged, but the paper could beneficially add a short discussion of whether finite bounds follow from the same arguments as in [21] or whether the union over unbounded alphabets is essential.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: inner and outer bounds are derived from coding arguments and external benchmarks; self-citations are not load-bearing.

full rationale

The paper's central results are not circular. Theorem 3's inner bound is proved by a standard random-coding/typicality argument with rate-splitting and superposition coding, leading to inequalities (49)-(56) and then Fourier-Motzkin elimination to (17)-(23); the region is not assumed as an input. Theorem 6's outer bound is a converse attempt beginning from Fano and data-processing inequalities (57)-(63) and attempting a single-letterization; although the conditioning step from (64) to (70) is questionable (a correctness risk, not a circularity), the claimed bound is not being assumed or fitted. The magic-square example uses an external classical MAC sum-rate upper bound from [7] and the known perfect quantum strategy from [15]; neither is derived from the present paper's conclusions, and the IC-to-MAC argument (39)-(40) is an explicit reduction with independent content. Self-citations to [21] and [8] (overlapping author Deppe) occur for technical analogies and purification, but the relevant arguments are either restated in the paper (e.g., the purification appendix) or are non-essential analogies; no load-bearing claim reduces to a self-citation. There is no fitted parameter relabeled as a prediction and no uniqueness theorem imported from the authors. The acknowledged absence of cardinality bounds for U1 and U2 is a limitation, not a circularity. The reader-flagged conditioning gap in the outer-bound proof is a mathematical-validity concern that should be assessed separately, not as circularity.

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

No numerical constants are fitted in this paper. The rate regions are unions over auxiliary distributions, quantum states, and POVMs; these are optimization variables, not fitted parameters. The 3.02 value in the example is imported from [7] and is not fitted here. The axioms are standard information-theoretic tools and domain assumptions about entanglement-assisted encoding.

assumptions (7)
  • standard math Fano's inequality
    Used in Section VII to convert vanishing error probabilities into entropy bounds in the outer bound derivation.
  • standard math Method of types and joint typicality for random coding
    Used in Section VI to bound the error events in the achievability proof of the inner bound.
  • standard math Fenchel-Eggleston-Caratheodory theorem
    Used in Section VIII and Lemma 7 to bound the alphabet size of the time-sharing variable V0.
  • domain assumption Discrete memoryless classical channel model with pre-shared entanglement
    Definition 1 and Eq. (16); the capacity region is defined over codes using POVM encoders on shared quantum states.
  • domain assumption Unlimited, noiseless entanglement assistance
    Remark 2 states the dimensions of the entangled state are unbounded; the bounds do not model noisy or finite-rate entanglement.
  • domain assumption Magic square game has a perfect quantum strategy and classical winning probability 8/9
    Used in Section V to construct the example and compute the entangled sum rate; relies on [15].
  • domain assumption External bound R1+R2 <= 3.02 for classical strategies on the game-based MAC from [7]
    Used in Eq. (40) to upper bound the classical IC sum rate; the bound is imported, not derived in this paper.

how reviews work

0 comments
Cite this review

Pith. "Pith review of The Interference Channel with Entangled Transmitters." pith.science (2026). https://pith.science/paper/DXM7T3GO

@misc{pith2026241110067,
  author       = {Pith},
  title        = {Pith review of: The Interference Channel with Entangled Transmitters},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/DXM7T3GO}},
  note         = {Machine review of arXiv:2411.10067}
}
read the original abstract

This paper explores communication over a two-sender, two-receiver classical interference channel, enhanced by the availability of entanglement resources between transmitters. The central contributions are an inner and outer bound on the capacity region for a general interference channel with entangled transmitters. It addresses the persistent challenge of the lack of a general capacity formula, even in the purely classical case, and highlights the striking similarities in achievable rate expressions when assessing quantum advantages. Through a concrete example, it is shown that entanglement can significantly boost performance in certain types of channels.

Figures

Figures reproduced from arXiv: 2411.10067 by the authors.

Figure 1
Figure 1. The classical interference channel PY1,Y2|X1,X2 with entanglement resources (quantum systems) shared between the transmitters. The entanglement resources of transmitter 1 and transmitter 2 are marked in red and blue, respectively. semi-definite measurement operators L = {Lx}x∈X that satisfy the condition P x∈X Lx = 1 with 1 being the identity operator on the respective Hilbert space. The probability of obtaining the… view at source ↗
Figure 2
Figure 2. Superposition coding at transmitter 1. Message [PITH_FULL_IMAGE:figures/full_fig_p008_2.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Virtual Signaling of CSIT via Non-Signaling Assistance

    cs.IT 2025-06 accept novelty 8.0 of 10

    With non-signaling assistance, a channel with non-causal CSIT has the same capacity as if the receiver also knew the state, and broadcast channels behave as if the other user's message were receiver side information.

Reference graph

Works this paper leans on

28 extracted references · 28 canonical work pages · cited by 1 Pith paper

  1. [21]

    The Multiple-Access Channel with Entangled Transmitters

    U. Pereg, C. Deppe, and H. Boche, “The multiple-access channel with entangled transmitters,” Feb. 2024, arXiv:2303.10456 [quant-ph]

    work page Pith review arXiv 2024

  2. [1]

    A novel architecture for future classical-quantum communication networks,

    F. Granelli, R. Bassoli, J. N ¨otzel, F. H. P. Fitzek, H. Boche, N. L. S. da Fonseca, and A. Guerrieri, “A novel architecture for future classical-quantum communication networks,” Wireless Communications & Mobile Computing , vol. 2022, Jan. 2022

    work page 2022

  3. [2]

    Quantum cryptography based on Bell’s theorem,

    A. K. Ekert, “Quantum cryptography based on Bell’s theorem,” Physical Review Letters , vol. 67, no. 6, p. 661–663, Aug. 1991

    work page 1991

  4. [3]

    Entanglement-assisted classical capacity of noisy quantum channels,

    C. H. Bennett, P. W. Shor, J. A. Smolin, and A. V . Thapliyal, “Entanglement-assisted classical capacity of noisy quantum channels,” Physical Review Letters, vol. 83, no. 15, p. 3081–3084, Oct. 1999

    work page 1999

  5. [4]

    Entanglement-assisted capacity of quantum multiple-access channels,

    M.-H. Hsieh, I. Devetak, and A. Winter, “Entanglement-assisted capacity of quantum multiple-access channels,” IEEE Transactions on Information Theory, vol. 54, no. 7, p. 3078–3090, Jul. 2008

    work page 2008

  6. [5]

    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, p. 1497, Mar. 2020

    work page 2020

  7. [6]

    Entanglement-enabled communication,

    J. N ¨otzel, “Entanglement-enabled communication,” IEEE Journal on Selected Areas in Information Theory , vol. 1, no. 2, p. 401–415, Aug. 2020

    work page 2020

  8. [7]

    On the separation of correlation-assisted sum capacities of multiple access channels,

    A. Seshadri, F. Leditzky, V . Siddhu, and G. Smith, “On the separation of correlation-assisted sum capacities of multiple access channels,” IEEE Transactions on Information Theory , vol. 69, no. 9, p. 5805–5844, Sep. 2023

    work page 2023

Show all 28 references
  1. [8]

    The multiple-access channel with entangled transmitters,

    U. Pereg, C. Deppe, and H. Boche, “The multiple-access channel with entangled transmitters,” IEEE Global Communications Conference, p. 3173–3178, Dec. 2023

    2023

  2. [9]

    Quantum broadcast channels,

    J. Yard, P. Hayden, and I. Devetak, “Quantum broadcast channels,” IEEE Transactions on Information Theory , vol. 57, no. 10, p. 7147–7162, Oct. 2011

    2011

  3. [10]

    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,” IEEE International Symposium on Information Theory , p. 772–777, Jul. 2021

    2021

  4. [11]

    Interference channels with source cooperation,

    V . M. Prabhakaran and P. Viswanath, “Interference channels with source cooperation,” IEEE Transactions on Information Theory , vol. 57, no. 1, p. 156–186, Jan. 2011

    2011

  5. [12]

    Quantum and superquantum enhancements to two-sender, two-receiver channels,

    Y . Quek and P. W. Shor, “Quantum and superquantum enhancements to two-sender, two-receiver channels,” Physical Review A, vol. 95, no. 5, p. 052329, May 2017

    2017

  6. [13]

    Proposed experiment to test local hidden-variable theories,

    J. F. Clauser, M. A. Horne, A. Shimony, and R. A. Holt, “Proposed experiment to test local hidden-variable theories,” Physical Review Letters , vol. 23, no. 15, p. 880–884, Oct. 1969

    1969

  7. [14]

    Quantum nonlocality as an axiom,

    S. Popescu and D. Rohrlich, “Quantum nonlocality as an axiom,” Foundations of Physics, vol. 24, no. 3, p. 379–385, Mar. 1994

    1994

  8. [15]

    Quantum pseudo-telepathy,

    G. Brassard, A. Broadbent, and A. Tapp, “Quantum pseudo-telepathy,” Foundations of Physics, vol. 35, no. 11, p. 1877–1907, Nov. 2005

    1907

  9. [16]

    El Gamal and Y .-H

    A. El Gamal and Y .-H. Kim, Network information theory . Cambridge: Cambridge University Press, 2011

    2011

  10. [17]

    A new achievable rate region for the interference channel,

    T. Han and K. Kobayashi, “A new achievable rate region for the interference channel,” IEEE Transactions on Information Theory , vol. 27, no. 1, p. 49–60, Jan. 1981

    1981

  11. [18]

    On the Han–Kobayashi region for the interference channel,

    H.-F. Chong, M. Motani, H. K. Garg, and H. El Gamal, “On the Han–Kobayashi region for the interference channel,” IEEE Transactions on Information Theory, vol. 54, no. 7, p. 3188–3195, Jul. 2008

    2008

  12. [19]

    Sub-optimality of Han-Kobayashi achievable region for interference channels,

    C. Nair, L. Xia, and M. Yazdanpanah, “Sub-optimality of Han-Kobayashi achievable region for interference channels,” IEEE International Symposium on Information Theory , p. 2416–2420, Jun. 2015

    2015

  13. [20]

    Two-user communication channels,

    H. Sato, “Two-user communication channels,” IEEE Transactions on Information Theory , vol. 23, no. 3, p. 295–304, May 1977

    1977

  14. [22]

    Convexity,

    H. G. Eggleston, “Convexity,” Journal of the London Mathematical Society , vol. s1-41, no. 1, p. 183–186, 1966

    1966

  15. [23]

    The capacity region of the discrete memoryless interference channel with strong interference (corresp.),

    M. Costa and A. Gamal, “The capacity region of the discrete memoryless interference channel with strong interference (corresp.),” IEEE Transactions on Information Theory , vol. 33, no. 5, p. 710–711, Sep. 1987

    1987

  16. [24]

    Csisz ´ar and J

    I. Csisz ´ar and J. K ¨orner, Information Theory: Coding Theorems for Discrete Memoryless Systems , 2nd ed. Cambridge: Cambridge University Press, 2011

    2011

  17. [25]

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

    2008

  18. [26]

    T. M. Cover and J. A. Thomas, Elements of Information Theory , 1st ed. Hoboken, New Jersey: Wiley, 2005

    2005

  19. [27]

    Parallel device-independent quantum key distribution,

    R. Jain, C. A. Miller, and Y . Shi, “Parallel device-independent quantum key distribution,” IEEE Transactions on Information Theory , vol. 66, no. 9, p. 5567–5584, Sep. 2020

    2020

  20. [28]

    Device-independent quantum key distribution based on the Mermin-Peres magic square game,

    Y .-Z. Zhen, Y . Mao, Y .-Z. Zhang, F. Xu, and B. C. Sanders, “Device-independent quantum key distribution based on the Mermin-Peres magic square game,” Physical Review Letters , vol. 131, no. 8, p. 080801, Aug. 2023

    2023

Pith tools

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