We analyse two party non-local games whose predicate requires Alice and Bob to generate matching bits, and their three party extensions where a third player receives all inputs and is required to output a bit that matches that of the original players. We propose a general device independent quantum key distribution protocol for the subset of such non-local games that satisfy a monogamy-of-entanglement property characterised by a gap in the maximum winning probability between the bipartite and tripartite versions of the game. This gap is due to the optimal strategy for two players requiring entanglement, which due to its monogamy property cannot be shared with any additional players. Based solely on the monogamy-of-entanglement property, we provide a simple proof of information theoretic security of our protocol. Lastly, we numerically optimize the finite and asymptotic secret key rates of our protocol using the magic square game as an example, for which we provide a numerical bound on the maximal tripartite quantum winning probability which closely matches the bipartite classical winning probability. Further, we show that our protocol is robust for depolarizing noise up to about 2.88 % , providing the first such bound for general attacks for magic square based quantum key distribution.
We analyse two party non-local games whose predicate requires Alice and Bob to generate matching bits, and their three party extensions where a third player receives all inputs and is required to output a bit that matches that of the original players. We propose a general device independent quantum key distribution protocol for the subset of such non-local games that satisfy a monogamy-of-entanglement property characterised by a gap in the maximum winning probability between the bipartite and tripartite versions of the game. This gap is due to the optimal strategy for two players requiring entanglement, which due to its monogamy property cannot be shared with any additional players. Based solely on the monogamy-of-entanglement property, we provide a simple proof of information theoretic security of our protocol. Lastly, we numerically optimize the finite and asymptotic secret key rates of our protocol using the magic square game as an example, for which we provide a numerical bound on the maximal tripartite quantum winning probability which closely matches the bipartite classical winning probability. Further, we show that our protocol is robust for depolarizing noise up to about 2.88 % , providing the first such bound for general attacks for magic square based quantum key distribution.
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.
Device-independent conference key agreement (DI-CKA) lets a group of parties establish a shared secret key from untrusted quantum devices, with security certified by non-locality. Existing DI-CKA protocols are each built around a single Bell inequality, typically a multiparty variant of the CHSH game. DI-QKD protocols, in contrast, have been built from a much richer landscape of non-local games, and it has remained unclear how to carry this landscape over to the conference setting. We introduce $\textit{Parity-$G$ games}$, which extend any two-player game G to N players, for every N, provided G has an optimal strategy in which one player measures Pauli observables. The extension preserves the quantum and classical values of G, and the security of the resulting N-party protocol follows from an analysis of the two-player game alone. Our framework recovers the Parity-CHSH game of Ribeiro, Murta and Wehner (Phys. Rev. A, 2018) as a special case. Applied to the Mermin--Peres Magic Square Game, it yields a new N-player pseudo-telepathy game, the Parity Magic Square Game, which ideal devices win in every round. We use it to construct the first DI-CKA protocol based on a pseudo-telepathy game. We prove the protocol secure against coherent attacks. It produces up to two key bits per round, and at low noise its key rate exceeds that of the DI-CKA protocol based on the Parity-CHSH game.
Device-independent quantum key distribution (DIQKD) is information-theoretically secure against adversaries who possess a scalable quantum computer and who have supplied malicious key-establishment systems; however, the DIQKD key rate is currently too low. Consequently, we devise a DIQKD scheme based on the quantum nonlocal Mermin-Peres magic square game: our scheme asymptotically delivers DIQKD against collective attacks, even with noise. Our scheme outperforms DIQKD using the Clauser-Horne-Shimony-Holt game with respect to the number of game rounds, albeit not number of entangled pairs, provided that both state visibility and detection efficiency are high enough.
ABSTRACT Quantum key distribution (QKD) is based on the laws of quantum mechanics to enable provably secure communication. Despite its theoretical security promise, practical QKD systems are vulnerable to serious attacks, including side‐channel attacks and detector loopholes, and assumes a trusted device characterisation. Device‐independent quantum key distribution (DIQKD) overcomes these limitations by relying solely on observed nonlocal correlations, certified through Bell inequality violations, thereby removing assumptions about the internal workings of the measurement devices. In this paper, we first review the foundational principles underlying DIQKD, including Bell tests and security definitions. We then examine a range of protocol designs, including CHSH‐based schemes, and non‐local game frameworks, alongside with their security proofs. We also assess recent experimental implementations and discuss source architectures, detection technologies and finite‐key analyses. Finally, we identify current open problems, such as noise tolerance, generation rates and integration with quantum networks and outline promising directions for future research to realize robust high‐performance DIQKD.
We study monogamy of entanglement, a fundamental constraint on how entanglement can be distributed across multipartite systems, through the framework of extended nonlocal quantum games. We analyze and compare three classes of strategies and their success probabilities: classical, quantum, and non-signaling. Our results demonstrate how the values of these strategies change in higher-dimensional games as well as with multiple repetitions. In particular, we demonstrate that the ratio between the non-signaling and quantum value can be made arbitrarily large with sufficient game repetitions. These games are subsequently incorporated into one-sided device-independent quantum key distribution protocols, with specific parameters such as key rate clearly defined. Finally, a simulation of a monogamy of entanglement game using IBM's Quantum Information Software Kit demonstrates monogamy of entanglement on real quantum hardware.
Quantum cryptography uses quantum mechanics to guarantee secure communication. BB84 is a widely used quantum key distribution that provides a way for two parties, a sender, Alice, and a receiver, Bob, to share an unconditionally secure key in the presence of an eavesdropper, Eve. Three different criteria can be assumed to study the BB84 protocol. They are the efficiency of the protocol, the probability that Eve remains undetected, and the amount of knowledge Eve has about Alice's bit sequence. In a previous approach, we only considered the probability that Eve remains undetected. We viewed this protocol as a three player static game in which Alice and Bob were two cooperative players and Eve was a competitive one. In our game model, Alice's and Bob's objective was to maximize the probability of detecting Eve, while Eve's objective was to minimize this probability. In this paper, our previous effort is extended and we also consider the other two criteria, i.e. the efficiency of the protocol and the amount of knowledge Eve has about Alice's bit sequence. Using these models, we show how game theory can be used to find the strategies for Alice, Bob and Eve.