Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: An Improved Quantum Scheduling Algorithm   The scheduling problem consists of finding a common 1 in two remotely located
N bit strings. Denote the number of 1s in the string with the fewer 1s by
epsilon*N. Classically, it needs at least O(epsilon*N) bits of communication to
find the common 1 (ignoring logarithmic factors). The best known quantum
algorithm would require O(sqrt(N)) qubits of communication. This paper gives a
modified quantum algorithm to find the common 1 with only O(sqrt(epsilon*N))
qubits of communication.

4
The categories of this paper are: cond-mat
19
The categories of this paper are: eess
24
The categories of this paper are: dg-ga
2
The categories of this paper are: math
33
The categories of this paper are: plasm-ph
17
The categories of this paper are: q-fin
34
The categories of this paper are: chem-ph
6
The categories of this paper are: astro-ph
20
The categories of this paper are: acc-phys
23
The categories of this paper are: solv-int
32
The categories of this paper are: atom-ph
14
The categories of this paper are: math-ph
16
The categories of this paper are: stat
35
The categories of this paper are: mtrl-th
18
The categories of this paper are: econ
12
The categories of this paper are: nucl-th