Quantum advantages in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mrow> <mml:mtext>(n,d)</mml:mtext> <mml:mstyle/> <mml:mo>↦</mml:mo> <mml:mstyle/> <mml:mn>1</mml:mn> </mml:mrow> </mml:mrow> </mml:math> random access cod

Abstract A random access code (RAC), corresponding to a communication primitive with various applications in quantum information theory, is an instance of a preparation-and-measurement scenario. In this work, we consider ( n , d )-RACs constituting an n -length string, constructed from a d size set of letters, and send an encoding of the string in a single d -level physical system and present their quantum advantages. We first characterize optimal classical RACs and prove that a known classical strategy, called majority-encoding-identity-decoding , is optimal. We then construct a quantum protocol by exploiting only two incompatible measurements (the minimal requirement) and show the advantages beyond the classical one. We also discuss the generality of our results and whether quantum advantages are valid for all types of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" overflow="scroll"> <mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mi>n</mml:mi> <mml:mo>,</mml:mo> <mml:mi>d</mml:mi> <mml:mo stretchy="false">)</mml:mo> <mml:mstyle scriptlevel="0"/> <mml:mo stretchy="false">↦</mml:mo> <mml:mstyle scriptlevel="0"/> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> RACs.