Pith. sign in

REVIEW 1 cited by

Simple Information Processing Tasks with Unbounded Quantum Advantage

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 2308.07727 v4 pith:KHBZMQMD submitted 2023-08-15 quant-ph

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

Communication scenarios between two parties can be implemented by first encoding messages into some states of a physical system which acts as the physical medium of the communication and then decoding the messages by measuring the state of the system. We show that already in the simplest possible scenarios it is possible to detect a definite, unbounded advantage of quantum systems over classical systems. We do this by constructing a family of operationally meaningful communication tasks each of which on one hand can be implemented by using just a single qubit but which on the other hand require unboundedly larger classical system for classical implementation. Furthemore, we show that even though with the additional resource of shared randomness the proposed communication tasks can be implemented by both quantum and classical systems of the same size, the number of coordinated actions needed for the classical implementation also grows unboundedly. In particular, no finite storage can be used to store all the coordinated actions needed to implement all the possible quantum communication tasks with classical systems. As a consequence, shared randomness cannot be viewed as a free resource.

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. Complexity of Contextuality

    quant-ph 2025-06 conditional novelty 7.0 of 10

    Deciding whether a COPE matrix has a noncontextual ontological model of dimension k is shown to lie between (nm)^Ω(r) and poly(b,m,n)^O(k^2), and a 5x5 example separates the minimal noncontextual ontic size (5) from t...

Pith tools