Sciweavers

3 search results - page 1 / 1
» Two-Message Quantum Interactive Proofs Are in PSPACE
Sort
View
FOCS
2009
IEEE
13 years 11 months ago
Two-Message Quantum Interactive Proofs Are in PSPACE
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 pa...
Rahul Jain, Sarvagya Upadhyay, John Watrous
FOCS
1999
IEEE
13 years 9 months ago
PSPACE Has Constant-Round Quantum Interactive Proof Systems
In this paper we introduce quantum interactive proof systems, which are interactive proof systems in which the prover and verifier may perform quantum computations and exchange qu...
John Watrous
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
14 years 2 months ago
QIP = PSPACE
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay and Jo...