The M\"obius game and other Bell tests for relativity

• URL: http://arxiv.org/abs/2309.15752v1
• Date: Wed, 27 Sep 2023 16:08:13 GMT
• Title: The M\"obius game and other Bell tests for relativity
• Authors: Eleftherios-Ermis Tselentis, \"Amin Baumeler
• Abstract summary: We derive multiparty games that, if the winning chance exceeds a certain limit, prove the incompatibility of the parties' causal relations with any partial order. We discuss these games as device-independent tests of spacetime's dynamical nature in general relativity.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We derive multiparty games that, if the winning chance exceeds a certain limit, prove the incompatibility of the parties' causal relations with any partial order. This, in turn, means that the parties exert a back-action on the causal relations; the causal relations are dynamical. The games turn out to be representable by directed graphs, for instance by an orientation of the M\"obius ladder. We discuss these games as device-independent tests of spacetime's dynamical nature in general relativity. To do so, we design a relativistic setting where, in the Minkowski spacetime, the winning chance is bound to the limits. In contrast, we find otherwise tame processes with classical control of causal order that win the games deterministically. These suggest a violation of the bounds in gravitational implementations. We obtain these games by uncovering a "pairwise central symmetry" of the correlations in question. This symmetry allows us to recycle the facets of the acyclic subgraph polytope studied by Gr\"otschel, J\"unger, and Reinelt in the mid-80s for combinatorial optimization. In addition, we derive multiparty games in a scenario where the polytope dimension grows only linearly in the number of parties. Here, exceeding the limits not only proves the dynamical nature of the causal relations, but also that the correlations are incompatible with any global causal order.

Related papers

• The Möbius Game: A Quantum-Inspired Test of General Relativity [0.0]
  A general-relativistic violation of that inequality certifies change of curvature. A quantum-mechanical violation of a Bell inequality certifies a source of entanglement.
  arXiv  Detail & Related papers  (2024-07-24T12:03:10Z)
• A geometric decomposition of finite games: Convergence vs. recurrence under exponential weights [24.800126996235512]
  We decompose games into simpler components where the dynamics' long-run behavior is well understood. In particular, the dynamics of exponential / multiplicative weights (EW) schemes is not compatible with the Euclidean underpinnings of Helmholtz's theorem. We establish a deep connection with a well-known decomposition of games into a potential and harmonic component.
  arXiv  Detail & Related papers  (2024-05-12T08:58:35Z)
• Nonlocality under Computational Assumptions [51.020610614131186]
  A set of correlations is said to be nonlocal if it cannot be reproduced by spacelike-separated parties sharing randomness and performing local operations. We show that there exist (efficient) local producing measurements that cannot be reproduced through randomness and quantum-time computation.
  arXiv  Detail & Related papers  (2023-03-03T16:53:30Z)
• On the Convergence of No-Regret Learning Dynamics in Time-Varying Games [89.96815099996132]
  We characterize the convergence of optimistic gradient descent (OGD) in time-varying games. Our framework yields sharp convergence bounds for the equilibrium gap of OGD in zero-sum games. We also provide new insights on dynamic regret guarantees in static games.
  arXiv  Detail & Related papers  (2023-01-26T17:25:45Z)
• Reasoning about Causality in Games [63.930126666879396]
  Causal reasoning and game-theoretic reasoning are fundamental topics in artificial intelligence. We introduce mechanised games, which encode dependencies between agents' decision rules and the distributions governing the game. We describe correspondences between causal games and other formalisms, and explain how causal games can be used to answer queries that other causal or game-theoretic models do not support.
  arXiv  Detail & Related papers  (2023-01-05T22:47:28Z)
• 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)
• Conservation of correlation in measurement underlying the violation of Bell inequalities and a game of joint mapping [0.0]
  We show that it is the requirement of conservation of correlation which compels quantum measurement to violate the Bell inequalities. A quantum strategy with an access to an ensemble of entangled spin-$frac12$ particles and circuits for local quantum spin measurement, can be used to win the game.
  arXiv  Detail & Related papers  (2022-08-06T04:20:48Z)
• Causal games of work extraction with indefinite causal order [0.0]
  We consider the existence of two cooperating local Maxwell's demons which try to exploit the presence of global correlations and indefinite causal order. We prove that it is possible to have a larger probability to lower the local energy to zero if causal inequalities are violated, and that can be extracted more average work with respect to a definite causal order.
  arXiv  Detail & Related papers  (2022-08-04T09:47:12Z)
• Causal Expectation-Maximisation [70.45873402967297]
  We show that causal inference is NP-hard even in models characterised by polytree-shaped graphs. We introduce the causal EM algorithm to reconstruct the uncertainty about the latent variables from data about categorical manifest variables. We argue that there appears to be an unnoticed limitation to the trending idea that counterfactual bounds can often be computed without knowledge of the structural equations.
  arXiv  Detail & Related papers  (2020-11-04T10:25:13Z)
• Polynomial-Time Computation of Optimal Correlated Equilibria in Two-Player Extensive-Form Games with Public Chance Moves and Beyond [107.14897720357631]
  We show that an optimal correlated equilibrium can be computed in time in two-player games with public chance moves. This results in the biggest positive complexity result surrounding extensive-form correlation in more than a decade.
  arXiv  Detail & Related papers  (2020-09-09T14:51:58Z)

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.