Parallelization of entanglement-resistant multi-prover interactive proofs
We study classical multi-prover interactive proofs which are sound also against entangled provers. Such interactive proofs have been studied widely in quantum complexity theory. We prove such interactive proofs can be parallelized to two rounds by adding one prover.
interactive proof computational complexity quantum computing quantum nonlocality