61 citations · 215 across the 16 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
quant-ph2018
Algorithms, Bounds, and Strategies for Entangled XOR Games
Adam Bene Watts, Aram W. Harrow, Gurtej Kanwar +1
We study the complexity of computing the commuting-operator value of entangled XOR games with any number of players. We introduce necessary and sufficient criteria for an XOR…
quant-ph2018★ 39 cited
Low-degree testing for quantum states, and a quantum entangled games PCP for QMA
Anand Natarajan, Thomas Vidick
We show that given an explicit description of a multiplayer game, with a classical verifier and a constant number of players, it is QMA-hard, under randomized reductions, to distin…