Nonsignaling quantum random access-code boxes

Authors:

• Andrzej Tomasz Grudka,
• Michał Horodecki,
• Ryszard Horodecki,
• Antoni Wójcik

Abstract

A well-known cryptographic primitive is the so-called random access code. Namely, Alice is to send to Bob one of two bits, so that Bob has the choice of which bit he wants to learn about. However, at any time, Alice should not learn Bob's choice, and Bob should learn only the bit of his choice. The task is impossible to accomplish by means of either classical or quantum communication. On the other hand, a concept of correlations stronger than quantum ones, exhibited by the so-called Popescu-Rohrlich box, was introduced and widely studied. In particular, it is known that the Popescu-Rohrlich box enables simulation of the random access code with the support of one bit of communication. Here, we propose a quantum analog of this phenomenon. Namely, we define an analog of a random access code, where instead of classical bits, one encodes qubits. We provide a quantum nonsignaling box that if supported with two classical bits, allows one to simulate a quantum version of a random access code. We point out that two bits are necessary. We also show that a quantum random access code cannot be fully quantum: when Bob inputs the superposition of two choices, the output will be in a mixed state rather than in a superposition of required states.