On the power of quantum, one round, two prover interactive proof systems

Simple item page
dc.creatorRapaport, Alex
dc.creatorTa-Shma, Amnon
dc.date2007-07-08
dc.date.accessioned2026-07-07T08:14:34Z
dc.date.available2026-07-07T08:14:34Z
dc.descriptionWe 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.
dc.description12 pages, no figures
dc.identifierhttps://arxiv.org/abs/0707.1136
dc.identifierhttp://arxiv.org/abs/0707.1136
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133166
dc.subjectQuantum Physics
dc.titleOn the power of quantum, one round, two prover interactive proof systems
dc.typetext

Files

Collections

arXiv