Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Quantum Branching Programs and Space-Bounded Nonuniform Quantum
  Complexity   In this paper, the space complexity of nonuniform quantum computations is
investigated. The model chosen for this are quantum branching programs, which
provide a graphic description of sequential quantum algorithms. In the first
part of the paper, simulations between quantum branching programs and
nonuniform quantum Turing machines are presented which allow to transfer lower
and upper bound results between the two models. In the second part of the
paper, different variants of quantum OBDDs are compared with their
deterministic and randomized counterparts. In the third part, quantum branching
programs are considered where the performed unitary operation may depend on the
result of a previous measurement. For this model a simulation of randomized
OBDDs and exponential lower bounds are presented.

36
The categories of this paper are: cmp-lg
21
The categories of this paper are: adap-org
12
The categories of this paper are: nucl-th
11
The categories of this paper are: hep-lat
29
The categories of this paper are: funct-an
24
The categories of this paper are: dg-ga
34
The categories of this paper are: chem-ph
33
The categories of this paper are: plasm-ph
17
The categories of this paper are: q-fin
31
The categories of this paper are: ao-sci
18
The categories of this paper are: econ
3
The categories of this paper are: physics
9
The categories of this paper are: nlin
0
The categories of this paper are: hep-ph
22
The categories of this paper are: chao-dyn
7
The categories of this paper are: hep-th