pith. sign in

arxiv: 2510.16214 · v1 · pith:EUKR6PEYnew · submitted 2025-10-17 · 🪐 quant-ph · math-ph· math.MP

Commuting Embeddings for Parallel Strategies in Non-local Games

Sarah Chehade , Andrea Delgado , Elaine Wong This is my paper

Pith reviewed 2026-05-25 07:31 UTC · model grok-4.3

classification 🪐 quant-ph math-phmath.MP
keywords non-local gamescommuting embeddingsCartan decompositionquantum strategiesparallel strategiesqubit reductionalgebraic embeddingsLie theory
0
0 comments X

The pith

Commuting embeddings of game algebras into a shared Cartan decomposition let multiple non-local games run in parallel on fewer qubits than tensor products require.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper shows that the usual additive qubit cost for playing several non-local games at once can be lowered when the algebras of the games admit commuting embeddings. Standard parallel play uses a tensor product of the local Hilbert spaces for each game. When the algebras can be aligned to commute inside a common ambient algebra that also shares a Cartan decomposition, the combined strategy fits in a smaller space while keeping the original winning probabilities. The construction relies on Lie theory to produce the embeddings explicitly. This framing turns non-local games into algebraic building blocks that can reduce resource demands in quantum protocols.

Core claim

When the game algebras arising from a collection of non-local games admit embeddings into a common ambient algebra in which the images commute and share a Cartan decomposition that preserves the individual winning probabilities, the parallel strategies can be realized simultaneously on a Hilbert space whose dimension is strictly smaller than that of the tensor product of the separate strategy spaces.

What carries the argument

commuting embeddings of the game algebras aligned into a common Cartan decomposition

If this is right

  • A referee who picks one game at random from a finite collection can prepare a single maximally entangled state whose dimension equals only the largest individual game.
  • Simultaneous parallel execution of several games becomes possible with a total qubit count below the sum of the separate requirements.
  • Non-local games function as algebraic primitives that support distributed quantum computations under qubit constraints.
  • The same algebraic conditions supply a device-independent method to witness the dimension of the underlying Hilbert space.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same embedding technique might compress resources in other multi-task quantum correlation scenarios that are not phrased as games.
  • Concrete implementations of the construction for standard games such as CHSH could be tested on current hardware to measure actual qubit savings.
  • If the method generalizes, it could reduce the overhead of entanglement benchmarking when many different correlation tests must run on the same device.

Load-bearing premise

The game algebras from the chosen non-local games can be embedded into one ambient algebra where they commute and share a Cartan decomposition without lowering the original winning probabilities.

What would settle it

An explicit pair of non-local games whose algebras admit no commuting common Cartan embedding that keeps both winning probabilities at their individual maxima would show the reduction is not always possible.

Figures

Figures reproduced from arXiv: 2510.16214 by Andrea Delgado, Elaine Wong, Sarah Chehade.

Figure 1
Figure 1. Figure 1: For K = 4, this graphic depicts 4 parallel and independent games, where each game requires 2 entangled states. For game i and qubit j, the qi,j denotes qubits while the dashed line represents the entanglement between the qubits (players). Theorem 2. Let {Gi} K i=1 be K non-local games, each admitting a perfect quantum strategy on a fixed number of qubits ni for each player. Let Ai be the C ∗ -algebra gener… view at source ↗
Figure 2
Figure 2. Figure 2: Two MSGs from Example 4 compressed to 3 qubits per player. [PITH_FULL_IMAGE:figures/full_fig_p015_2.png] view at source ↗
read the original 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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The paper claims that non-local games can be played in parallel on fewer qubits than the tensor-product baseline when their game algebras admit commuting embeddings into a common ambient algebra. It provides a constructive framework using Lie theory to align the algebras via a shared Cartan decomposition that preserves the original operator relations and winning probabilities. A separate compression result shows that randomly selecting one game from a finite collection can be implemented with a single maximally entangled state whose dimension equals that of the largest individual game.

Significance. If the constructions hold, the work supplies an algebraic route to qubit compression in parallel quantum strategies, with explicit Lie-theoretic tools rather than non-constructive existence arguments. This strengthens the view of non-local games as resource primitives for distributed quantum computation and as device-independent dimension witnesses. The emphasis on commuting embeddings and Cartan alignment is a concrete technical contribution that could be tested on small game families.

minor comments (3)
  1. [§3.2] §3.2: the statement that the common Cartan decomposition 'automatically preserves the winning probability' would benefit from an explicit one-line verification that the embedded projectors satisfy the same trace relations as the original strategy operators.
  2. [§4, §5] Notation: the symbol for the ambient algebra is introduced in two different fonts (script vs. fraktur) across §4 and §5; a single consistent choice would improve readability.
  3. [§6] The example in §6 uses a 3-qubit reduction for two specific games but does not tabulate the original tensor-product qubit count alongside the embedded count; adding this comparison would make the claimed saving immediate.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the supportive summary, positive assessment of significance, and recommendation of minor revision. No specific major comments appear in the report, so we have no individual points requiring rebuttal or clarification at this stage.

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper develops a constructive framework for commuting embeddings of game algebras via alignment into a common Cartan decomposition using Lie-theoretic tools. No equations, fitted parameters, or predictions reduce by construction to the inputs. The central claims rest on algebraic constructions supplied inside the manuscript rather than on self-definitional loops, load-bearing self-citations, or renamed known results. The reader's assessment of score 2.0 is consistent with an independent derivation chain.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Abstract only; no explicit free parameters, ad-hoc axioms, or new entities are named. The central claim rests on the domain assumption that suitable commuting embeddings exist for the games under consideration.

