Computer Science – Computational Complexity
Scientific paper
2009-05-08
Computer Science
Computational Complexity
24 pages
Scientific paper
We prove that QIP(2), the class of problems having two-message quantum
interactive proof systems, is a subset of PSPACE. This relationship is obtained
by means of an efficient parallel algorithm, based on the multiplicative
weights update method, for approximately solving a certain class of
semidefinite programs.
Jain Rahul
Upadhyay Sarvagya
Watrous John
No associations
LandOfFree
Two-message quantum interactive proofs are in PSPACE does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Two-message quantum interactive proofs are in PSPACE, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two-message quantum interactive proofs are in PSPACE will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-704035