Role of fine-grained uncertainty in determining the limit of preparation contextuality

Abstract

The optimal success probability of a communication game sets fundamental limitations on an operational theory. Quantum advantage of parity oblivious random access code (PORAC), a communication game, over classical resources reveals the preparation contextuality of quantum theory [Phys. Rev. Lett. 102, 010401 (2009)]. Optimal quantum advantage in the N-dit PORAC game for finite dimensions is an open problem. Here, we show that the degree of uncertainty allowed in an operational theory determines the amount of preparation contextuality. We connect the upper bound of fine-grained uncertainty relation to the success probability of PORAC game played with the quantum resource. Subsequently, we find the optimal success probability for the 2-dit PORAC game using MUBs for the decoding strategy. Finally, we also derive an upper bound on quantum advantage for the N-dit PORAC game.

Close to the published version

References in corpus (7)

• Steering, Entanglement, Nonlocality, and the EPR Paradox
• Quantum Steering
• Bloch vectors for qudits
• The uncertainty principle determines the non-locality of quantum mechanics
• Preparation contextuality powers parity-oblivious multiplexing
• Quantum Random Access Codes using Single $d$-level Systems
• Measurement incompatibility and steering are necessary and sufficient for operational contextuality

Cited by in corpus (3)

• Bloch sphere analog of qudits using Heisenberg-Weyl Operators
• Robust certification of quantum instruments through a sequential communication game
• Role of nonclassical temporal correlation in powering quantum random access codes