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.
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.
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.
Abstract The distribution of entanglement in a multiparty system can be described by the principle of monogamy. Monogamy is a fundamental characteristic of entanglement that restricts its distribution among more than two parties. In this work, our aim is to explore how quantum entanglement is distributed in accordance with monogamy relations, which utilize both genuine multipartite entanglement measures and bipartite entanglement measures. Specifically, we treat the source entanglement or the accessible entanglement as genuine multipartite entanglement measures and use the entanglement of formation for bipartite cases. For GHZ class states, we analytically demonstrate that the square of the source entanglement serves as an upper bound for the sum of the squares of the entanglement of formation of the reduced subsystems, with some exceptions in specific non-generic GHZ states. We will also present numerical evidence supporting this result for W-class states. In addition, we also explore the monogamy relationship by using accessible entanglement as an upper bound. Our analysis reveals an opposite but consistent pattern in the behavior of monogamy depending on whether source entanglement or accessible entanglement is used as the upper bound. This pattern emphasizes the dual nature of these two measures.
Entanglement is at the heart of quantum mechanics. The nonlocal correlations that can be obtained from space-time separated measurements on an entangled state are a central feature which provably distinguish it from local theories. This dissertation studies entanglement through a computational viewpoint. We develop new insights into the complex nature of entanglement by studying its role in multiplayer games, in which cooperating, but non-communicating, players interact with a referee in an attempt to win a pre-specified game. On the one hand, the nonlocal correlations that entanglement allows may enable players using it to develop new colluding strategies, defeating previously secure protocols. On the other, the richness of this new resource may also be exploited in order to design new protocols, providing solutions to problems previously deemed impossible. We explore both aspects of this dual nature of entanglement, putting limits on its strength while at the same time showing how it can be put to profit to solve new computational problems. A major unresolved question on the computational complexity of multiplayer entangled games is the power of MIP*, the class of languages having entangled multi-prover interactive proofs: how does it relate to its purely classical analogue MIP, which was completely characterized through the fundamental equation MIP=NEXP? Since the players may use entanglement to increase their odds at colluding against the verifier, MIP* could potentially be a much weaker class than MIP. Indeed, for a long time it has been an open question whether two entangled provers are more useful than a single prover. In this thesis we resolve this question by showing that the class of languages having multiprover interactive proofs with entangled provers is at least as large as its classical counterpart: NEXP is included in MIP*. At the heart of this result is an analysis of the multilinearity test of Babai, Fortnow, and Lund in the presence of entanglement. The fact that this test remains sound gives a systematic way for a verifier to impose strong limits on the ability of entangled provers to collude against the verifier.Gap amplification is a fundamental primitive in the study of classical multiplayer games. While sequential repetition of a game always decreases the prover's maximum success probability at an exponential rate, the fact that parallel repetition also achieves a gap amplification is a highly non-trivial fact. We show that gap amplification can be performed in parallel even in the presence of entanglement between the provers. We adapt a technique which was originally introduced by Feige and Kilian and results in a polynomial rate of amplification.The phenomenon of monogamy of entanglement states, in first approximation, that if two parties are maximally entangled then they cannot simultaneously be entangled with a third party. We use this phenomenon in two distinct results. In the first, we show that the bits generated in our randomness-expansion protocol are certifiably random even from the point of view of a quantum adversary who may share prior entanglement with the provers. In addition, we prove the security against quantum adversaries of a randomness-efficient extractor construction originally due to Trevisan. This lets us transform the high-entropy bits that are generated in our protocol into ones that are almost indistinguishable from uniform by any adversary. More generally, we show how the monogamy of entanglement can be exploited to design multi-prover interactive proof systems that are partially entanglement-resistant. Quantitative bounds on the monogamy of entanglement have generally been elusive, and the analysis of our protocol demonstrates such a bound in a new context. The nonlocal correlations that can be created by entangled players provide a statistical means of differentiating them from classical, unentangled players. This is the main idea behind Bell inequalities, the violation of which demonstrates the nonlocality of quantum mechanics. We show how this phenomenon may be exploited to design a protocol in which the bits produced by successful players necessarily contain a large quantity of fresh randomness. The presence of randomness is guaranteed irrespective of the provers' actual strategy, as long as the sole constraint of no signaling is respected. Hence a statistical certification for the presence of randomness, a feat easily seen to be impossible to achieve classically. In order to manipulate the random bits produced in our protocol, and make them useful in cryptography, we give the first proof of security of a poly-logarithmic seed extractor secure against quantum adversaries. To achieve this we adapt the reconstruction paradigm originally introduced by Trevisan to the quantum setting. We study other ways in which entanglement may be used in interactive proof systems by also allowing a quantum interaction between the referee and the players. We show that, using entanglement, the class of QMIP* proof systems can be parallelized to only three rounds of interaction, and made public-coin, a property that does not hold in the absence of entanglement between the provers.
Coordination is a fundamental primitive in communication and information theory, in which distributed systems must collectively generate correlated behavior rather than merely exchange messages. In quantum networks, the nature of entanglement, quantum measurements, and nonclassical correlations introduces coordination possibilities unavailable classically. This article reviews recent advances in coordination over classical and quantum communication networks, focusing on empirical and strong coordination in multi-user settings.
We consider the implications of coordination for nonlocal games, showing how it provides a natural framework for understanding the correlations that enable spatially separated players to improve their probability of winning. We present a unified framework for coordination using classical or quantum communication and pre-shared correlation resources. The review covers simulation of both entanglement and separable correlations across a variety of network architectures, including two-node, cascade, broadcast, and multiple-access networks. We study the operational differences between empirical and strong coordination, and the tradeoffs between communication and correlation resources, such as pre-shared randomness and entanglement.
Coordination plays a major role in device-independent quantum key distribution (DI-QKD) schemes, in which parties can generate a secret key even if the devices used in the process have been prepared by an adversary. Furthermore, we examine the role of coordination in quantum repeaters, where distributed entanglement serves as a resource for long-distance quantum communication. The review highlights connections between coordination theory and applications such as distributed quantum systems, quantum internet architectures, and future communication networks.
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.
Bell monogamy relations characterize the trade-offs in Bell inequality violations among pairs of players in multiplayer settings. In this work, we introduce a method for extending monogamy relations from a distinguished set of configurations to monogamy relations in all possible multiplayer settings. Applying this approach, we show that nonlocality in the Clauser, Horne, Shimony, and Holt game arises in only two cases: the original two-player scenario and the four-player scenario on a line. While the bound for this four-player scenario follows from known quadratic monogamy constraints, we also establish two six-party numerical monogamy relations that cannot be derived from existing results. In particular, we show there are points in the intersection of consecutive quadratic Bell monogamy relations which are not quantum realizable. Finally, we present a nonlocal game in which a single player can simultaneously saturate the quantum value with two other parties. This is an example of a nonlocal game unaffected by the monogamous nature of quantum entanglement.