Perfect commuting-operator strategies for linear system games
From MaRDI portal
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.
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
Cites work
- Characterization of binary constraint system games
- Connes' embedding problem and Tsirelson's problem
- Estimating quantum chromatic numbers
- scientific article; zbMATH DE number 515467 (Why is no real title available?)
- Quantum mysteries revisited again
- Simple unified form for the major no-hidden-variables theorems
- Tsirelson's problem and Kirchberg's conjecture
Cited in
(29)- Entanglement in non-local games and the hyperlinear profile of groups
- Additivity violation of the regularized minimum output entropy
- Nonlocal games and quantum permutation groups
- Perfect strategies for non-local games
- Quantum and non-signalling graph isomorphisms
- Quantum logic is undecidable
- Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting)
- Perfect embezzlement of entanglement
- The set of quantum correlations is not closed
- Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision
- The quantum monad on relational structures
- Commutative d-torsion K-theory and its applications
- Tsirelson's problem and an embedding theorem for groups arising from non-local games
- Synchronous linear constraint system games
- Classical vs quantum satisfiability in linear constraint systems modulo an integer
- Generalized satisfiability problems via operator assignments
- 3XOR games with perfect commuting operator strategies have perfect tensor product strategies and are decidable in polynomial time
- Arkhipov's theorem, graph minors, and linear system nonlocal games
- Noncommutative nullstellensätze and perfect games
- The complexity of counting planar graph homomorphisms of domain size 3
- Synchronous values of games
- Rounding near-optimal quantum strategies for nonlocal games to strategies using a maximally entangled state
- Commutation groups and state-independent contextuality
- Asymmetric graphs with quantum symmetry
- An abstract structure determines the contextuality degree of observable-based Kochen-Specker proofs
- Satisfiability problems and algebras of Boolean constraint system games
- Solution group representations as quantum symmetries of graphs
- The membership problem for constant-sized quantum correlations is undecidable
- Satisfiability of commutative vs. non-commutative CSPs
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)
