We consider a game in which two separate laboratories collaborate to prepare a quantum system and are then asked to guess the outcome of a measurement performed by a third party in a random basis on that system. Intuitively, by the uncertainty principle and the monogamy of entanglement, the probability that both players simultaneously succeed in guessing the outcome correctly is bounded. We are interested in the question of how the success probability scales when many such games are performed in parallel. We show that any strategy that maximizes the probability to win every game individually is also optimal for the parallel repetition of the game. Our result implies that the optimal guessing probability can be achieved without the use of entanglement. We explore several applications of this result. Firstly, we show that it implies security for standard BB84 quantum key distribution when the receiving party uses fully untrusted measurement devices, i.e. we show that BB84 is one-sided device independent. Secondly, we show how our result can be used to prove security of a one-round position-verification scheme. Finally, we generalize a well-known uncertainty relation for the guessing probability to quantum side information.
Quantum computation (msc 81P68), Cryptography (msc 94A60)
Other (theme 6)
T. Johansson , P.Q. Nguyen
New Journal of Physics
Quantum Cryptography
Annual International Conference on the Theory and Applications of Cryptographic Techniques

Tomamichel, M, Fehr, S, Kaniewski, J, & Wehner, S.D.C. (2013). A monogamy-of-entanglement game with applications to device-independent quantum cryptography . New Journal of Physics, 15. doi:10.1088/1367-2630/15/10/103002