10 citations · 11 across the 2 of their papers we have counts for
3 papers · 1 filter
Using Entanglement in Quantum Multi-Prover Interactive Proofs
Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto +1
The central question in quantum multi-prover interactive proof systems is whether or not entanglement shared between provers affects the verification power of the proof system. We…
Entangled games are hard to approximate
Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto +2
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…
On the Power of Entangled Quantum Provers
Julia Kempe, Thomas Vidick
We show that the value of a general two-prover quantum game cannot be computed by a semi-definite program ofvpolynomial size (unless P=NP), a method that has been successful in mor…