Entangled Games Are Hard to Approximate
Work
Year: 2011
Type: article
Abstract: We establish the first hardness results for the problem of computing the value of one-round games played by a verifier and a team of provers who can share quantum entanglement. In particular, we show ... more
Source: SIAM Journal on Computing
Cites: 25
Cited by: 51
Related to: 10
FWCI: 4.98
Citation percentile (by year/subfield): 97.11
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green