Sciweavers

523 search results - page 1 / 105
» On the Power of Quantum Proofs
Sort
View
COCO
2005
Springer
141views Algorithms» more  COCO 2005»
13 years 10 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
CORR
2011
Springer
153views Education» more  CORR 2011»
12 years 11 months ago
A short proof of the Quantum Substate Theorem
The Quantum Substate Theorem due to Jain, Radhakrishnan, and Sen [7] gives us a powerful operational interpretation of the observational divergence of two quantum states, a quanti...
Rahul Jain, Ashwin Nayak
FOCS
1999
IEEE
13 years 8 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
2004
Springer
82views Algorithms» more  COCO 2004»
13 years 10 months ago
On the Power of Quantum Proofs
We study the power of quantum proofs, or more precisely, the power of Quantum MerlinArthur (QMA) protocols, in two well studied models of quantum computation: the black box model ...
Ran Raz, Amir Shpilka
ISAAC
2003
Springer
91views Algorithms» more  ISAAC 2003»
13 years 9 months ago
Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?
This paper introduces quantum “multiple-Merlin”-Arthur proof systems in which Arthur receives multiple quantum proofs that are unentangled with each other. Although classical ...
Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yama...