Monogamy of Nonlocal Games

• URL: http://arxiv.org/abs/2405.20286v3
• Date: Wed, 19 Feb 2025 00:37:36 GMT
• Title: Monogamy of Nonlocal Games
• Authors: David Cui, Arthur Mehta, Denis Rochette,
• Abstract summary: We show that nonlocality in the CHSH game arises in only two cases: the original two-player scenario and the four-player scenario on a line.<n>This is the first known example of a nonlocal game unaffected by the monogamous nature of quantum entanglement.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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 on all possible multiplayer settings. Applying this approach, we show that nonlocality in the CHSH 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 new 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 the first known example of a nonlocal game unaffected by the monogamous nature of quantum entanglement.

Related papers

• A bound on the quantum value of all compiled nonlocal games [49.32403970784162]
  A cryptographic compiler converts any nonlocal game into an interactive protocol with a single computationally bounded prover. We establish a quantum soundness result for all compiled two-player nonlocal games.
  arXiv  Detail & Related papers  (2024-08-13T08:11:56Z)
• Imperfect-Recall Games: Equilibrium Concepts and Their Complexity [74.01381499760288]
  We investigate optimal decision making under imperfect recall, that is, when an agent forgets information it once held before. In the framework of extensive-form games with imperfect recall, we analyze the computational complexities of finding equilibria in multiplayer settings.
  arXiv  Detail & Related papers  (2024-06-23T00:27:28Z)
• Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms [71.73971094342349]
  Self-play via online learning is one of the premier ways to solve large-scale two-player zero-sum games. We show that OMWU offers several advantages including logarithmic dependence on the size of the payoff matrix. We prove that a broad class of algorithms that do not forget the past quickly all suffer the same issue.
  arXiv  Detail & Related papers  (2024-06-15T13:26:17Z)
• Communication Complexity of Graph Isomorphism, Coloring, and Distance Games [0.0]
  We show that perfect non-signalling strategies collapse communication complexity under favorable conditions. Surprisingly, we observe that non-signalling strategies provide a finer distinction for the new game compared to classical and quantum strategies.
  arXiv  Detail & Related papers  (2024-06-04T10:53:16Z)
• Verification of Bell Nonlocality by Violating Quantum Monogamy Relations [2.062195473318468]
  Existing quantum monogamy relations rule out the possibility of simultaneous violations of any Bell inequalities. We demonstrate that violating these monogamy relations can dynamically witness simultaneous Bell nonlocalities of partial systems. We conduct a tripartite experiment to verify quantum nonlocalities by violating a tripartite monogamy relation using a maximally entangled two-photon state.
  arXiv  Detail & Related papers  (2024-03-14T08:26:32Z)
• Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence Beyond the Minty Property [89.96815099996132]
  We develop a new framework to characterize optimistic policy gradient methods in multi-player games with a single controller. Our approach relies on a natural generalization of the classical Minty property that we introduce, which we anticipate to have further applications beyond Markov games.
  arXiv  Detail & Related papers  (2023-12-19T11:34:10Z)
• Unmasking the Polygamous Nature of Quantum Nonlocality [0.4523163728236145]
  Quantum mechanics imposes limits on the statistics of certain observables. In the simplest case of three observers, it has been shown that if two observers violate a Bell inequality then none of them can violate any Bell inequality with the third observer. Here we show that the Bell monogamy does not hold universally and that in fact the only monogamous situation exists for only three observers.
  arXiv  Detail & Related papers  (2023-12-07T15:44:24Z)
• Device independent security of quantum key distribution from monogamy-of-entanglement games [8.97780713904412]
  We propose a general device independent quantum key distribution protocol for non-local games. We numerically optimize the finite and tripartite secret key rates of our protocol. We show that our protocol is robust for depolarizing noise up to about $2.2%$, providing the first such bound for general attacks for magic square based quantum key distribution.
  arXiv  Detail & Related papers  (2023-12-07T06:48:38Z)
• Photonic implementation of the quantum Morra game [69.65384453064829]
  We study a faithful translation of a two-player quantum Morra game, which builds on previous work by including the classical game as a special case. We propose a natural deformation of the game in the quantum regime in which Alice has a winning advantage, breaking the balance of the classical game. We discuss potential applications of the quantum Morra game to the study of quantum information and communication.
  arXiv  Detail & Related papers  (2023-11-14T19:41:50Z)
• Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-like Graphs [2.348041867134616]
  This paper presents (pseudo)polynomial-time algorithms to compute welfare-maximizing partitions in fractional hedonic games on tree-like graphs. A hardness result is provided, demonstrating that the pseudopolynomial-time solvability is the best possible under the assumption P$neq$NP.
  arXiv  Detail & Related papers  (2023-10-08T12:18:08Z)
