523 search results - page 12 / 105 » On the Power of Quantum Proofs |
STOC
2000
ACM
2000
ACM
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
15 years 3 months ago
COCO
2008
Springer
15 years 1 months ago
2008
Springer
105
click to vote
COCO
2001
Springer
15 years 4 months ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
118
click to vote
TOC
2010
14 years 6 months ago
2010
Abstract: We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of the adversary method, by analyzing the eigenspace structur...
IANDC
2006
14 years 11 months ago
2006
A finitary axiomatization for EQPL (exogenous quantum propositional logic) is presented. The axiomatization is shown to be weakly complete relative to an oracle for analytical rea...