Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2608.17201

One-at-a-Time Quantum Guessing: Multipartite Entanglement Beyond MoE Games

Michael Schleppy, Emina Soljanin

quant-phcs.ITSubmitted Aug 17, 2026• Announced Aug 19, 2026• 0 citations
arXivHTMLPDF

Abstract

Multipartite entanglement remains a challenging and not fully understood aspect of quantum information. Monogamy-of-Entanglement (MoE) games have been highly effective for studying limitations on the usefulness of entanglement imposed by monogamy constraints. To better reveal the extent to which multipartite entanglement can be useful, we introduce a class of quantum guessing games, termed One-at-a-Time Guessing (OTG) games. In these games, quantum players individually guess the outcomes of random measurements performed by a referee on a pre-shared entangled state. Unlike MoE games, OTG games select players individually at random according to a specified probability distribution, thereby probing each player's correlation with the referee. We show that, despite monogamy constraints, players sharing certain entangled states can moderately outperform those relying only on classical uncertainty. This advantage arises even in simple OTG games involving only Pauli measurements on qubits, where optimal entanglement increases the winning probability by at least 4%. This contrasts with MoE games, where shared entanglement has been shown in several settings to provide only limited (if any) advantage over classical strategies. We further establish a majorization property: the value of an OTG game respects the majorization ordering of the player-selection probability distribution. We also analyze in detail a two-player OTG game in which the referee measures one of the three Pauli observables on a qubit, and show that it is optimally played using a specific parameterized family of three-qubit $W$-like states. These results suggest that OTG games provide a useful framework for investigating the usefulness of multipartite entanglement in multiparty quantum correlations.

Comments
38 pages, 5 figures. Supplemental Code can be found at https://github.com/mas991/One-at-a-Time-Guessing-Games

Related papers

A monogamy-of-entanglement game with applications to device-independent quantum cryptography

Marco Tomamichel, Serge Fehr, Jędrzej Kaniewski +1 more

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.

arXiv:1210.4359•New Journal of Physics•Oct 2, 2013•169 citations

Rigidity for Monogamy-Of-Entanglement Games

Anne Broadbent, Eric Culf

In a monogamy-of-entanglement (MoE) game, two players who do not communicate try to simultaneously guess a referee's measurement outcome on a shared quantum state they prepared. We study the prototypical example of a game where the referee measures in either the computational or Hadamard basis and informs the players of her choice. We show that this game satisfies a rigidity property similar to what is known for some nonlocal games. That is, in order to win optimally, the players' strategy must be of a specific form, namely a convex combination of four unentangled optimal strategies generated by the Breidbart state. We extend this to show that strategies that win near-optimally must also be near an optimal state of this form. We also show rigidity for multiple copies of the game played in parallel. We give three applications: (1) We construct for the first time a weak string erasure (WSE) scheme where the security does not rely on limitations on the parties' hardware. Instead, we add a prover, which enables security via the rigidity of this MoE game. (2) We show that the WSE scheme can be used to achieve bit commitment in a model where it is impossible classically. (3) We achieve everlasting-secure randomness expansion in the model of trusted but leaky measurement and untrusted preparation and measurements by two isolated devices, while relying only on the temporary assumption of pseudorandom functions. This achieves randomness expansion without the need for shared entanglement.

arXiv:2111.08081•Leibniz international proceedings in informatics•Nov 15, 2021•8 citations

Quantum entanglement monogamy games: Repetition and dimension implications

Moran, Francis

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.

•Jan 1, 2025•0 citations

Extended non-local games and monogamy-of-entanglement games

Nathaniel Johnston, Rajat Mittal, Vincent Russo +1 more

We study a generalization of non-local games—which we call extended non-local games —in which the players, Alice and Bob, initially share a tripartite quantum state with the referee. In such games, the winning conditions for Alice and Bob may depend on the outcomes of measurements made by the referee, on its part of the shared quantum state, in addition to Alice and Bob's answers to randomly selected questions. Our study of this class of games was inspired by the monogamy-of-entanglement games introduced by Tomamichel, Fehr, Kaniewski and Wehner, which they also generalize. We prove that a natural extension of the Navascués–Pironio–Acín hierarchy of semidefinite programmes converges to the optimal commuting measurement value of extended non-local games, and we prove two extensions of results of Tomamichel et al. concerning monogamy-of-entanglement games.

