Simple and general bounds on quantum random access codes

Abstract

Random access codes are a type of communication task that is widely used in quantum information science. The optimal average success probability that can be achieved through classical strategies is known for any random access code. However, only a few cases are solved exactly for quantum random access codes. In this paper, we provide bounds for the fully general setting of n independent variables, each selected from a d-dimensional classical alphabet and encoded in a D-dimensional quantum system subject to an arbitrary quantum measurement. The bound recovers the exactly known special cases, and we demonstrate numerically that even though the bound is not tight overall, it can still yield a good approximation.

Version accepted for publication

References in corpus (12)

• Semi-device-independent security of one-way quantum key distribution
• Preparation contextuality powers parity-oblivious multiplexing
• Dimension witnesses and quantum state discrimination
• Quantum Random Access Codes using Single $d$-level Systems
• (4,1)-Quantum Random Access Coding Does Not Exist
• Semidefinite programming relaxations for quantum correlations
• Correlations in entanglement-assisted prepare-and-measure scenarios
• Measurement incompatibility and quantum advantage in communication
• Almost qudits in the prepare-and-measure scenario
• Quantum Random Access Codes for Boolean Functions
• Widening the sharpness modulation region of an entanglement-assisted sequential quantum random access code: Theory, experiment, and application
• Quantum Random Access Code in Noisy Channels

Cited by in corpus (4)

• Quantum stochastic communication via high-dimensional entanglement
• Translating Bell Non-Locality to Prepare-and-Measure Scenarios under Dimensional Constraints
• Random Exclusion Codes: Quantum Advantages of Single-Shot Communication
• Quantum inputs in the prepare-and-measure scenario and stochastic teleportation