Tsirelson's problem and an embedding theorem for groups arising from non-local games
From MaRDI portal
Publication:5216992
DOI10.1090/JAMS/929zbMATH Open1480.20083arXiv1606.03140OpenAlexW3099772093WikidataQ127521421 ScholiaQ127521421MaRDI QIDQ5216992FDOQ5216992
Publication date: 21 February 2020
Published in: Journal of the American Mathematical Society (Search for Journal in Brave)
Abstract: Tsirelson's problem asks whether the commuting operator model for two-party quantum correlations is equivalent to the tensor-product model. We give a negative answer to this question by showing that there are non-local games which have perfect commuting-operator strategies, but do not have perfect tensor-product strategies. The weak Tsirelson problem, which is known to be equivalent to Connes embedding problem, remains open. The examples we construct are instances of (binary) linear system games. For such games, previous results state that the existence of perfect strategies is controlled by the solution group of the linear system. Our main result is that every finitely-presented group embeds in some solution group. As an additional consequence, we show that the problem of determining whether a linear system game has a perfect commuting-operator strategy is undecidable.
Full work available at URL: https://arxiv.org/abs/1606.03140
Recommendations
Generators, relations, and presentations of groups (20F05) Contextuality in quantum theory (81P13) Quantum coherence, entanglement, quantum correlations (81P40) Cancellation theory of groups; application of van Kampen diagrams (20F06) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Operator algebra methods applied to problems in quantum theory (81R15)
Cites Work
- Synchronous correlation matrices and Connes' embedding conjecture
- Proposed Experiment to Test Local Hidden-Variable Theories
- Title not available (Why is that?)
- Simple unified form for the major no-hidden-variables theorems
- Characterization of Binary Constraint System Games
- On infinite-dimensional state spaces
- On non-semisplit extensions, tensor products and exactness of group \(C^*\)-algebras
- On Some Lemmas in the Theory of Groups
- Combinatorial group theory.
- An Algebraic Approach to Quantum Field Theory
- A Finitely Generated Infinite Simple Group
- Graph minors XXIII. Nash-Williams' immersion conjecture
- Tsirelson's problem and Kirchberg's conjecture
- About the Connes embedding conjecture
- Connes' embedding problem and Tsirelson's problem
- Unbounded violations of bipartite Bell inequalities via operator space theory
- Entangled Games Are Hard to Approximate
- The geometry of the word problem for finitely generated groups.
- Estimating quantum chromatic numbers
- Testing the Dimension of Hilbert Spaces
- Title not available (Why is that?)
- QUANTUM CHROMATIC NUMBERS VIA OPERATOR SYSTEMS
- Groups with no nontrivial linear representations
- THE SET OF QUANTUM CORRELATIONS IS NOT CLOSED
- Non-closure of the set of quantum correlations via graphs
- A physical approach to Tsirelson's problem
- Quantum XOR games
- Perfect commuting-operator strategies for linear system games
- Parallel repetition of entangled games
- Quantum Teleportation and Super-Dense Coding in Operator Algebras
- Bipartite matrix-valued tensor product correlations that are not finitely representable
- Quantum logic is undecidable
- Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability
Cited In (31)
- Limitations of semidefinite programs for separable states and entangled games
- Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision
- Title not available (Why is that?)
- Einstein meets Turing: the computability of nonlocal games
- Undecidability of the Spectral Gap
- Transitive nonlocal games
- Statistical constructions in quantum information theory
- 3XOR games with perfect commuting operator strategies have perfect tensor product strategies and are decidable in polynomial time
- THE SET OF QUANTUM CORRELATIONS IS NOT CLOSED
- Many bounded versions of undecidable problems are \textsf{NP}-hard
- \(p\)-saturations of Welter's game and the irreducible representations of symmetric groups
- Universality of graph homomorphism games and the quantum coloring problem
- Synchronous values of games
- Quantum hypergraph homomorphisms and non-local games
- Noncommutative nullstellensätze and perfect games
- Additivity violation of the regularized minimum output entropy
- Quantum logic is undecidable
- State convertibility in the von Neumann algebra framework
- Quantum teleportation in the commuting operator framework
- On Tsirelson pairs of C*-algebras
- A natural deduction system for orthomodular logic
- Commutative d-torsion K-theory and its applications
- Arkhipov's theorem, graph minors, and linear system nonlocal games
- Unitary correlation sets
- Classical vs quantum satisfiability in linear constraint systems modulo an integer
- Continuous-variable nonlocality and contextuality
- Title not available (Why is that?)
- Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting)
- Nonlocal Games with Noisy Maximally Entangled States are Decidable
- Perfect strategies for non-local games
- Non-unique games over compact groups and orientation estimation in cryo-EM
This page was built for publication: Tsirelson's problem and an embedding theorem for groups arising from non-local games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5216992)
