Perfect Commuting-Operator Strategies for Linear System Games

Abstract

Linear system games are a generalization of Mermin's magic square game introduced by Cleve and Mittal. They show that perfect strategies for linear system games in the tensor-product model of entanglement correspond to finite-dimensional operator solutions of a certain set of non-commutative equations. We investigate linear system games in the commuting-operator model of entanglement, where Alice and Bob's measurement operators act on a joint Hilbert space, and Alice's operators must commute with Bob's operators. We show that perfect strategies in this model correspond to possibly-infinite-dimensional operator solutions of the non-commutative equations. The proof is based around a finitely-presented group associated to the linear system which arises from the non-commutative equations.

References in corpus (4)

• Hidden Variables and the Two Theorems of John Bell
• Connes' embedding problem and Tsirelson's problem
• Tsirelson's Problem
• Extending and Characterizing Quantum Magic Games

Cited by in corpus (25)

• Self-testing of quantum systems: a review
• The contextual fraction as a measure of contextuality
• Tsirelson's problem and an embedding theorem for groups arising from non-local games
• Perfect strategies for non-signalling games
• Robust self-testing for linear constraint system games
• Entanglement in non-local games and the hyperlinear profile of groups
• Quantum logic is undecidable
• Homotopical approach to quantum contextuality
• Constant-sized correlations are sufficient to robustly self-test maximally entangled states with unbounded dimension
• Synchronous linear constraint system games
• A generalization of CHSH and the algebraic structure of optimal strategies
• Solution group representations as quantum symmetries of graphs
• A group with at least subexponential hyperlinear profile
• Noncommutative Nullstellensätze and Perfect Games
• Unconditional quantum magic advantage in shallow circuit computation
• Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision
• 3XOR Games with Perfect Commuting Operator Strategies Have Perfect Tensor Product Strategies and are Decidable in Polynomial Time
• Curious properties of free hypergraph C*-algebras
• No quantum solutions to linear constraint systems in odd dimension from Pauli group and diagonal Cliffords
• The membership problem for constant-sized quantum correlations is undecidable
• Commutative d-Torsion K-Theory and Its Applications
• An abstract structure determines the contextuality degree of observable-based Kochen-Specker proofs
• Generalized Satisfiability Problems via Operator Assignments
• Asymmetric graphs with quantum symmetry
• Morphisms in categories of nonlocal games