Bounding the classical cost of simulating quantum behaviors in the prepare-and-measure scenario

Abstract

We study the prepare-and-measure scenario in which Alice transmits a quantum system to Bob, who then performs a quantum measurement. The quantum state of the system is unknown to Bob, and the measurement is unknown to Alice. It has recently been shown that shared randomness and two bits of classical communication are necessary and sufficient to simulate the transmission of a qubit. We show that the communication cost can be reduced to an average of $1.89$ bits. We then study restricted sets of state preparations: First, for a restriction to real-valued qubit states, if the communication of a classical trit is sufficient, we show that the corresponding protocol must have a convoluted form. We then reduce the smallest qubit scenario requiring two bits of classical communication to only $6$ state preparations and $5$ measurements. For a qutrit, it is not known whether the communication cost is finite; we identify a scenario that requires at least $5$ classical messages, already for the simulation of the real qutrit. Finally, we develop a method for restricted sets of states, that allows us to lower bound the classical communication cost based solely on the set of quantum states.

Figures (4)

• Figure 1: The quantum prepare-and-measure scenario where Alice receives an input $x$, prepares a $d_Q$-dimensional quantum state $\rho$ and transmits it to Bob. Bob receives an input $y$ and performs a quantum measurement which produces an outcome $b$.
• Figure 2: The classical prepare-and-measure scenario where Alice and Bob share classical correlations $\lambda$. Alice receives an input $x$, prepares a classical message from an alphabet of length $d_C$ and transmits it to Bob. Bob receives an input $y$ and provides an outcome $b$.
• Figure 3: Average communication cost for different encoding strategies at a given angle $\alpha= \measuredangle(\vec{\lambda}_{1},\vec{\lambda}_{2})\in[0,\pi]$. The $\alpha$-asymptotic encoding yields a lower bound, given by the entropy $H(\alpha)$, see Eq. \ref{['eq:Halpha']}. For single-shot encoding, the average communication cost of $5$ different strategies ($\mathrm A^\pm$, $\mathrm B^{\pm}$, $\mathrm C$) is shown, where encoding $C$ is the original encoding. Choosing the encoding with the lowest cost at each $\alpha$ yields our piecewise single-shot encoding with average communication cost of $\bar{\mathcal{C}}\approx \unit[1.89]{bits}$.
• Figure 4: A deterministic assignment $D_A(c\vert x,\lambda)$ for pure states of the real qubit with $d_C=3$ and (a) $N(\lambda) = 3$ sections and (b) $N(\lambda) = 7$ sections.

Theorems & Definitions (3)

• Lemma 1
• proof : Proof of Result \ref{['res:state_discrimination']}
• Lemma 2