Sciweavers

FOCS
1999
IEEE
14 years 3 months ago
PSPACE Has Constant-Round Quantum Interactive Proof Systems
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...
John Watrous
COCO
2005
Springer
141views Algorithms» more  COCO 2005»
14 years 5 months ago
Upper Bounds for Quantum Interactive Proofs with Competing Provers
Refereed games are interactive proof systems with two competing provers: one that tries to convince the verifier to accept and another that tries to convince the verifier to rej...
Gus Gutoski