REVIEW 3 major objections 2 minor 1 cited by
Entanglement assisted communication complexity measured by distinguishability
T0 review · 3 major / 2 minor · reviewed 2026-07-13 · grok-4.5
Pith's one-line read Under distinguishability constraints on the sender’s inputs, entanglement-assisted classical communication, entanglement-assisted quantum communication, and quantum communication are equivalent, and non-maximally entangled states can outper
desk verdict Abstract-only: plausible equivalences and non-maximal entanglement advantages in distinguishability-constrained communication complexity, but proofs and task naturalness are unchecked. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
A general framework for communication tasks with pre-shared correlations under distinguishability constraints on the sender’s inputs. The framework is used both to prove the equivalence of the three communication paradigms and to construct the explicit tasks that exhibit the one-bit and non-maximal-entanglement advantages.
What would settle it
Exhibit a distinguishability-constrained task in which entanglement-assisted classical communication and pure quantum communication achieve different success probabilities, or show that every task in the authors’ explicit class is optimized by a maximally entangled state rather than a non-maximal one.
Extended reading notes
Core claim
For two-party communication tasks constrained by the distinguishability of the sender’s inputs, entanglement-assisted classical communication, entanglement-assisted quantum communication, and quantum communication are equivalent; no hierarchy separates them. In addition, there exist tasks in which entanglement-assisted one-bit classical communication outperforms classical communication with shared randomness, and tasks in which non-maximally entangled states outperform maximally entangled states as the pre-shared resource.
Load-bearing premise
The claimed equivalences and advantages hold only under the particular distinguishability constraints the authors place on the sender’s inputs; if those constraints are too special to capture natural communication tasks, the no-hierarchy and non-maximal superiority results may not transfer.
Editorial extensions
If this is right
- Entanglement-assisted classical communication can match the full power of quantum communication for every task inside the framework.
- Restricting the dimension of the message can create an entanglement-assisted advantage even when the receiver has no input.
- A single classical bit assisted by entanglement can outperform classical communication with shared randomness on concrete distinguishability-constrained tasks.
- Non-maximally entangled states can be strictly better pre-shared resources than maximally entangled states for an explicit family of tasks.
Reading between the lines
- The equivalence collapses three resource settings into one, potentially simplifying the classification of communication advantages under input-distinguishability constraints.
- The superiority of non-maximal entanglement suggests that standard entanglement monotones may not fully rank resources for communication tasks of this type.
- Analogous distinguishability constraints could be used to test whether similar equivalences hold for multi-round or multipartite communication.
- Dimension-restricted advantages may guide the design of practical protocols when channel capacity is limited.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript studies two-party communication with pre-shared correlations under constraints on the distinguishability of the sender’s inputs. Within a general framework for such tasks, it claims that entanglement-assisted classical communication, entanglement-assisted quantum communication, and plain quantum communication are equivalent (no resource hierarchy). It further claims that no advantage arises when the receiver has no input, unless the dimension of the communicated message is constrained; that entanglement-assisted one-bit classical communication can outperform classical communication with shared randomness; and that, for an explicit class of tasks, non-maximally entangled states can outperform maximally entangled states as pre-shared resources.
Significance. If the equivalence and advantage claims hold for a natural class of distinguishability-constrained tasks, the work would clarify the resource hierarchy among standard communication paradigms and supply concrete counterexamples to the intuition that maximal entanglement is always optimal. The construction of explicit tasks that separate entanglement-assisted one-bit classical communication from classical shared-randomness protocols, and that favor non-maximal entanglement, would be of genuine interest to quantum communication complexity. Because only the abstract is available, these strengths remain conditional on the soundness of the unexamined proofs and task definitions.
major comments (3)
- [Abstract] Abstract (central equivalence claim): The no-hierarchy result among entanglement-assisted classical communication, entanglement-assisted quantum communication, and quantum communication is load-bearing for the paper’s main contribution. With only the abstract available it is impossible to verify whether the equivalence is proved for a natural operational class of distinguishability constraints or whether the framework restricts encodings so that the three resources coincide by construction. A concrete check of the definitions and the equivalence proof is required before the claim can be accepted.
- [Abstract] Abstract (non-maximal entanglement superiority): The claim that non-maximally entangled states outperform maximally entangled states rests on an “explicit class of communication tasks.” Without the task family, the quantitative figure of merit, and the comparison, it is unclear whether the advantage is genuine or an artifact of an asymmetric distinguishability metric. The explicit construction and the comparison must be examined before this claim can be treated as established.
- [Abstract] Abstract (receiver-no-input / dimension-constrained regime): The paper asserts no advantage when the receiver has no input, yet an advantage once message dimension is constrained, and that this “highlights the superiority of entanglement-assisted classical communication over standard quantum communication.” The logical step from the dimension constraint to superiority over quantum communication needs a precise statement of the allowed resources and a proof that is not visible from the abstract alone.
minor comments (2)
- [Abstract] The abstract uses “distinguishability of the sender’s inputs” as the central operational restriction but does not indicate how distinguishability is quantified (e.g., fidelity, trace distance, or a task-specific metric). A precise definition early in the manuscript would aid readability.
- [Abstract] Phrases such as “typical two-party communication scenarios” and “several tasks” are vague for a formal abstract; naming the concrete figures of merit or task families would improve precision.
Circularity Check
Abstract-only review: no circular reduction can be exhibited; claimed equivalences and advantages are not shown to equal their inputs by construction.
full rationale
Only the abstract is available; no equations, definitions of the distinguishability constraint, task families, or proof steps appear in the provided text. Hard rule 1 forbids claiming circularity without a quote that exhibits a specific reduction (e.g., Eq. X = Eq. Y by construction, or a fitted parameter renamed as a prediction). The abstract states operational results—equivalence of entanglement-assisted classical, entanglement-assisted quantum, and quantum communication under distinguishability constraints; no advantage when the receiver has no input; advantages under message-dimension constraints; one-bit EA classical beating classical with shared randomness; and non-maximally entangled states outperforming maximally entangled ones—but none of these statements, on their face, redefine a quantity as its own input or rename a known empirical pattern. Self-citation load-bearing, uniqueness-from-authors, or ansatz-smuggling cannot be checked without the body or bibliography. Residual risk that the framework forces equivalence by construction remains unverified speculation and is therefore not scored as circularity. Per the default expectation and hard rules 3 and 7, the honest finding is no significant circularity (score 0), with empty steps.
Assumptions & free parameters
assumptions (3)
- standard math Standard quantum mechanics and the usual model of two-party communication with shared entanglement or shared randomness.
- domain assumption Communication tasks are constrained by the distinguishability of the sender’s inputs in a way that makes the claimed resource comparisons meaningful.
- domain assumption Message dimension can be independently restricted while still allowing meaningful comparison of classical vs quantum messages.
Cite this review
Pith. "Pith review of Entanglement assisted communication complexity measured by distinguishability." pith.science (2026). https://pith.science/paper/XSDV43QD
@misc{pith2026260319105,
author = {Pith},
title = {Pith review of: Entanglement assisted communication complexity measured by distinguishability},
year = {2026},
howpublished = {\url{https://pith.science/paper/XSDV43QD}},
note = {Machine review of arXiv:2603.19105}
}
read the original abstract
We investigate the quantum advantage that can arise in typical two-party communication scenarios, where the sender and the receiver are allowed to share prior correlations. Focusing on communication tasks constrained by the distinguishability of the sender's inputs, we demonstrate that entanglement-assisted communication with both classical and quantum message can outperform classical communication supplemented with shared randomness. We begin by developing a general framework for communication tasks with pre-shared correlations. Within this framework, we establish an equivalence among entanglement-assisted classical communication, entanglement-assisted quantum communication, and quantum communication, showing that no hierarchy exists between these three paradigms. We then investigate the scenario where the receiver has no input and prove that no advantage can arise in this case. However, an advantage in the entanglement-assisted setting emerges once additional constraints are imposed on the dimension of the communicated message. This further highlights the superiority of entanglement-assisted classical communication over standard quantum communication. Then we demonstrate several tasks where the entanglement-assisted protocol using one-bit communication proves to be advantageous over classical communication. Finally, by constructing an explicit class of communication tasks, we show that a non-maximally entangled states outperform the maximally entangled state as a pre-shared resource between the communicating parties.
Forward citations
Cited by 1 Pith paper
-
Semi-Device-Independent Quantum Key Distribution from Operational Assumptions
Operational bounds on state exclusion (not only identification) plus a three-setting retained-key protocol certify positive SDI-QKD rates down to nearly vanishing preparation visibility.
Reviewed July 13, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.