On the power of quantum, one round, two prover interactive proof systems
classification
🪐 quant-ph
keywords
analyzeinteractivenormproofproverquantumroundsuperoperator
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.