The study of quantum correlation sets initiated by Tsirelson in the 1980s and originally motivated by questions in the foundations of quantum mechanics has more recently been tied to questions in quantum cryptography, complexity theory, operator space theory, group theory, and more. Synchronous correlation sets introduced by Paulsen et al. [J. Funct. Anal. 270, 2188–2222 (2016)] are a subclass of correlations that has proven particularly useful to study and arises naturally in applications. We show that any correlation that is almost synchronous, in a natural 1 sense, arises from a state and measurement operators that are well-approximated by a convex combination of projective measurements on a maximally entangled state. This extends a result of Paulsen et al. [J. Funct. Anal. 270, 2188–2222 (2016)] that applies to exactly synchronous correlations. Crucially, the quality of approximation is independent of the dimension of the Hilbert spaces or of the size of the correlation. Our result allows one to reduce the analysis of many classes of nonlocal games, including rigidity properties, to the case of strategies using maximally entangled states that are generally easier to manipulate.

1.
W.
Slofstra
, “
The set of quantum correlations is not closed
,”
Forum Math. Pi
7
,
E1
(
2019
).
2.
J. S.
Bell
, “
On the Einstein Podolsky Rosen paradox
,”
Phys. Phys. Fiz.
1
(
3
),
195
(
1964
).
3.
N.
Brunner
,
D.
Cavalcanti
,
S.
Pironio
,
V.
Scarani
, and
S.
Wehner
, “
Bell nonlocality
,”
Rev. Mod. Phys.
86
(
2
),
419
(
2014
).
4.
B. S.
Tsirelson
, “
Some results and problems on quantum Bell-type inequalities
,”
Hadronic J. Suppl.
8
(
4
),
329
345
(
1993
).
5.
T.
Fritz
, “
Tsirelson’s problem and Kirchberg’s conjecture
,”
Rev. Math. Phys.
24
(
05
),
1250012
(
2012
).
6.
M.
Junge
,
M.
Navascues
,
C.
Palazuelos
,
D.
Perez-Garcia
,
V. B.
Scholz
, and
R. F.
Werner
, “
Connes’ embedding problem and Tsirelson’s problem
,”
J. Math. Phys.
52
(
1
),
012102
(
2011
).
7.
W.
Slofstra
and
T.
Vidick
, “
Entanglement in non-local games and the hyperlinear profile of groups
,”
Ann. Henri Poincare
19
,
2979
3005
(
2018
).
8.
L.
Mančinska
and
D. E.
Roberson
, “
Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs
,” in
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)
(
IEEE
,
2020
), pp.
661
672
.
9.
V. I.
Paulsen
,
S.
Severini
,
D.
Stahlke
,
I. G.
Todorov
, and
A.
Winter
, “
Estimating quantum chromatic numbers
,”
J. Funct. Anal.
270
(
6
),
2188
2222
(
2016
).
10.
L.
Mančinska
and
D.
Roberson
, “
Graph homomorphisms for quantum players
,” in
9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)
(
Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik
,
2014
).
11.
R.
Cleve
and
R.
Mittal
, “
Characterization of binary constraint system games
,” in
International Colloquium on Automata, Languages, and Programming
(
Springer
,
2014
), pp.
320
331
.
12.
S.-J.
Kim
,
V.
Paulsen
, and
C.
Schafhauser
, “
A synchronous game for binary constraint systems
,”
J. Math. Phys.
59
(
3
),
032201
(
2018
).
13.
T.
Vidick
and
S.
Wehner
, “
More nonlocality with less entanglement
,”
Phys. Rev. A
83
(
5
),
052310
(
2011
).
14.
Z.
Ji
,
A.
Natarajan
,
T.
Vidick
,
J.
Wright
, and
H.
Yuen
, “
Quantum soundness of the classical low individual degree test
,”
Quantum
6
,
614
(
2022
).
15.
Z.
Ji
,
A.
Natarajan
,
T.
Vidick
,
J.
Wright
, and
H.
Yuen
, “
MIP* = RE
,” arXiv:2001.04383 (
2020
).
16.
L.
Mančinska
,
J.
Prakash
, and
C.
Schafhauser
, “
Constant-sized robust self-tests for states and measurements of unbounded dimension
,” arXiv:2103.01729 (
2021
).
17.
A.
Connes
, “
Classification of injective factors cases II1, II, IIIλ, λ ≠ 1
,”
Ann. Math.
104
,
73
115
(
1976
).
18.
J.
Kempe
and
T.
Vidick
, “
Parallel repetition of entangled games
,” in
Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing
(
ACM
,
2011
), pp.
353
362
.
19.
A.
Coladangelo
,
A. B.
Grilo
,
S.
Jeffery
, and
T.
Vidick
, “
Verifier-on-a-leash: New schemes for verifiable delegated quantum computation, with quasilinear resources
,” in
Annual International Conference on the Theory and Applications of Cryptographic Techniques
(
Springer
,
2019
), pp.
247
277
.
20.
A.
Coladangelo
and
J.
Stark
, “
Robust self-testing for linear constraint system games
,” arXiv:1709.09267 (
2017
).
21.
L.
Mančinska
, “
Maximally entangled state in pseudo-telepathy games
,” in
Computing with New Resources
(
Springer
,
2014
), pp.
200
207
.
22.

In fact, for this game, c is only inverse polynomial in m, which still suffices, given the form of κ.

You do not currently have access to this content.