THE SET OF QUANTUM CORRELATIONS IS NOT CLOSED

From MaRDI portal
Publication:4610442

DOI10.1017/fmp.2018.3zbMath1405.81021arXiv1703.08618OpenAlexW2963458829MaRDI QIDQ4610442

William Slofstra

Publication date: 16 January 2019

Published in: Forum of Mathematics, Pi (Search for Journal in Brave)

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




Related Items (30)

The quantum-to-classical graph homomorphism gameAlmost synchronous quantum correlationsAnchored Parallel Repetition for Nonlocal GamesQuantum Teleportation and Super-Dense Coding in Operator AlgebrasGeometry of information structures, strategic measures and associated stochastic control topologiesBipartite matrix-valued tensor product correlations that are not finitely representableNon-closure of quantum correlation matrices and factorizable channels that require infinite dimensional ancilla (With an appendix by Narutaka Ozawa)Nonlocal Games with Noisy Maximally Entangled States are DecidableUnitary correlation setsApproximate completely positive semidefinite factorizations and their ranksA Characterization of Perfect Strategies for Mirror GamesQuantum and non-signalling graph isomorphismsArkhipov's theorem, graph minors, and linear system nonlocal games\(\mathrm{MIP}^* = \mathrm{RE}\): a negative resolution to Connes' embedding problem and Tsirelson's problemGraph isomorphism: physical resources, optimization models, and algebraic characterizationsExact values of quantum violations in low-dimensional Bell correlation inequalitiesQuantum hypergraph homomorphisms and non-local gamesGeometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting)Bisynchronous games and factorizable mapsNon-closure of the set of quantum correlations via graphsMixed states in one spatial dimension: Decompositions and correspondence with nonnegative matricesGeometry of the set of synchronous quantum correlationsCorrelation matrices, Clifford algebras, and completely positive semidefinite rankTsirelson’s problem and an embedding theorem for groups arising from non-local gamesPerfect strategies for non-local gamesLower bounds on matrix factorization ranks via noncommutative polynomial optimizationA universal representation for quantum commuting correlationsThe Connes embedding problem: A guided tourClassical vs quantum satisfiability in linear constraint systems modulo an integerEinstein meets Turing: the computability of nonlocal games



Cites Work


This page was built for publication: THE SET OF QUANTUM CORRELATIONS IS NOT CLOSED