6 search results - page 1 / 2 » PSPACE Has Constant-Round Quantum Interactive Proof Systems |
FOCS
1999
IEEE
13 years 10 months ago
1999
IEEE
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...
FOCS
2009
IEEE
14 years 11 days ago
2009
IEEE
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...
STOC
2010
ACM
14 years 3 months ago
2010
ACM
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...
STACS
2005
Springer
13 years 11 months ago
2005
Springer
This paper studies quantum refereed games, which are quantum interactive proof systems with two competing provers: one that tries to convince the verifier to accept and the other...
FOCS
1990
IEEE
13 years 9 months ago
1990
IEEE
A new algebraic technique for the construction of interactive proof systems is presented. Our technique is used to prove that every language in the polynomial-time hierarchy has an...