axioms (1)
  • domain assumption Game algebras admit embeddings into a common ambient algebra in which they commute and share a Cartan decomposition that preserves winning probabilities.
    Invoked to obtain the qubit reduction below the tensor-product baseline.

pith-pipeline@v0.9.0 · 5741 in / 1289 out tokens · 28659 ms · 2026-05-25T07:31:10.783529+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

17 extracted references · 17 canonical work pages · 2 internal anchors

  1. [1]

    Extending and Characterizing Quantum Magic Games

    Alex Arkhipov. Extending and characterizing quantum magic games.arXiv preprint arXiv:1209.3819, 2012

    work page internal anchor Pith review Pith/arXiv arXiv 2012

  2. [2]

    Dimension witnesses and quantum state dis- crimination.Physical review letters, 110(15):150501, 2013

    Nicolas Brunner, Miguel Navascu´ es, and Tam´ as V´ ertesi. Dimension witnesses and quantum state dis- crimination.Physical review letters, 110(15):150501, 2013

    work page 2013

  3. [3]

    A game-theoretic quantum algorithm for solving magic squares.arXiv preprint arXiv:2505.13366, 2025

    Sarah Chehade, Andrea Delgado, and Elaine Wong. A game-theoretic quantum algorithm for solving magic squares.arXiv preprint arXiv:2505.13366, 2025

    work page arXiv 2025

  4. [4]

    Proposed experiment to test local hidden-variable theories.Physical review letters, 23(15):880, 1969

    John F Clauser, Michael A Horne, Abner Shimony, and Richard A Holt. Proposed experiment to test local hidden-variable theories.Physical review letters, 23(15):880, 1969

    work page 1969

  5. [5]

    A generalization of chsh and the algebraic structure of optimal strategies.Quantum, 4:346, 2020

    David Cui, Arthur Mehta, Hamoon Mousavi, and Seyed Sajjad Nezhadi. A generalization of chsh and the algebraic structure of optimal strategies.Quantum, 4:346, 2020

    work page 2020

  6. [6]

    Application-level benchmarking of quantum computers using nonlocal game strategies.Quantum Sci- ence and Technology, 10(4):045002, 2025

    Jim Furches, Sarah Chehade, Kathleen Hamilton, Nathan Wiebe, and Carlos Ortiz Marrero. Application-level benchmarking of quantum computers using nonlocal game strategies.Quantum Sci- ence and Technology, 10(4):045002, 2025

    work page 2025

  7. [7]

    Lie groups, lie algebras, and representations

    Brian C Hall. Lie groups, lie algebras, and representations. InQuantum Theory for Mathematicians, pages 333–366. Springer, 2013. 16

    work page 2013

  8. [8]

    Z. Ji, A. Natarajan, T. Vidick, J. Wright, and H.Ji Yuen. MIP* = RE.Commun. ACM, 64(11):131–138, 2021

    work page 2021

  9. [9]

    Khaneja and S

    N. Khaneja and S. J. Glaser. Cartan decomposition of su (2 n) and control of spin systems.Chemical Physics, 267(1-3):11–23, 2001

    work page 2001

  10. [10]

    Group-invariant quantum machine learning.PRX quantum, 3(3):030341, 2022

    Mart´ ın Larocca, Fr´ ed´ eric Sauvage, Faris M Sbahi, Guillaume Verdon, Patrick J Coles, and Marco Cerezo. Group-invariant quantum machine learning.PRX quantum, 3(3):030341, 2022

    work page 2022

  11. [11]

    Glued magic games self-test maxi- mally entangled states.arXiv preprint arXiv:2105.10658, 2021

    Laura Manˇ cinska, Thor Gabelgaard Nielsen, and Jitendra Prakash. Glued magic games self-test maxi- mally entangled states.arXiv preprint arXiv:2105.10658, 2021

    work page arXiv 2021

  12. [12]

    David Mermin

    N. David Mermin. Simple unified form for the major no-hidden-variables theorems.Phys. Rev. Lett., 65:3373–3376, Dec 1990

    work page 1990

  13. [13]

    Optimal robust quantum self-testing by binary nonlocal XOR games

    Carl A Miller and Yaoyun Shi. Optimal robust quantum self-testing by binary nonlocal xor games. arXiv preprint arXiv:1207.1819, 2012

    work page internal anchor Pith review Pith/arXiv arXiv 2012

  14. [14]

    Nonlocal games, compression theorems, and the arithmetical hierarchy

    Hamoon Mousavi, Seyed Sajjad Nezhadi, and Henry Yuen. Nonlocal games, compression theorems, and the arithmetical hierarchy. InProceedings of the 54th annual ACM SIGACT symposium on theory of computing, pages 1–11, 2022

    work page 2022

  15. [15]

    Oblivious communication game, self-testing of projective and nonprojective measurements, and certification of randomness.Physical Review A, 104(2):022212, 2021

    AK Pan. Oblivious communication game, self-testing of projective and nonprojective measurements, and certification of randomness.Physical Review A, 104(2):022212, 2021

    work page 2021

  16. [16]

    Self-testing of quantum systems: a review.Quantum, 4:337, 2020

    Ivan ˇSupi´ c and Joseph Bowles. Self-testing of quantum systems: a review.Quantum, 4:337, 2020

    work page 2020

  17. [17]

    Quantum no-signalling correlations and non-local games

    Ivan G Todorov and Lyudmila Turowska. Quantum no-signalling correlations and non-local games. Communications in Mathematical Physics, 405(6):141, 2024. 17

    work page 2024