Tsirelson's problem and an embedding theorem for groups arising from non-local games
From MaRDI portal
(Redirected from Publication:5216992)
Generators, relations, and presentations of groups (20F05) Cancellation theory of groups; application of van Kampen diagrams (20F06) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Contextuality in quantum theory (81P13) Quantum coherence, entanglement, quantum correlations (81P40) Operator algebra methods applied to problems in quantum theory (81R15)
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.
Recommendations
Cites work
- A Finitely Generated Infinite Simple Group
- A physical approach to Tsirelson's problem
- About the Connes embedding conjecture
- An Algebraic Approach to Quantum Field Theory
- Bipartite matrix-valued tensor product correlations that are not finitely representable
- Characterization of binary constraint system games
- Combinatorial group theory.
- Connes' embedding problem and Tsirelson's problem
- Entangled games are hard to approximate
- Estimating quantum chromatic numbers
- Graph minors XXIII. Nash-Williams' immersion conjecture
- Groups with no nontrivial linear representations
- scientific article; zbMATH DE number 515467 (Why is no real title available?)
- scientific article; zbMATH DE number 6292749 (Why is no real title available?)
- Non-closure of the set of quantum correlations via graphs
- 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
- Parallel repetition of entangled games
- Perfect commuting-operator strategies for linear system games
- Proposed experiment to test local hidden-variable theories
- Quantum chromatic numbers via operator systems
- Quantum logic is undecidable
- Quantum teleportation and super-dense coding in operator algebras
- Quantum XOR games
- Simple unified form for the major no-hidden-variables theorems
- Synchronous correlation matrices and Connes' embedding conjecture
- Testing the dimension of Hilbert spaces
- The geometry of the word problem for finitely generated groups.
- The set of quantum correlations is not closed
- Tsirelson's problem and Kirchberg's conjecture
- Unbounded entanglement can be needed to achieve the optimal success probability
- Unbounded violations of bipartite Bell inequalities via operator space theory
Cited in
(48)- \(p\)-saturations of Welter's game and the irreducible representations of symmetric groups
- Unitary correlation sets
- Limitations of semidefinite programs for separable states and entangled games
- A physical approach to Tsirelson's problem
- Entanglement in non-local games and the hyperlinear profile of groups
- Einstein meets Turing: the computability of nonlocal games
- Continuous-variable nonlocality and contextuality
- Additivity violation of the regularized minimum output entropy
- State convertibility in the von Neumann algebra framework
- Operator systems from discrete groups
- Perfect strategies for non-local games
- Quantum logic is undecidable
- Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting)
- Perfect commuting-operator strategies for linear system games
- Connes' embedding problem and winning strategies for quantum XOR games
- The set of quantum correlations is not closed
- Non-unique games over compact groups and orientation estimation in cryo-EM
- Undecidability of the Spectral Gap
- Algorithms, bounds, and strategies for entangled XOR games
- Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision
- Nonlocal Games with Noisy Maximally Entangled States are Decidable
- The quantum monad on relational structures
- Commutative d-torsion K-theory and its applications
- Connes' embedding problem and Tsirelson's problem
- Tsirelson's problem and asymptotically commuting unitary matrices
- Classical vs quantum satisfiability in linear constraint systems modulo an integer
- 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
- On Tsirelson pairs of C*-algebras
- Arkhipov's theorem, graph minors, and linear system nonlocal games
- Noncommutative nullstellensätze and perfect games
- Quantum hypergraph homomorphisms and non-local games
- Transitive nonlocal games
- Statistical constructions in quantum information theory
- Many bounded versions of undecidable problems are \textsf{NP}-hard
- Universality of graph homomorphism games and the quantum coloring problem
- Synchronous values of games
- A natural deduction system for orthomodular logic
- Quantum delegation with an off-the-shelf device
- Transfer of quantum game strategies
- The computational advantage of MIP* vanishes in the presence of noise
- The computational advantage of MIP* vanishes in the presence of noise
- Commutation groups and state-independent contextuality
- Asymmetric graphs with quantum symmetry
- Undecidability in physics: a review
- Satisfiability problems and algebras of Boolean constraint system games
- The membership problem for constant-sized quantum correlations is undecidable
- On the quantum chromatic numbers of small graphs
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)
