A synchronous game for binary constraint systems

DOI10.1063/1.4996867zbMATH Open1384.81018arXiv1707.01016OpenAlexW2727177017WikidataQ130119663 ScholiaQ130119663MaRDI QIDQ4635276FDOQ4635276

Vern I. Paulsen, Christopher P. Schafhauser, Se-Jin Kim

Publication date: 16 April 2018

Published in: Journal of Mathematical Physics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1707.01016

Recommendations

• The set of quantum correlations is not closed
• Almost synchronous quantum correlations
• Synchronous linear constraint system games
• Synchronicity for quantum non-local games
• Geometry of the set of synchronous quantum correlations

Mathematics Subject Classification ID

2-person games (91A05) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Cites Work

• Synchronous correlation matrices and Connes' embedding conjecture
• \(C^*\)-algebras and finite-dimensional approximations
• Title not available (Why is that?)
• Discrete groups with Kazhdan's property \(T\) and factorization property are residually finite
• Tsirelson's problem and Kirchberg's conjecture
• About the Connes embedding conjecture
• Connes' embedding problem and Tsirelson's problem
• Estimating quantum chromatic numbers
• QUANTUM CHROMATIC NUMBERS VIA OPERATOR SYSTEMS
• Carathéodory's Theorem
• Lovász theta type norms and operator systems

Cited In (21)

• 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
• Universality of graph homomorphism games and the quantum coloring problem
• Approximation of quantum assemblages
• Synchronous values of games
• Quantum hypergraph homomorphisms and non-local games
• Noncommutative nullstellensätze and perfect games
• Bipartite matrix-valued tensor product correlations that are not finitely representable
• The universal theory of the hyperfinite \(\mathrm{II}_1\) factor is not computable
• Almost synchronous quantum correlations
• The Connes embedding problem: A guided tour
• Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting)
• Bigalois extensions and the graph isomorphism game
• \(\mathrm{MIP}^* = \mathrm{RE}\): a negative resolution to Connes' embedding problem and Tsirelson's problem
• Perfect strategies for non-local games
• Quantum no-signalling correlations and 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)