Two-Message Quantum Interactive Proofs Are in PSPACE

Authors:
Rahul Jain;Sarvagya Upadhyay;John Watrous
Affiliations:
-;-;-
Venue:
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Year:
2009

Citing 0
Cited 3

QIP = PSPACE

Proceedings of the forty-second ACM symposium on Theory of computing
Polynomial-space approximation of no-signaling provers

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
QIP = PSPACE

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 matrix multiplicative weights update method, for approximately solving a certain class of semidefinite programs.