Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

Simple and general bounds on quantum random access codes

Farkas, Máté ; Miklin, Nikolai and Tavakoli, Armin LU (2025) In Quantum 9.
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.

Please use this url to cite or link to this publication:
author
; and
organization
publishing date
type
Contribution to journal
publication status
published
subject
in
Quantum
volume
9
publisher
Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften
external identifiers
  • scopus:86000079229
ISSN
2521-327X
DOI
10.22331/q-2025-02-25-1643
language
English
LU publication?
yes
additional info
Publisher Copyright: © 2025 Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften. All rights reserved.
id
94f6ffd3-45ba-4007-9ca2-faf666dc5cb0
date added to LUP
2025-06-24 14:26:47
date last changed
2025-06-24 14:27:29
@article{94f6ffd3-45ba-4007-9ca2-faf666dc5cb0,
  abstract     = {{<p>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.</p>}},
  author       = {{Farkas, Máté and Miklin, Nikolai and Tavakoli, Armin}},
  issn         = {{2521-327X}},
  language     = {{eng}},
  publisher    = {{Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften}},
  series       = {{Quantum}},
  title        = {{Simple and general bounds on quantum random access codes}},
  url          = {{http://dx.doi.org/10.22331/q-2025-02-25-1643}},
  doi          = {{10.22331/q-2025-02-25-1643}},
  volume       = {{9}},
  year         = {{2025}},
}