Simple and general bounds on quantum random access codes

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 acce...

Full description

Saved in:
Bibliographic Details
Published inQuantum (Vienna, Austria) Vol. 9; p. 1643
Main Authors Farkas, Máté, Miklin, Nikolai, Tavakoli, Armin
Format Journal Article
LanguageEnglish
Published Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften 25.02.2025
Subjects
Discrete Mathematics
Diskret matematik
Matematik
Mathematical Sciences
Natural Sciences
Naturvetenskap
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2521-327X
2521-327X
DOI:10.22331/q-2025-02-25-1643