Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On Quantum Versions of the Yao Principle   The classical Yao principle states that the complexity R_epsilon(f) of an
optimal randomized algorithm for a function f with success probability
1-epsilon equals the complexity max_mu D_epsilon^mu(f) of an optimal
deterministic algorithm for f that is correct on a fraction 1-epsilon of the
inputs, weighed according to the hardest distribution mu over the inputs. In
this paper we investigate to what extent such a principle holds for quantum
algorithms. We propose two natural candidate quantum Yao principles, a ``weak''
and a ``strong'' one. For both principles, we prove that the quantum
bounded-error complexity is a lower bound on the quantum analogues of max mu
D_epsilon^mu(f). We then prove that equality cannot be obtained for the
``strong'' version, by exhibiting an exponential gap. On the other hand, as a
positive result we prove that the ``weak'' version holds up to a constant
factor for the query complexity of all symmetric Boolean functions

36
The categories of this paper are: cmp-lg
14
The categories of this paper are: math-ph
0
The categories of this paper are: hep-ph
29
The categories of this paper are: funct-an
2
The categories of this paper are: math
30
The categories of this paper are: q-alg
22
The categories of this paper are: chao-dyn
5
The categories of this paper are: gr-qc
21
The categories of this paper are: adap-org
8
The categories of this paper are: hep-ex
19
The categories of this paper are: eess
20
The categories of this paper are: acc-phys
17
The categories of this paper are: q-fin
37
The categories of this paper are: supr-con
28
The categories of this paper are: alg-geom
35
The categories of this paper are: mtrl-th