26 citations · 43 across the 3 of their papers we have counts for
Showing quant-phShow all
2 papers · 1 filter
quant-ph2009
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…
quant-ph2006★ 26 cited
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…