Synchronous correlation matrices and Connes' embedding conjecture

DOI10.1063/1.4936751MaRDI QIDQ2786619zbMATH OpenOpenAlexWikidataFDO

Authors Vern I. Paulsen, Ken Dykema

Publication date 15 February 2016

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

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) General theory of (C^*)-algebras (46L05) Operator spaces and completely bounded maps (46L07) Applications of selfadjoint operator algebras to physics (46L60) General and philosophical questions in quantum theory (81P05)

Abstract: In a recent paper, the concept of synchronous quantum correlation matrices was introduced and these were shown to correspond to traces on certain C*-algebras. In particular, synchronous correlation matrices arose in their study of various versions of quantum chromatic numbers of graphs and other quantum versions of graph theoretic parameters. In this paper we develop these ideas further, focusing on the relations between synchronous correlation matrices and microstates. We prove that Connes' embedding conjecture is equivalent to the equality of two families of synchronous quantum correlation matrices. We prove that if Connes' embedding conjecture has a positive answer, then the tracial rank and projective rank are equal for every graph. We then apply these results to more general non-local games.

Recommendations

• A synchronous game for binary constraint systems
• Connes' embedding problem and Tsirelson's problem
• The correlation numerical range of a matrix and Connes' embedding problem
• Tsirelson's problem and asymptotically commuting unitary matrices
• Synchronicity for quantum non-local games

Cites work

• About the Connes embedding conjecture
• Classification of injective factors. Cases \(\mathrm{II}_1\), \(\mathrm{II}_\infty\), \(\mathrm{III}_\lambda\), \(\lambda\neq 1\)
• Connes' embedding problem and Tsirelson's problem
• Estimating quantum chromatic numbers
• FREE ENTROPY
• Graph homomorphisms for quantum players
• Kochen–Specker Sets and the Rank-1 Quantum Chromatic Number
• Matrices of unitary moments
• On non-semisplit extensions, tensor products and exactness of group C^*-algebras
• On the quantum chromatic number of a graph
• Operator systems from discrete groups
• Quantum chromatic numbers via operator systems
• The C^*-algebra generated by two projections.
• The analogues of entropy and of Fisher's information measure in free probability theory. II
• Tsirelson's problem and Kirchberg's conjecture

Cited in

(18)

• Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
• Non-closure of the set of quantum correlations via graphs
• Additivity violation of the regularized minimum output entropy
• Bisynchronous games and factorizable maps
• Connectivity for quantum graphs
• Quantum graph homomorphisms via operator systems
• Geometry of the set of synchronous quantum correlations
• The correlation numerical range of a matrix and Connes' embedding problem
• The set of quantum correlations is not closed
• A synchronous game for binary constraint systems
• Almost synchronous quantum correlations
• Linear conic formulations for two-party correlations and values of nonlocal games
• Tsirelson's problem and an embedding theorem for groups arising from non-local games
• The Synchronizing Probability Function for Primitive Sets of Matrices
• A synchronous NPA hierarchy with applications
• Quantum hypergraph homomorphisms and non-local games
• Unique games and games based on groups
• Rounding near-optimal quantum strategies for nonlocal games to strategies using a maximally entangled state

This page was built for publication: Synchronous correlation matrices and Connes' embedding conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2786619)