arXiv:1510.02083•Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences•May 1, 2016•38 citations

Entanglement-assisted guessing of complementary measurement outcomes

Mario Berta, Patrick J. Coles, Stephanie Wehner

Heisenberg's uncertainty principle implies that if one party (Alice) prepares a system and randomly measures one of two incompatible observables, then another party (Bob) cannot perfectly predict the measurement outcomes. This implication assumes that Bob does not possess an additional system that is entangled to the measured one; indeed, the seminal paper of Einstein, Podolsky, and Rosen (EPR) showed that maximal entanglement allows Bob to perfectly win this guessing game. Although not in contradiction, the observations made by EPR and Heisenberg illustrate two extreme cases of the interplay between entanglement and uncertainty. On the one hand, no entanglement means that Bob's predictions must display some uncertainty. Yet on the other hand, maximal entanglement means that there is no more uncertainty at all. Here we follow an operational approach and give an exact relation---an equality---between the amount of uncertainty as measured by the guessing probability and the amount of entanglement as measured by the recoverable entanglement fidelity. From this equality, we deduce a simple criterion for witnessing bipartite entanglement and an entanglement monogamy equality.

arXiv:1302.5902•Physical Review A•Dec 22, 2014•75 citations

Multipartite entanglement in XOR games

Jop Briët, Harry Buhrman, Troy Lee +1 more

We study multipartite entanglement in the context of XOR games. In particular, we study the ratio of the entangled and classical biases, which measure the maximum advantage of a quantum or classical strategy over a uniformly random strategy. For the case of two-player XOR games, Tsirelson proved that this ratio is upper bounded by the celebrated Grothendieck constant. In contrast, Pérez-García et al. proved the existence of entangled states that give quantum players an unbounded advantage over classical players in a three-player XOR game. We show that the multipartite entangled states that are most often seen in today's literature can only lead to a bias that is a constant factor larger than the classical bias. These states include GHZ states, any state local-unitarily equivalent to combinations of GHZ and maximally entangled states shared between different subsets of the players (e.g., stabilizer states), as well as generalizations of GHZ states of the form Σiαi|i〉... |i〉 for arbitrary amplitudes αi. Our results have the following surprising consequence: classical three-player XOR games do not follow an XOR parallel repetition theorem, even a very weak one. Besides this, we discuss implications of our results for communication complexity and hardness of approximation. Our proofs are based on novel applications of extensions of Grothendieck's inequality, due to Blei and Tonge, and Carne, generalizing Tsirelson's use of Grothendieck's inequality to bound the bias of two-player XOR games.

