Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Multi-prover interactive proofs: how to remove intractability assumptions
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Fully parallelized multi prover protocols for NEXP-time (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Two-prover one-round proof systems: their power and their problems (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Quantum computation and quantum information
Quantum computation and quantum information
PSPACE Has Constant-Round Quantum Interactive Proof Systems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Quantum multi-prover interactive proof systems with limited prior entanglement
Journal of Computer and System Sciences
Error reduction by parallel repetition-the state of the art
Error reduction by parallel repetition-the state of the art
Consequences and Limits of Nonlocal Strategies
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Quantum Information and the PCP Theorem
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Implausible consequences of superstrong nonlocality
Natural Computing: an international journal
Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems
Computational Complexity
A lower bound on the value of entangled binary games
Quantum Information & Computation
Properties of local quantum operations with shared entanglement
Quantum Information & Computation
Quantum interactive proofs with weak error bounds
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
| Hi-index | 0.00 |
If two classical provers share an entangled state, the resulting interactive proof system is significantly weakened [6]. We show that for the case where the verifier computes the XOR of two binary answers, the resulting proof system is in fact no more powerful than a system based on a single quantum prover: $\rm \bigoplus MIP^*[2] \subseteq QIP(2)$. This also implies that $\rm \bigoplus MIP^*[2] \subseteq EXP$ which was previously shown using a different method [7]. This contrasts with an interactive proof system where the two provers do not share entanglement. In that case, $\rm \bigoplus MIP[2] = NEXP$ for certain soundness and completeness parameters[6].