Explicit optimal classical random access codes are constructed for general L and k, attaining upper bounds for k=L-1 and inducing quantum codes that reach a conjectured bound.
Analytical construction of (n, n 1) quan- tum random access codes saturating the conjectured bound
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Random Access Codes: Explicit Constructions, Optimality, and Classical-Quantum Gaps
Explicit optimal classical random access codes are constructed for general L and k, attaining upper bounds for k=L-1 and inducing quantum codes that reach a conjectured bound.