Options
Simple and general bounds on quantum random access codes
Citation Link: https://doi.org/10.15480/882.14842
Publikationstyp
Journal Article
Date Issued
2025-02-25
Sprache
English
TORE-DOI
Volume
9
Article Number
1643
Citation
Quantum 9: 1643 (2025)
Publisher DOI
ArXiv ID
Publisher
Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften
Peer Reviewed
true
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 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.
DDC Class
004: Computer Sciences
530: Physics
003: Systems Theory
621.3: Electrical Engineering, Electronic Engineering
Funding(s)
project number 44142309
Funding Organisations
More Funding Information
part of the endowed professorship “Quantum Inspired and Quantum Optimization”
Publication version
acceptedVersion
Loading...
Name
q-2025-02-25-1643.pdf
Size
589.5 KB
Format
Adobe PDF