Entanglement in Non-local Games and the Hyperlinear Profile of Groups

Creators: Slofstra, William; Vidick, Thomas

Abstract

We relate the amount of entanglement required to play linear system non-local games near-optimally to the hyperlinear profile of finitely presented groups. By calculating the hyperlinear profile of a certain group, we give an example of a finite non-local game for which the amount of entanglement required to play ϵ-optimally is at least Ω(1/ϵ^k), f or some k > 0. Since this function approaches infinity as ϵ approaches zero, this provides a quantitative version of a theorem of the first author.

Additional Information

© 2018 Springer Nature Switzerland AG. Received: 30 November 2017; Accepted: 10 June 2018; First Online: 02 August 2018. As mentioned in Introduction, we are grateful to Narutaka Ozawa for suggesting the use of the Connes embedding trick and the beautiful line of argument now incorporated in Sect. 5; this led to a substantial improvement in our results. The first author also thanks Martino Lupini for helpful discussions. The second author is supported by NSF CAREER Grant CCF-1553477, AFOSR YIP Award Number FA9550-16-1-0495, a CIFAR Azrieli Global Scholar award, and the IQIM, an NSF Physics Frontiers Center (NSF Grant PHY-1125565) with support of the Gordon and Betty Moore Foundation (GBMF-12500028).

Attached Files

Submitted - 1711.10676.pdf

Files

1711.10676.pdf

Files (331.3 kB)

Name	Size	Download all
1711.10676.pdf md5:bc2c53cfdf30fe7a503843d5ccbd8c0d	331.3 kB	Preview Download

Additional details

	All versions	This version
Views	0	0
Downloads	0	0
Data volume	0 Bytes	0 Bytes