• Universality of graph homomorphism games and the quantum coloring problem [0.0]
  We show that quantum graph parameters encode winning strategies for all possible synchronous non-local games. Winning strategies for a synchronous game can be transformed into winning strategies for an associated graph coloring game.
  arXiv  Detail & Related papers  (2023-05-29T14:28:28Z)
• Unlearnable Graph: Protecting Graphs from Unauthorized Exploitation [68.59161853439339]
  We propose a novel method for generating unlearnable graph examples. By injecting delusive but imperceptible noise into graphs using our Error-Minimizing Structural Poisoning (EMinS) module, we are able to make the graphs unexploitable.
  arXiv  Detail & Related papers  (2023-03-05T03:30:22Z)
• Bell inequalities with overlapping measurements [52.81011822909395]
  We study Bell inequalities where measurements of different parties can have overlap. This allows to accommodate problems in quantum information. The scenarios considered show an interesting behaviour with respect to Hilbert space dimension, overlap, and symmetry.
  arXiv  Detail & Related papers  (2023-03-03T18:11:05Z)
• Learning Universe Model for Partial Matching Networks over Multiple Graphs [78.85255014094223]
  We develop a universe matching scheme for partial matching of two or multiple graphs. The subtle logic for inlier matching and outlier detection can be clearly modeled. This is the first deep learning network that can cope with two-graph matching, multiple-graph matching, online matching, and mixture graph matching simultaneously.
  arXiv  Detail & Related papers  (2022-10-19T08:34:00Z)
• Learning Correlated Equilibria in Mean-Field Games [62.14589406821103]
  We develop the concepts of Mean-Field correlated and coarse-correlated equilibria. We show that they can be efficiently learnt in emphall games, without requiring any additional assumption on the structure of the game.
  arXiv  Detail & Related papers  (2022-08-22T08:31:46Z)
• Three-Player Game Training Dynamics [77.34726150561087]
  We explore three-player game training dynamics using an extended version of a simplified bilinear smooth game. We find that trilinear games do not converge on the Nash equilibrium in most cases. In addition to alternating and simultaneous updates, we explore a new update order--maximizer-first---which is only possible in a three-player game.
  arXiv  Detail & Related papers  (2022-08-12T23:57:44Z)
• Arkhipov's theorem, graph minors, and linear system nonlocal games [0.0]
  We study the solution groups of graph incidence games in which the underlying linear system is the incidence system of a two-coloured graph. Arkhipov's theorem states that the graph incidence game of a connected graph has a perfect quantum strategy if and only if it either has a perfect classical strategy, or the graph is nonplanar. We extend Arkhipov's theorem by showing that, for graph incidence games of connected two-coloured graphs, every quotient closed property of the solution group has a forbidden minor characterization.
  arXiv  Detail & Related papers  (2022-05-10T03:21:38Z)
• Near-Optimal Learning of Extensive-Form Games with Imperfect Information [54.55092907312749]
  We present the first line of algorithms that require only $widetildemathcalO((XA+YB)/varepsilon2)$ episodes of play to find an $varepsilon$-approximate Nash equilibrium in two-player zero-sum games. This improves upon the best known sample complexity of $widetildemathcalO((X2A+Y2B)/varepsilon2)$ by a factor of $widetildemathcalO(maxX,
  arXiv  Detail & Related papers  (2022-02-03T18:18:28Z)
• Monogamy of quantum entanglement [2.7631289602843774]
  monogamy of entanglement is restricted shareability of entanglement among multi-party systems. We introduce some generalized version of monogamy inequalities which extend and sharpen the traditional ones. We present two new definitions to define monogamy of entanglement.
  arXiv  Detail & Related papers  (2022-01-02T15:03:56Z)
• Rigidity for Monogamy-of-Entanglement Games [0.6091702876917281]
  We study the prototypical example of a game where the referee measures in either the computational or Hadamard basis. We show that this game satisfies a rigidity property similar to what is known for some nonlocal games. We also show rigidity for multiple copies of the game played in parallel.
  arXiv  Detail & Related papers  (2021-11-15T20:59:17Z)
• A Variational Inequality Approach to Bayesian Regression Games [90.79402153164587]
  We prove the existence of the uniqueness of a class of convex and generalize it to smooth cost functions. We provide two simple algorithms of solving them with necessarily strong convergence.
  arXiv  Detail & Related papers  (2021-03-24T22:33:11Z)
• The quantum-to-classical graph homomorphism game [0.0]
  We introduce a graph homomorphism game between quantum graphs and classical graphs. We show that winning strategies in the various quantum models for the game is an analogue of the notion of non-commutative graph homomorphisms. We also demonstrate explicit quantum colorings of all quantum complete graphs, yielding the surprising fact that the algebra of the $4$-coloring game for a quantum graph is always non-trivial.
  arXiv  Detail & Related papers  (2020-09-15T17:09:35Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.