In the work of Paulsen et al. [J. Funct. Anal. (in press); preprint arXiv:1407.6918], 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.

1.
Avis
,
D.
,
Hagesawa
,
J.
,
Kikuchi
,
Y.
, and
Sasaki
,
Y.
, “
A quantum protocol to win the graph coloring game on all hadamard graphs
,”
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
E89-A
(
5
),
1378
1381
(
2006
).
2.
Cameron
,
P. J.
,
Newman
,
M. W.
,
Montanaro
,
A.
,
Severini
,
S.
, and
Winter
,
A.
, “
On the quantum chromatic number of a graph
,”
Electron. J. Comb.
14
,
R81
(
2007
).
3.
Connes
,
A.
, “
Classification of injective factors. Cases II1, II, IIIλ, λ ≠ 1
,”
Ann. Math.
104
,
73
115
(
1976
).
4.
Dykema
,
K.
and
Juschenko
,
K.
, “
Matrices of unitary moments
,”
Math. Scand.
109
,
225
239
(
2011
).
5.
Farenick
,
D.
,
Kavruk
,
A. S.
,
Paulsen
,
V. I.
, and
Todorov
,
I. G.
, “
Operator systems from discrete groups
,”
Commun. Math. Phys.
329
,
207
238
(
2014
).
6.
Fritz
,
T.
, “
Tsirelson’s problem and Kirchberg’s conjecture
,”
Rev. Math. Phys.
24
(
5
),
1250012
(
2012
).
7.
Galliard
,
V.
and
Wolf
,
S.
, “
Pseudo-telepathy, entanglement, and graph colorings
,” in
Proceedings of IEEE International Symposium on Information Theory (ISIT)
(
2002
) p.
101
.
8.
Junge
,
M.
,
Navascues
,
M.
,
Palazuelos
,
C.
,
Perez-Garcia
,
D.
,
Scholtz
,
V. B.
, and
Werner
,
R. F.
, “
Connes’ embedding problem and Tsirelson’s problem
,”
J. Math. Phys.
52
,
012102
(
2011
).
9.
Kirchberg
,
E.
, “
On non–semisplit extenstions, tensor products and exactness of group C–algebras
,”
Invent. Math.
112
,
449
489
(
1993
).
10.
Ozawa
,
N.
, “
About the Connes embedding conjecture: Algebraic approaches
,”
Jpn. J. Math.
8
,
147
183
(
2013
).
11.
Paulsen
,
V. I.
and
Todorov
,
I. G.
, “
Quantum chromatic numbers via operator systems
,”
Q. J. Math.
66
,
677
692
(
2015
).
12.
Paulsen
,
V. I.
,
Severini
,
S.
,
Stahlke
,
D.
, and
Winter
,
A.
, “
Estimating quantum chromatic numbers
,”
J. Funct. Anal.
(in press); preprint arXiv:1407.6918.
13.
Raeburn
,
I.
and
Sinclair
,
A.
, “
The C-algebra generated by two projections
,”
Math. Scand.
65
,
278
290
(
1989
).
14.
Roberson
,
D. E.
and
Mančinska
,
L.
, “
Graph homomorphisms for quantum players
,” in
Leibnitz International Proceedings in Informatics
,
Singapore
,
2014
.
9th Conference on the Theory of Quantum Computation, Communication and Cryptography
(
Schloss Dagstuhl Leibniz-Zentrum fur Informatik GmbH
,
Saabrucken
,
2014
), Vol.
27
, pp.
212
216
.
15.
Scarpa
,
G.
and
Severini
,
S.
, “
Kochen-Specker sets and the rank-1 quantum chromatic number
,”
IEEE Trans. Inf. Theory
58
(
4
),
2524
2529
(
2012
).
16.
Scholz
,
V. B.
and
Werner
,
R. F.
, “
Tsirelson’s problem
,” preprint arXiv:0812.4305.
17.
Voiculescu
,
D.
, “
The analogues of entropy and of Fisher’s information measure in free probability theory. II
,”
Invent. Math.
118
,
411
440
(
1994
).
18.
Voiculescu
,
D.
, “
Free entropy
,”
Bull. London Math. Soc.
34
,
257
278
(
2002
).
You do not currently have access to this content.