Pith. sign in

REVIEW 1 cited by

Communication of partial ignorance with qubits

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 1903.04899 v2 pith:OJY3L7LJ submitted 2019-03-12 quant-ph

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

We introduce a class of communication tests where the task is to communicate partial ignorance by means of a physical system. We present a full characterization of the implementations of these tests in the qubit case and partial results for qudits. A peculiar observation is that two physical systems with the same operational dimensions may differ with respect to implementations of these tasks, as is shown to be the case for the qubit and rebit. Finally, we consider the natural question whether some of the communication tests are more difficult than others. A new preordering that we call the ultraweak matrix majorization is presented to answer this question in a theory-independent way.

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. A lower bound on the classical simulation cost of star-network correlations

    quant-ph 2026-08 accept novelty 6.0 of 10

    A star-network exclusion game is won perfectly with quantum d-level messages, but classically needs a message of at least n^{d-1} symbols, so no fixed-size classical qubit description can simulate joint measurements o...

Pith tools