Quantum Information Processing•Mar 1, 2013•1 citation
Multipartite entanglement remains a challenging and not fully understood aspect of quantum information. Monogamy-of-Entanglement (MoE) games have been highly effective for studying limitations on the usefulness of entanglement imposed by monogamy constraints. To better reveal the extent to which multipartite entanglement can be useful, we introduce a class of quantum guessing games, termed One-at-a-Time Guessing (OTG) games. In these games, quantum players individually guess the outcomes of random measurements performed by a referee on a pre-shared entangled state. Unlike MoE games, OTG games select players individually at random according to a specified probability distribution, thereby probing each player's correlation with the referee. We show that, despite monogamy constraints, players sharing certain entangled states can moderately outperform those relying only on classical uncertainty. This advantage arises even in simple OTG games involving only Pauli measurements on qubits, where optimal entanglement increases the winning probability by at least 4%. This contrasts with MoE games, where shared entanglement has been shown in several settings to provide only limited (if any) advantage over classical strategies. We further establish a majorization property: the value of an OTG game respects the majorization ordering of the player-selection probability distribution. We also analyze in detail a two-player OTG game in which the referee measures one of the three Pauli observables on a qubit, and show that it is optimally played using a specific parameterized family of three-qubit WWW-like states. These results suggest that OTG games provide a useful framework for investigating the usefulness of multipartite entanglement in multiparty quantum correlations.
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.
In a monogamy-of-entanglement (MoE) game, two players who do not communicate try to simultaneously guess a referee's measurement outcome on a shared quantum state they prepared. We study the prototypical example of a game where the referee measures in either the computational or Hadamard basis and informs the players of her choice. We show that this game satisfies a rigidity property similar to what is known for some nonlocal games. That is, in order to win optimally, the players' strategy must be of a specific form, namely a convex combination of four unentangled optimal strategies generated by the Breidbart state. We extend this to show that strategies that win near-optimally must also be near an optimal state of this form. We also show rigidity for multiple copies of the game played in parallel. We give three applications: (1) We construct for the first time a weak string erasure (WSE) scheme where the security does not rely on limitations on the parties' hardware. Instead, we add a prover, which enables security via the rigidity of this MoE game. (2) We show that the WSE scheme can be used to achieve bit commitment in a model where it is impossible classically. (3) We achieve everlasting-secure randomness expansion in the model of trusted but leaky measurement and untrusted preparation and measurements by two isolated devices, while relying only on the temporary assumption of pseudorandom functions. This achieves randomness expansion without the need for shared entanglement.
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 a generalization of non-local games—which we call extended non-local games —in which the players, Alice and Bob, initially share a tripartite quantum state with the referee. In such games, the winning conditions for Alice and Bob may depend on the outcomes of measurements made by the referee, on its part of the shared quantum state, in addition to Alice and Bob's answers to randomly selected questions. Our study of this class of games was inspired by the monogamy-of-entanglement games introduced by Tomamichel, Fehr, Kaniewski and Wehner, which they also generalize. We prove that a natural extension of the Navascués–Pironio–Acín hierarchy of semidefinite programmes converges to the optimal commuting measurement value of extended non-local games, and we prove two extensions of results of Tomamichel et al. concerning monogamy-of-entanglement games.
Heisenberg's uncertainty principle implies that if one party (Alice) prepares a system and randomly measures one of two incompatible observables, then another party (Bob) cannot perfectly predict the measurement outcomes. This implication assumes that Bob does not possess an additional system that is entangled to the measured one; indeed, the seminal paper of Einstein, Podolsky, and Rosen (EPR) showed that maximal entanglement allows Bob to perfectly win this guessing game. Although not in contradiction, the observations made by EPR and Heisenberg illustrate two extreme cases of the interplay between entanglement and uncertainty. On the one hand, no entanglement means that Bob's predictions must display some uncertainty. Yet on the other hand, maximal entanglement means that there is no more uncertainty at all. Here we follow an operational approach and give an exact relation---an equality---between the amount of uncertainty as measured by the guessing probability and the amount of entanglement as measured by the recoverable entanglement fidelity. From this equality, we deduce a simple criterion for witnessing bipartite entanglement and an entanglement monogamy equality.
We study multipartite entanglement in the context of XOR games. In particular, we study the ratio of the entangled and classical biases, which measure the maximum advantage of a quantum or classical strategy over a uniformly random strategy. For the case of two-player XOR games, Tsirelson proved that this ratio is upper bounded by the celebrated Grothendieck constant. In contrast, Pérez-García et al. proved the existence of entangled states that give quantum players an unbounded advantage over classical players in a three-player XOR game. We show that the multipartite entangled states that are most often seen in today's literature can only lead to a bias that is a constant factor larger than the classical bias. These states include GHZ states, any state local-unitarily equivalent to combinations of GHZ and maximally entangled states shared between different subsets of the players (e.g., stabilizer states), as well as generalizations of GHZ states of the form Σiαi|i〉... |i〉 for arbitrary amplitudes αi. Our results have the following surprising consequence: classical three-player XOR games do not follow an XOR parallel repetition theorem, even a very weak one. Besides this, we discuss implications of our results for communication complexity and hardness of approximation. Our proofs are based on novel applications of extensions of Grothendieck's inequality, due to Blei and Tonge, and Carne, generalizing Tsirelson's use of Grothendieck's inequality to bound the bias of two-player XOR games.