On the Power of Quantum,One Round,Two Prover Interactive Proof Systems |
| |
| Authors: | Alex Rapaport Amnon Ta-Shma |
| |
| Affiliation: | (1) Department of Computer Science, Tel-Aviv University, Tel Aviv, 69978, Israel |
| |
| Abstract: | We analyze quantum two prover one round interactive proof systems, in which noninteracting provers can share unlimited entanglement. The maximum acceptance probability is characterized as a superoperator norm. We get some partial results and in particular we analyze the “rank one” case. |
| |
| Keywords: | quantum interactive proofs non-local games diamond norm product norm |
| 本文献已被 SpringerLink 等数据库收录！ |
