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)- Products of synchronous games
- The quantum-to-classical graph homomorphism game
- Non-closure of the set of quantum correlations via graphs
- Quantum symmetries of quantum metric spaces and non-local games
- Bipartite matrix-valued tensor product correlations that are not finitely representable
- The set of quantum correlations is not closed
- Perfect strategies for non-local games
- Bigalois extensions and the graph isomorphism game
- The Connes embedding problem: a guided tour
- Quantum no-signalling correlations and non-local games
- Synchronous correlation matrices and Connes' embedding conjecture
- Synchronous values of games
- Universality of graph homomorphism games and the quantum coloring problem
- Almost synchronous quantum correlations
- Geometry of the set of synchronous quantum correlations
- Bisynchronous games and factorizable maps
- Synchronous linear constraint system games
- The universal theory of the hyperfinite \(\mathrm{II}_1\) factor is not computable
- Noncommutative nullstellensätze and perfect games
- Maximally entangled correlation sets
- Quantum semigroups from synchronous games
- \(\mathrm{MIP}^* = \mathrm{RE}\): a negative resolution to Connes' embedding problem and Tsirelson's problem
- Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting)
- A synchronous NPA hierarchy with applications
- Quantum hypergraph homomorphisms and non-local games
- Approximation of quantum assemblages
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)
