Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Quantum algorithms which accept hot qubit inputs   Realistic physical implementations of quantum computers can entail tradeoffs
which depart from the ideal model of quantum computation. Although these
tradeoffs have allowed successful demonstration of certain quantum algorithms,
a crucial question is whether they fundamentally limit the computational
capacity of such machines. We study the limitations of a quantum computation
model in which only ensemble averages of measurement observables are
accessible. Furthermore, we stipulate that input qubits may only be prepared in
highly random, ``hot'' mixed states. In general, these limitations are believed
to dramatically detract from the computational power of the system. However, we
construct a class of algorithms for this limited model, which, surprisingly,
are polynomially equivalent to the ideal case. This class includes the well
known Deutsch-Jozsa algorithm.

15
The categories of this paper are: nucl-ex
20
The categories of this paper are: acc-phys
8
The categories of this paper are: hep-ex
0
The categories of this paper are: hep-ph
21
The categories of this paper are: adap-org
2
The categories of this paper are: math
14
The categories of this paper are: math-ph
28
The categories of this paper are: alg-geom
4
The categories of this paper are: cond-mat
32
The categories of this paper are: atom-ph
16
The categories of this paper are: stat
36
The categories of this paper are: cmp-lg
10
The categories of this paper are: q-bio
27
The categories of this paper are: comp-gas
23
The categories of this paper are: solv-int
17
The categories of this paper are: q-fin