Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Quantum subroutine problem and the robustness of quantum complexity
  classes   This paper positively solves the quantum subroutine problem for fully quantum
oracles. The quantum subroutine problem asks whether a quantum computer with an
efficiently computable oracle can be efficiently simulated by a non-oracle
quantum computer. We extends the earlier results obtained by Bennett,
Bernstein, Brassard, and Vazirani, and by Aharonov, Kitaev, and Nisan to the
case where the oracle evaluates a unitary operator and the computer is allowed
to be in the superposition of a query state and a non-query state during
computation. We also prove the robustness of {\bf EQP}, {\bf BQP}, and {\bf
ZQP} under the above general formulation, extending the earlier results on the
robustness of {\bf BQP} shown by Bennett et al.

23
The categories of this paper are: solv-int
8
The categories of this paper are: hep-ex
28
The categories of this paper are: alg-geom
0
The categories of this paper are: hep-ph
2
The categories of this paper are: math
31
The categories of this paper are: ao-sci
7
The categories of this paper are: hep-th
27
The categories of this paper are: comp-gas
35
The categories of this paper are: mtrl-th
24
The categories of this paper are: dg-ga
11
The categories of this paper are: hep-lat
10
The categories of this paper are: q-bio
9
The categories of this paper are: nlin
22
The categories of this paper are: chao-dyn
33
The categories of this paper are: plasm-ph
29
The categories of this paper are: funct-an