arXiv · 0707.1136
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 about the superoperator norm, and in particular we analyze the "rank one" case.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Alex Rapaport, Amnon Ta-Shma. 2007-07-08. On the power of quantum, one round, two prover interactive proof systems. https://arxiv.org/abs/0707.1136
Cite the original work for its findings. Save a collection to share your selection of sources.