A monogamy-of-entanglement game for subspace coset states

Abstract

We establish a strong monogamy-of-entanglement property for subspace coset states, which are uniform superpositions of vectors in a linear subspace of ${\mathbb{F}}_2^n$ to which has been applied a quantum one-time pad. This property was conjectured recently by [Coladangelo, Liu, Liu, and Zhandry, Crypto'21] and shown to have applications to unclonable decryption and copy-protection of pseudorandom functions. We present two proofs, one which directly follows the method of the original paper and the other which uses an observation from [Vidick and Zhang, Eurocrypt'20] to reduce the analysis to a simpler monogamy game based on BB'84 states. Both proofs ultimately rely on the same proof technique, introduced in [Tomamichel, Fehr, Kaniewski and Wehner, New Journal of Physics '13].

v5: 13 pages, 1 figure. Accepted for publication in Quantum

References in corpus (1)

• Robust encoding of a qubit in a molecule

Cited by in corpus (4)

• Device independent security of quantum key distribution from monogamy-of-entanglement games
• Uncloneable Encryption from Decoupling
• Noise-tolerant public-key quantum money from a classical oracle
• A Game-Theoretic Quantum Algorithm for Solving Magic Squares