Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Characterization of exact one-query quantum algorithms   The quantum query models is one of the most important models in quantum
computing. Several well-known quantum algorithms are captured by this model,
including the Deutsch-Jozsa algorithm, the Simon algorithm, the Grover
algorithm and others. In this paper, we characterize the computational power of
exact one-query quantum algorithms. It is proved that a total Boolean function
$f:\{0,1\}^n \rightarrow \{0,1\}$ can be exactly computed by a one-query
quantum algorithm if and only if $f(x)=x_{i_1}$ or ${x_{i_1} \oplus x_{i_2} }$
(up to isomorphism). Note that unlike most work in the literature based on the
polynomial method, our proof does not resort to any knowledge about the
polynomial degree of $f$.

4
The categories of this paper are: cond-mat
34
The categories of this paper are: chem-ph
30
The categories of this paper are: q-alg
23
The categories of this paper are: solv-int
8
The categories of this paper are: hep-ex
9
The categories of this paper are: nlin
0
The categories of this paper are: hep-ph
15
The categories of this paper are: nucl-ex
5
The categories of this paper are: gr-qc
36
The categories of this paper are: cmp-lg
10
The categories of this paper are: q-bio
24
The categories of this paper are: dg-ga
7
The categories of this paper are: hep-th
37
The categories of this paper are: supr-con
35
The categories of this paper are: mtrl-th
22
The categories of this paper are: chao-dyn