Qip = Pspace

@inproceedings{Jain2010QipP,
  title={Qip = Pspace},
  author={Rahul Jain and Zheng-Feng Ji and Sarvagya Upadhyay and John Watrous},
  booktitle={STOC},
  year={2010}
}
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 parallelized form of the matrix multiplicative weights update method to a class of semidefinite programs that captures the computational power of quantum interactive proofs. As the containment of PSPACE in QIP follows immediately from the well-known equality IP = PSPACE, the equality QIP = PSPACE follows. 
Highly Cited
This paper has 102 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

102 Citations

01020'11'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 102 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…