REVIEW 1 cited by
Generalized parity-oblivious communication games powered by quantum preparation contextuality
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
read the original abstract
The parity-oblivious random-access-code (PORAC) is a class of communication games involving a sender (Alice) and a receiver (Bob). In such games, Alice's amount of communication to Bob is constraint by the parity-oblivious (PO) conditions, so that the parity information of her inputs remains oblivious to Bob. The PO condition in an operational theory is equivalently represented in an ontological model that satisfies the preparation noncontextuality. In this paper, we provide a nontrivial generalization of the existing two-level PORAC and derive the winning probability of the game in the preparation noncontextual ontological model. We demonstrate that the quantum theory outperforms the preparation noncontextual model by predicting higher winning probability in our generalized PORAC.
Forward citations
Cited by 1 Pith paper
-
Unbounded entanglement-sustaining sequential local quantum state discrimination
The authors claim an LOCC protocol distinguishes any two orthogonal entangled two-qubit states sequentially with success >1/2 per round while preserving finite entanglement, but the general-case proof uses a false equality.
Discussion (0). Continue with ORCID to comment.