Sciweavers

3 search results - page 1 / 1
» QIP = PSPACE
Sort
View
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...
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
CORR
2010
Springer
93views Education» more  CORR 2010»
13 years 4 months ago
Parallelized Solution to Semidefinite Programmings in Quantum Complexity Theory
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis [K...
Xiaodi Wu