Non-closure of the set of quantum correlations via graphs

DOI10.1007/s00220-019-03301-1zbMath1408.81008arXiv1709.05032OpenAlexW2964260944MaRDI QIDQ1729889

Jitendra Prakash, Vern I. Paulsen, Kenneth J. Dykema

Publication date: 28 February 2019

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

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

Mathematics Subject Classification ID

Applications of graph theory (05C90) Quantum computation (81P68) Quantum coherence, entanglement, quantum correlations (81P40)

Related Items (21)

The quantum-to-classical graph homomorphism game ⋮ Quantum Teleportation and Super-Dense Coding in Operator Algebras ⋮ Bipartite matrix-valued tensor product correlations that are not finitely representable ⋮ Non-closure of quantum correlation matrices and factorizable channels that require infinite dimensional ancilla (With an appendix by Narutaka Ozawa) ⋮ Bigalois extensions and the graph isomorphism game ⋮ Quantum teleportation in the commuting operator framework ⋮ 3XOR games with perfect commuting operator strategies have perfect tensor product strategies and are decidable in polynomial time ⋮ Approximate completely positive semidefinite factorizations and their ranks ⋮ Products of synchronous games ⋮ Quantum symmetries of quantum metric spaces and non-local games ⋮ A Characterization of Perfect Strategies for Mirror Games ⋮ State convertibility in the von Neumann algebra framework ⋮ \(\mathrm{MIP}^* = \mathrm{RE}\): a negative resolution to Connes' embedding problem and Tsirelson's problem ⋮ Exact values of quantum violations in low-dimensional Bell correlation inequalities ⋮ Quantum hypergraph homomorphisms and non-local games ⋮ Geometry of the set of synchronous quantum correlations ⋮ Correlation matrices, Clifford algebras, and completely positive semidefinite rank ⋮ Tsirelson’s problem and an embedding theorem for groups arising from non-local games ⋮ Lower bounds on matrix factorization ranks via noncommutative polynomial optimization ⋮ Synchronicity for quantum non-local games ⋮ Classical vs quantum satisfiability in linear constraint systems modulo an integer

Cites Work

• Unnamed Item
• Quantum homomorphisms
• About the Connes embedding conjecture
• Brownian local minima, random dense countable sets and random equivalence classes
• Synchronous correlation matrices and Connes’ embedding conjecture
• TSIRELSON'S PROBLEM AND KIRCHBERG'S CONJECTURE
• THE SET OF QUANTUM CORRELATIONS IS NOT CLOSED
• A synchronous game for binary constraint systems
• Connes' embedding problem and Tsirelson's problem
• QUANTUM CHROMATIC NUMBERS VIA OPERATOR SYSTEMS
• On sums of projections
• Estimating quantum chromatic numbers

This page was built for publication: Non-closure of the set of quantum correlations via graphs