On the power of quantum, one round, two prover interactive proof systems

Alex Rapaport, Amnon Ta-Shma

We analyze quantum two prover one round interactive proof systems, in which noninteracting provers can share unlimited entanglement. The maximum acceptance probability is character…