A synchronous game for binary constraint systems
From MaRDI portal
Publication:4635276
Abstract: Recently, W. Slofstra proved that the set of quantum correlations is not closed. We prove that the set of synchronous quantum correlations is not closed, which implies his result, by giving an example of a synchronous game that has a perfect quantum approximate strategy but no perfect quantum strategy. We also exhibit a graph for which the quantum independence number and the quantum approximate independence number are different. We prove new characterisations of synchronous quantum approximate correlations and synchronous quantum spatial correlations. We solve the synchronous approximation problem of Dykema and the second author, which yields a new equivalence of Connes' embedding problem in terms of synchronous correlations.
Recommendations
Cites work
- scientific article; zbMATH DE number 515467 (Why is no real title available?)
- About the Connes embedding conjecture
- Carathéodory's Theorem
- Connes' embedding problem and Tsirelson's problem
- Discrete groups with Kazhdan's property \(T\) and factorization property are residually finite
- Estimating quantum chromatic numbers
- Lovász theta type norms and operator systems
- Quantum chromatic numbers via operator systems
- Synchronous correlation matrices and Connes' embedding conjecture
- Tsirelson's problem and Kirchberg's conjecture
- \(C^*\)-algebras and finite-dimensional approximations
Cited in
(26)- Quantum no-signalling correlations and non-local games
- The Connes embedding problem: a guided tour
- Non-closure of the set of quantum correlations via graphs
- Bisynchronous games and factorizable maps
- Quantum symmetries of quantum metric spaces and non-local games
- Synchronous linear constraint system games
- Geometry of the set of synchronous quantum correlations
- The quantum-to-classical graph homomorphism game
- Products of synchronous games
- Approximation of quantum assemblages
- Universality of graph homomorphism games and the quantum coloring problem
- Synchronous values of games
- Quantum hypergraph homomorphisms and non-local games
- Bipartite matrix-valued tensor product correlations that are not finitely representable
- Noncommutative nullstellensätze and perfect games
- Synchronous correlation matrices and Connes' embedding conjecture
- The universal theory of the hyperfinite \(\mathrm{II}_1\) factor is not computable
- Almost synchronous quantum correlations
- Quantum semigroups from synchronous games
- The set of quantum correlations is not closed
- Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting)
- Bigalois extensions and the graph isomorphism game
- Maximally entangled correlation sets
- \(\mathrm{MIP}^* = \mathrm{RE}\): a negative resolution to Connes' embedding problem and Tsirelson's problem
- A synchronous NPA hierarchy with applications
- Perfect strategies for non-local games
This page was built for publication: A synchronous game for binary constraint systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635276)
