On the power of quantum, one round, two prover interactive proof systems
Quantum Physics
2007-07-10 v1
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 about the superoperator norm, and in particular we analyze the "rank one" case.
Keywords
Cite
@article{arxiv.0707.1136,
title = {On the power of quantum, one round, two prover interactive proof systems},
author = {Alex Rapaport and Amnon Ta-Shma},
journal= {arXiv preprint arXiv:0707.1136},
year = {2007}
}
Comments
12 pages, no figures