Strong supremacy of quantum systems as communication resource

TL;DR

This paper demonstrates that quantum systems can outperform classical systems in $d$-level random access codes by achieving higher success probabilities, even when the quantum system's dimension is less than the classical message size.

Contribution

It introduces a quantum protocol that surpasses classical success probabilities in $d$-RACs, showing a stronger quantum advantage than previously known.

Findings

Quantum protocols outperform classical in success probability.

Quantum advantage persists even with lower-dimensional quantum systems.

Contrasts with known limitations from Holevo's theorem.

Abstract

We investigate the task of $d$-level random access codes ($d$-RACs) and consider the possibility of encoding classical strings of $d$-level symbols (dits) into a quantum system of dimension $d'$ strictly less than $d$. We show that the average success probability of recovering one (randomly chosen) dit from the encoded string can be larger than that obtained in the best classical protocol for the task. Our result is intriguing as we know from Holevo's theorem (and more recently from Frenkel-Weiner's result [Commun. Math. Phys. 340, 563 (2015)]) that there exist communication scenarios wherein quantum resources prove to be of no advantage over classical resources. A distinguishing feature of our protocol is that it establishes a stronger quantum advantage in contrast to the existing quantum $d$-RACs where $d$-level quantum systems are shown to be advantageous over their classical $d$-level counterparts.