Perfect commuting-operator strategies for linear system games

DOI10.1063/1.4973422zbMATH Open1355.81048arXiv1606.02278OpenAlexW2409179138MaRDI QIDQ2963285FDOQ2963285

Authors: Richard Cleve, Li Liu, William Slofstra 

Publication date: 13 February 2017

Published in: Journal of Mathematical Physics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1606.02278

Recommendations

• Perfect strategies for non-local games
• Tsirelson's problem and an embedding theorem for groups arising from non-local games
• 3XOR games with perfect commuting operator strategies have perfect tensor product strategies and are decidable in polynomial time
• Synchronous linear constraint system games
• On deciding the existence of perfect entangled strategies for nonlocal games

zbMATH Keywords

Mermin's magic square game

Mathematics Subject Classification ID

2-person games (91A05) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Cites Work

• Title not available (Why is that?)
• Simple unified form for the major no-hidden-variables theorems
• Characterization of binary constraint system games
• Quantum mysteries revisited again
• Tsirelson's problem and Kirchberg's conjecture
• Connes' embedding problem and Tsirelson's problem
• Estimating quantum chromatic numbers

Cited In (21)

• Perfect embezzlement of entanglement
• Entanglement in non-local games and the hyperlinear profile of groups
• Nonlocal games and quantum permutation groups
• Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision
• Quantum and non-signalling graph isomorphisms
• The quantum monad on relational structures
• Synchronous linear constraint system games
• Generalized satisfiability problems via operator assignments
• 3XOR games with perfect commuting operator strategies have perfect tensor product strategies and are decidable in polynomial time
• Tsirelson's problem and an embedding theorem for groups arising from non-local games
• Synchronous values of games
• Noncommutative nullstellensätze and perfect games
• Additivity violation of the regularized minimum output entropy
• Quantum logic is undecidable
• Commutative d-torsion K-theory and its applications
• Arkhipov's theorem, graph minors, and linear system nonlocal games
• Classical vs quantum satisfiability in linear constraint systems modulo an integer
• The set of quantum correlations is not closed
• The complexity of counting planar graph homomorphisms of domain size 3
• Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting)
• Perfect strategies for non-local games

This page was built for publication: Perfect commuting-operator strategies for linear system games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2963285)