The Inverted 3-Sum Box: General Formulation and Quantum Information Theoretic Optimality

The $N$-sum box protocol specifies a class of $\mathbb{F}d$ linear functions $f(W1,\cdots,WK)=V1W1+V2W2+\cdots+VKWK\in\mathbb{F}d^{m\times 1}$ that can be computed at information theoretically optimal communication cost (minimum number of qudits $\Delta1,\cdots,\DeltaK$ sent by the transmitters Alice$1$, Alice$2$,$\cdots$, Alice$K$, respectively, to the receiver, Bob, per computation instance) over a noise-free quantum multiple access channel (QMAC), when the input data streams $Wk\in\mathbb{F}d^{mk\times 1}, k\in[K]$, originate at the distributed transmitters, who share quantum entanglement in advance but are not otherwise allowed to communicate with each other. In prior work this set of optimally computable functions is identified in terms of a strong self-orthogonality (SSO) condition on the transfer function of the $N$-sum box. In this work we consider an `inverted' scenario, where instead of a feasible $N$-sum box transfer function, we are given an arbitrary $\mathbb{F}d$ linear function, i.e., arbitrary matrices $Vk\in\mathbb{F}d^{m\times mk}$ are specified, and the goal is to characterize the set of all feasible communication cost tuples $(\Delta1,\cdots,\DeltaK)$, not just based on $N$-sum box protocols, but across all possible quantum coding schemes. As our main result, we fully solve this problem for $K=3$ transmitters ($K\geq 4$ settings remain open). Coding schemes based on the $N$-sum box protocol (along with elementary ideas such as treating qudits as classical dits, time-sharing and batch-processing) are shown to be information theoretically optimal in all cases. As an example, in the symmetric case where rk$(V1)$=rk$(V2)$=rk$(V3) \triangleq r1$, rk$([V1, V2])$=rk$([V2, V3])$=rk$([V3, V1])\triangleq r2$, and rk$([V1, V2, V3])\triangleq r3$ (rk = rank), the minimum total-download cost is $\max {1.5r1 + 0.75(r3 - r2), r_3}$.