REVIEW 2 cited by
On entanglement assistance to a noiseless classical channel
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
On entanglement assistance to a noiseless classical channel
read the original abstract
For a classical channel, neither the Shannon capacity, nor the sum of conditional probabilities corresponding to the cases of successful transmission can be increased by the use of shared entanglement, or, more generally, a non-signaling resource. Yet, perhaps somewhat counterintuitively, entanglement assistance can help and actually elevate the chances of success even in a one-way communicational task that is to be completed by a single-shot use of a noiseless classical channel. To quantify the help that a non-signaling resource provides to a noiseless classical channel, one might ask how many extra letters should be added to the alphabet of the channel in order to perform equally well without the specified non-signaling resource. As was observed by Cubitt, Leung, Matthews, and Winter, there is no upper bound on the number of extra letters required for substituting the assistance of a general non-signaling resource to a noiseless one-bit classical channel. In contrast, here we prove that if this resource is a bipartite quantum system in a maximally entangled state, then an extra classical bit always suffices as a replacement.
Forward citations
Cited by 2 Pith papers
-
Can outcome communication explain Bell nonlocality?
For any qubit-qudit state under all projective measurements, an LHV model with outcome communication exists if and only if a standard LHV model without communication exists.
-
An Operational Framework for Nonclassicality in Quantum Communication Networks
A variational optimization framework computes linear classical bounds on network input/output probabilities whose violation certifies nonclassicality, finding entanglement necessary for nonclassicality in single-sende...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.