 Quantum random access code

An encoding stores $n$ classical bits in $m$ qubits so that a receiver who later chooses a bit index can recover that bit with a specified success probability. The sender cannot tailor the encoding to the unknown requested index. This task permits approximate recovery of any one bit rather than simultaneous recovery of all bits, and must specify whether additional communication, shared randomness, or entanglement is allowed.