Winning Rates of $(n,k)$ Quantum Coset Monogamy Games

Abstract

We formulate the $(n,k)$ Coset Monogamy Game, in which two players must extract complementary information of unequal size ($k$ bits vs. $n-k$ bits) from a random coset state without communicating. The complementary information takes the form of random Pauli-X and Pauli-Z errors on subspace states. Our game generalizes those considered in previous works that deal with the case of equal information size $(k=n/2)$. We prove a convex upper bound of the information-theoretic winning rate of the $(n,k)$ Coset Monogamy Game in terms of the subspace rate $R=\frac{k}{n}\in [0,1]$. This bound improves upon previous results for the case of $R=1/2$. We also prove the achievability of an optimal winning probability upper bound for the class of unentangled strategies of the $(n,k)$ Coset Monogamy Game.

Two Column Version - Accepted to 61st Allerton Conference on Communication, Control, and Computing