Pith. sign in

REVIEW 1 cited by

Facets of Non-locality and Advantage in Entanglement-Assisted Classical Communication Tasks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2507.10830 v1 pith:TVBFN3LN submitted 2025-07-14 quant-ph

Facets of Non-locality and Advantage in Entanglement-Assisted Classical Communication Tasks

classification quant-ph
keywords advantageclassicalcommunicationnon-localtasksassistancetaskbounded
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We reveal key connections between non-locality and advantage in correlation-assisted classical communication. First, using the wire-cutting technique, we provide a Bell inequality tailored to any correlation-assisted bounded classical communication task. The violation of this inequality by a quantum correlation is equivalent to its quantum-assisted advantage in the corresponding communication task. Next, we introduce wire-reading, which leverages the readability of classical messages to demonstrate advantageous assistance of non-local correlations in setups where no such advantage can be otherwise observed. Building on this, we introduce families of classical communication tasks in a Bob-without-input prepare-and-measure scenario, where non-local correlation enhances bounded classical communication while shared randomness assistance yields strictly suboptimal payoff. For the first family of tasks, assistance from any non-local facet leads to optimal payoff, while each task in the second family is tailored to a non-local facet. We reveal quantum advantage in these tasks, including qutrit over qubit entanglement advantage.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. On graph products and multi-word-representability

    math.CO 2026-03 unverdicted novelty 6.0

    μ is preserved under Cartesian and rooted products, bounded under other products, and used to prove a sublinear τ(n) bound and a negative answer to the Word-representable Bipartition problem for n≥2593.