On the power of quantum, one round, two prover interactive proof systems
Alex Rapaport, Amnon Ta-Shma
TL;DR
This paper investigates quantum two-prover one-round interactive proof systems with unlimited entanglement, characterizing their maximum acceptance probability through superoperator norms and analyzing specific cases like rank one.
Contribution
It provides a characterization of the acceptance probability using superoperator norms and explores particular cases such as the rank one scenario.
Findings
Acceptance probability characterized by superoperator norm
Partial results on superoperator norm analysis
Analysis of the rank one case
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Complexity and Algorithms in Graphs · Computability, Logic, AI Algorithms