A synchronous game for binary constraint systems
From MaRDI portal
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
- C^*-algebras and finite-dimensional approximations
- 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
- scientific article; zbMATH DE number 515467 (Why is no real title available?)
- 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
Cited in
(35)- Non-closure of the set of quantum correlations via graphs
- Bigalois extensions and the graph isomorphism game
- Approximation of quantum assemblages
- Bisynchronous games and factorizable maps
- Perfect strategies for non-local games
- Bipartite matrix-valued tensor product correlations that are not finitely representable
- Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting)
- Synchronous correlation matrices and Connes' embedding conjecture
- Geometry of the set of synchronous quantum correlations
- The set of quantum correlations is not closed
- Almost synchronous quantum correlations
- Maximally entangled correlation sets
- Quantum semigroups from synchronous games
- Synchronous linear constraint system games
- The Connes embedding problem: a guided tour
- The quantum-to-classical graph homomorphism game
- Products of synchronous games
- Quantum symmetries of quantum metric spaces and non-local games
- \(\mathrm{MIP}^* = \mathrm{RE}\): a negative resolution to Connes' embedding problem and Tsirelson's problem
- A synchronous NPA hierarchy with applications
- Noncommutative nullstellensätze and perfect games
- Quantum hypergraph homomorphisms and non-local games
- Quantum no-signalling correlations and non-local games
- Universality of graph homomorphism games and the quantum coloring problem
- Synchronous values of games
- The universal theory of the hyperfinite \(\mathrm{II}_1\) factor is not computable
- Trace spaces of full free product C^* -algebras
- Unique games and games based on groups
- Rounding near-optimal quantum strategies for nonlocal games to strategies using a maximally entangled state
- Undecidability and incompleteness in quantum information theory and operator algebras
- Satisfiability problems and algebras of Boolean constraint system games
- The membership problem for constant-sized quantum correlations is undecidable
- Approximate quantum 3-colorings of graphs and the quantum max 3-cut problem
- The universal theory of locally universal tracial von Neumann algebras is not computable
- An operator system approach to self-testing
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)
