Recognition: unknown
Quantum Random Access Codes with Shared Randomness
read the original abstract
We consider a communication method, where the sender encodes n classical bits into 1 qubit and sends it to the receiver who performs a certain measurement depending on which of the initial bits must be recovered. This procedure is called (n,1,p) quantum random access code (QRAC) where p > 1/2 is its success probability. It is known that (2,1,0.85) and (3,1,0.79) QRACs (with no classical counterparts) exist and that (4,1,p) QRAC with p > 1/2 is not possible. We extend this model with shared randomness (SR) that is accessible to both parties. Then (n,1,p) QRAC with SR and p > 1/2 exists for any n > 0. We give an upper bound on its success probability (the known (2,1,0.85) and (3,1,0.79) QRACs match this upper bound). We discuss some particular constructions for several small values of n. We also study the classical counterpart of this model where n bits are encoded into 1 bit instead of 1 qubit and SR is used. We give an optimal construction for such codes and find their success probability exactly--it is less than in the quantum case. Interactive 3D quantum random access codes are available on-line at http://home.lanet.lv/~sd20008/racs .
This paper has not been read by Pith yet.
Forward citations
Cited by 4 Pith papers
-
Random Access Code protocols: Quantum advantage related to intraparticle entanglement-based contextuality
Quantum success probability in intraparticle entanglement-assisted n-bit random access codes corresponds directly to the degree of violation of a noncontextuality Bell-type inequality.
-
Exclusion reshapes the operational manifestation of preparation contextuality
Parity-oblivious random exclusion codes allow qubits to exceed tight noncontextual bounds for prime symbol sizes, unlike parity-oblivious retrieval, and enable semi-device-independent dimension certification.
-
Random Access Codes: Explicit Constructions, Optimality, and Classical-Quantum Gaps
Explicit optimal classical random access codes are constructed for general L and k, attaining upper bounds for k=L-1 and inducing quantum codes that reach a conjectured bound.
-
Semi-device-independent self-testing of unitary operations
A new semi-device-independent self-testing protocol certifies Alice's unitary operations and Bob's measurements via the optimal quantum advantage in a variant 3-bit PMRAC communication game.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.