A monogamy-of-entanglement game for subspace coset states

Quantum entanglement allows for correlations between two non-communicating systems that are classically impossible, a property that may be quantified using Bell inequalities or nonlocal games. The situation gets more involved when there are more parties. For example, correlations as strong as maximal entanglement are not possible between three quantum systems. This is a particular case of monogamy-of-entanglement — limitations on the strength of quantum multipartite correlations. One way to quantify this property is via monogamy-of-entanglement (MoE) games. An MoE game is played cooperatively by two players Bob and Charlie, who each hold a quantum system but do not communicate, against a referee Alice, who has fixed actions. The players win if they can both simultaneously guess the result of Alice’s measurement, chosen at random from a predetermined set of possible measurements, on a state they have prepared, each using their own local quantum system. Monogamy-of-entanglement appears in the fact that the maximal winning probability may be low while, using a maximally entangled state, either one of the players could have guessed the result with certainty.

In this work, we study the winning probability of an MoE game called the strong monogamy game. In this game, Alice measures her $n$-qubit system in a basis of subspace coset states, which is a basis that arises from a linear subspace of the finite vector space of $n$ bits. An important property of this basis is that it is naturally indexed by two indices, one corresponding to a coset of the subspace and the other to a coset of its orthogonal complement. To win the game, Bob is only required to guess the first index correctly and Charlie is only required to guess the second. Nevertheless, we show that the optimal winning probability is exponentially small in the number of qubits. The bound also holds for a version of the game where Alice sends subspace coset states rather than measuring in a basis; this version has applications to uncloneable quantum cryptography, where the no-cloning property of quantum states, closely related to MoE, is exploited to achieve classically impossible security.

[1] Anne Broadbent and Eric Culf, “Rigidity for Monogamy-of-Entanglement Games”, arXiv:2111.08081.

[2] Andrea Coladangelo, Jiahui Liu, Qipeng Liu, and Mark Zhandry, “Hidden Cosets and Applications to Unclonable Cryptography”, arXiv:2107.05692.

[3] Prabhanjan Ananth, Fatih Kaleoglu, Xingjian Li, Qipeng Liu, and Mark Zhandry, “On the Feasibility of Unclonable Encryption, and More”, arXiv:2207.06589.

The above citations are from SAO/NASA ADS (last updated successfully 2022-09-01 14:26:51). The list may be incomplete as not all publishers provide suitable and complete citation data.

Could not fetch Crossref cited-by data during last attempt 2022-09-01 14:26:50: Could not fetch cited-by data for 10.22331/q-2022-09-01-791 from Crossref. This is normal if the DOI was registered recently.