Differences
This shows you the differences between two versions of the page.
Next revision | Previous revision |
hyperlinear [2020/08/28 15:50] – created admin | hyperlinear [2020/08/28 15:54] (current) – admin |
---|
A positive resolution to Connes' embedding problem would've [[https://arxiv.org/pdf/1309.2034.pdf|implied]] that all countable discrete groups are hyperlinear. Since MIP*=RE gives a negative answer to CEP, this leaves open the possibility that there are non-hyperlinear groups. | A positive resolution to Connes' embedding problem would've [[https://arxiv.org/pdf/1309.2034.pdf|implied]] that all countable discrete groups are hyperlinear. Since MIP*=RE gives a negative answer to CEP, this leaves open the possibility that there are non-hyperlinear groups. |
| |
One approach to this is to create a *linear constraint system* (LCS) game G whose commuting | One [[https://simons.berkeley.edu/sites/default/files/docs/15568/williamslofstraslides-quantumprotocols.pdf|approach]] to this is to create a linear constraint system (LCS) game $G$ whose commuting operator value $\omega^{co}(G)$ is different from its tensor product value $\omega^*(G)$. |
| |
| Thus, can the separating nonlocal game constructed in the MIP*=RE paper be formulated as a linear constraint system game? |