23 citations · 23 across the 2 of their papers we have counts for
2 papers
quant-ph2019
Universality of EPR pairs in Entanglement-Assisted Communication Complexity, and the Communication Cost of State Conversion
Matthew Coudron, Aram W. Harrow
Entanglement assistance is known to reduce the quantum communication complexity of evaluating functions with distributed inputs. But does the type of entanglement matter, or are EP…
quant-ph2016★ 23 cited
The Parallel-Repeated Magic Square Game is Rigid
Matthew Coudron, Anand Natarajan
We show that the -round parallel repetition of the Magic Square game of Mermin and Peres is rigid, in the sense that for any entangled strategy succeeding with probability $1 -\…