@article{afb9438d97354dacb3ca52056f728282,
title = "On the power of quantum, one round, two prover interactive proof systems",
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 = "Diamond norm, Non-local games, Product norm., Quantum interactive proofs",
author = "Alex Rapaport and Amnon Ta-Shma",
note = "Funding Information: We thank Julia Kempe, Ashwin Nayak and Oded Regev for interesting discussions on the subject. We thank Zeph Landau for helping us prove Lemma 1, Ashwin Nayak for an alternative proof and Oded Re-gev for providing us with the reference(9) where the Lemma is proved. We thank the anonymous referee for communicating Claim 2 to us and for other helpful comments. This research was supported by USA-Israel BSF grant 2004390 and by the EU integrated project QAP.",
year = "2007",
month = dec,
doi = "10.1007/s11128-007-0068-z",
language = "אנגלית",
volume = "6",
pages = "445--459",
journal = "Quantum Information Processing",
issn = "1570-0755",
publisher = "Springer New York",
number = "6",
}