Farkas, MátéMátéFarkasNikolai MiklinTavakoli, ArminArminTavakoli2025-03-032025-03-032025-02-25Quantum 9: 1643 (2025)https://hdl.handle.net/11420/54515Random 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 in-dependent variables, each selected from a d-imensional 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.en2521-327X2025Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaftenhttps://creativecommons.org/licenses/by/4.0/Computer Science, Information and General Works::004: Computer SciencesNatural Sciences and Mathematics::530: PhysicsComputer Science, Information and General Works::003: Systems TheoryTechnology::621: Applied Physics::621.3: Electrical Engineering, Electronic EngineeringJournal Articlehttps://doi.org/10.15480/882.1484210.22331/q-2025-02-25-164310.15480/882.148422312.14142v310.15480/882.13826Journal Article