Characterization of Binary Constraint System Games
From MaRDI portal
Publication:5167752
DOI10.1007/978-3-662-43948-7_27zbMath1364.91015arXiv1209.2729OpenAlexW1933312167MaRDI QIDQ5167752
Publication date: 1 July 2014
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1209.2729
Related Items
Almost synchronous quantum correlations ⋮ Quantum logic is undecidable ⋮ Maximally Entangled State in Pseudo-Telepathy Games ⋮ Nonlocal games and quantum permutation groups ⋮ A state-space approach to quantum permutations ⋮ 3XOR games with perfect commuting operator strategies have perfect tensor product strategies and are decidable in polynomial time ⋮ Quantum and non-signalling graph isomorphisms ⋮ Analysis of Boolean functions related to binary input binary output two-party nonlocal games ⋮ Arkhipov's theorem, graph minors, and linear system nonlocal games ⋮ \(\mathrm{MIP}^* = \mathrm{RE}\): a negative resolution to Connes' embedding problem and Tsirelson's problem ⋮ Deciding the existence of perfect entangled strategies for nonlocal games ⋮ Perfect commuting-operator strategies for linear system games ⋮ Quantum hypergraph homomorphisms and non-local games ⋮ Contextuality with a small number of observables ⋮ THE SET OF QUANTUM CORRELATIONS IS NOT CLOSED ⋮ Entanglement in non-local games and the hyperlinear profile of groups ⋮ Commutative d-torsion K-theory and its applications ⋮ Unnamed Item ⋮ Generalized satisfiability problems via operator assignments ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Tsirelson’s problem and an embedding theorem for groups arising from non-local games ⋮ Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision ⋮ Perfect strategies for non-local games ⋮ Synchronous linear constraint system games ⋮ Classical vs quantum satisfiability in linear constraint systems modulo an integer
