26 citations · 43 across the 3 of their papers we have counts for
3 papers
QIP = PSPACE
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay +1
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 pa…
Two-message quantum interactive proofs are in PSPACE
Rahul Jain, Sarvagya Upadhyay, John Watrous
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 para…
Strong Parallel Repetition Theorem for Quantum XOR Proof Systems
Richard Cleve, William Slofstra, Falk Unger +1
We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier's verdict is a function of the XOR of the two bi…