Quick Navigation
Topics
Open Quantum Systems Decoherence
Entanglement Theory Quantum Correlations
On the power of quantum, one round, two prover interactive proof systems
arXiv
Authors: Alex Rapaport, Amnon Ta-Shma
Year
2007
Paper ID
49731
Status
Preprint
Abstract Read
~2 min
Abstract Words
46
Citations
N/A
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.
Why This Paper Matters
- This paper contributes to the Entanglement Theory & Quantum Correlations research area in the Quantum Articles archive.
- It adds a 2007 reference point for readers tracking recent quantum research.
- We analyze quantum two prover one round interactive proof systems, in which noninteracting provers can share unlimited entanglement.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.