Tsirelson’s problem and an embedding theorem for groups arising from non-local games

DOI10.1090/jams/929zbMath1480.20083arXiv1606.03140OpenAlexW3099772093WikidataQ127521421 ScholiaQ127521421MaRDI QIDQ5216992

William Slofstra

Publication date: 21 February 2020

Published in: Journal of the American Mathematical Society (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Operator algebra methods applied to problems in quantum theory (81R15) Cancellation theory of groups; application of van Kampen diagrams (20F06) Quantum coherence, entanglement, quantum correlations (81P40) Contextuality in quantum theory (81P13)

Related Items (22)

Continuous-variable nonlocality and contextuality ⋮ Additivity violation of the regularized minimum output entropy ⋮ Undecidability of the Spectral Gap ⋮ Quantum logic is undecidable ⋮ Nonlocal Games with Noisy Maximally Entangled States are Decidable ⋮ Unitary correlation sets ⋮ Quantum teleportation in the commuting operator framework ⋮ 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 ⋮ State convertibility in the von Neumann algebra framework ⋮ Noncommutative nullstellensätze and perfect games ⋮ Quantum hypergraph homomorphisms and non-local games ⋮ Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting) ⋮ THE SET OF QUANTUM CORRELATIONS IS NOT CLOSED ⋮ Limitations of semidefinite programs for separable states and entangled games ⋮ Commutative d-torsion K-theory and its applications ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision ⋮ Perfect strategies for non-local games ⋮ Classical vs quantum satisfiability in linear constraint systems modulo an integer ⋮ Einstein meets Turing: the computability of nonlocal games

Cites Work

• Unnamed Item
• Unnamed Item
• About the Connes embedding conjecture
• Unbounded violations of bipartite Bell inequalities via operator space theory
• The geometry of the word problem for finitely generated groups.
• Graph minors XXIII. Nash-Williams' immersion conjecture
• On non-semisplit extensions, tensor products and exactness of group \(C^*\)-algebras
• Combinatorial group theory.
• Non-closure of the set of quantum correlations via graphs
• A physical approach to Tsirelson's problem
• Bipartite matrix-valued tensor product correlations that are not finitely representable
• Quantum logic is undecidable
• Synchronous correlation matrices and Connes’ embedding conjecture
• Quantum XOR Games
• TSIRELSON'S PROBLEM AND KIRCHBERG'S CONJECTURE
• Perfect commuting-operator strategies for linear system games
• Entangled Games Are Hard to Approximate
• Testing the Dimension of Hilbert Spaces
• Groups with no nontrivial linear representations
• Simple unified form for the major no-hidden-variables theorems
• THE SET OF QUANTUM CORRELATIONS IS NOT CLOSED
• On Some Lemmas in the Theory of Groups
• Quantum Teleportation and Super-Dense Coding in Operator Algebras
• Characterization of Binary Constraint System Games
• Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability
• Connes' embedding problem and Tsirelson's problem
• QUANTUM CHROMATIC NUMBERS VIA OPERATOR SYSTEMS
• Proposed Experiment to Test Local Hidden-Variable Theories
• On infinite-dimensional state spaces
• Parallel repetition of entangled games
• An Algebraic Approach to Quantum Field Theory
• A Finitely Generated Infinite Simple Group
• Estimating quantum chromatic numbers

This page was built for publication: Tsirelson’s problem and an embedding theorem for groups arising from non-local games