Commuting Embeddings for Parallel Strategies in Non-local Games

• URL: http://arxiv.org/abs/2510.16214v1
• Date: Fri, 17 Oct 2025 21:00:09 GMT
• Title: Commuting Embeddings for Parallel Strategies in Non-local Games
• Authors: Sarah Chehade, Andrea Delgado, Elaine Wong,
• Abstract summary: Non-local games provide a versatile framework for probing quantum correlations.<n>In finite dimensions, the standard method for playing several games in parallel requires a tensor product of the local Hilbert spaces.<n>We show that this additive cost can be reduced by exploiting algebraic embeddings.
• Score: 1.6312989763677892
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Non-local games (NLGs) provide a versatile framework for probing quantum correlations and for benchmarking the power of entanglement. In finite dimensions, the standard method for playing several games in parallel requires a tensor product of the local Hilbert spaces, which scales additively in the number of qubits. In this work, we show that this additive cost can be reduced by exploiting algebraic embeddings. We introduce two forms of compressions. First, when a referee selects one game from a finite collection of games at random, the game quantum strategy can be implemented using a maximally entangled state of dimension equal to the largest individual game, thereby eliminating the need for repeated state preparations. Second, we establish conditions under which several games can be played simultaneously in parallel on fewer qubits than the tensor product baseline. These conditions are expressed in terms of commuting embeddings of the game algebras. Moreover, we provide a constructive framework for building such embeddings. Using tools from Lie theory, we show that aligning the various game algebras into a common Cartan decomposition enables such a qubit reduction. Beyond the theoretical contribution, our framework casts NLGs as algebraic primitives for distributed and resource constrained quantum computations and suggested NLGs as a comparable device independent dimension witness.

Related papers

• A convergent sum-of-squares hierarchy for compiled nonlocal games [1.5029560229270191]
  We study "compiled" nonlocal games played between a classical verifier and a single quantum prover.<n>We show that the success probability of a quantum prover in the compiled game is bounded by the game's quantum commuting-operator value.<n>We extend the niceness framework and construct a hierarchy of semidefinite programs that searches exclusively over nice certificates.
  arXiv  Detail & Related papers  (2025-07-23T15:16:38Z)
• Quantitative Quantum Soundness for Bipartite Compiled Bell Games via the Sequential NPA Hierarchy [3.34301287453961]
  We show the first quantitative quantum soundness bounds for every bipartite compiled Bell game.<n>More generally, for all bipartite games we show that the compiled score cannot significantly exceed the bounds given by a newly formalized sequential Navascu'es-Pironio-Ac'in hierarchy.
  arXiv  Detail & Related papers  (2025-07-22T20:31:41Z)
• Bounding the asymptotic quantum value of all multipartite compiled non-local games [0.27998963147546146]
  Non-local games are a powerful tool to distinguish between correlations possible in classical and quantum worlds.<n> Kalai et al. (STOC'23) proposed a compiler that converts multipartite non-local games into interactive protocols with a single prover.<n>We prove Kalai et al.'s compiler indeed achieves quantum soundness for all multipartite non-local games.
  arXiv  Detail & Related papers  (2025-07-16T16:58:39Z)
• A Game-Theoretic Quantum Algorithm for Solving Magic Squares [2.09260520196733]
  We present a variational framework for the Magic Square Game (MSG), a two-player non-local game with perfect quantum advantage.<n>We construct a value Hamiltonian that encodes the game's parity and consistency constraints, then optimize parameterized quantum circuits to minimize this cost.
  arXiv  Detail & Related papers  (2025-05-19T17:12:53Z)
• 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.<n>We establish a quantum soundness result for all compiled two-player nonlocal games.
  arXiv  Detail & Related papers  (2024-08-13T08:11:56Z)
• Permissible extensions of classical to quantum games combining three strategies [0.0]
  We study the extension of classical games to the quantum domain. We use the obtained results to extend the classical Prisoner's Dilemma game to a quantum game.
  arXiv  Detail & Related papers  (2024-04-09T10:38:10Z)
• 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)
• 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)
• Global Nash Equilibrium in Non-convex Multi-player Game: Theory and Algorithms [66.8634598612777]
  We show that Nash equilibrium (NE) is acceptable to all players in a multi-player game. We also show that no one can benefit unilaterally from the general theory step by step.
  arXiv  Detail & Related papers  (2023-01-19T11:36:50Z)
• 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)
• On the relation between completely bounded and $(1,cb)$-summing maps with applications to quantum XOR games [65.51757376525798]
  We show that given a linear map from a general operator space into the dual of a C$*$-algebra, its completely bounded norm is upper bounded by a universal constant times its $(''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''
  arXiv  Detail & Related papers  (2021-12-09T21:06:52Z)

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.