Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Claw Finding Algorithms Using Quantum Walk   The claw finding problem has been studied in terms of query complexity as one
of the problems closely connected to cryptography. For given two functions, f
and g, as an oracle which have domains of size N and M (N<=M), respectively,
and the same range, the goal of the problem is to find x and y such that
f(x)=g(y). This paper describes an optimal algorithm using quantum walk that
solves this problem. Our algorithm can be generalized to find a claw of k
functions for any constant integer k>1, where the domains of the functions may
have different size.

35
The categories of this paper are: mtrl-th
30
The categories of this paper are: q-alg
5
The categories of this paper are: gr-qc
24
The categories of this paper are: dg-ga
4
The categories of this paper are: cond-mat
9
The categories of this paper are: nlin
3
The categories of this paper are: physics
19
The categories of this paper are: eess
28
The categories of this paper are: alg-geom
27
The categories of this paper are: comp-gas
6
The categories of this paper are: astro-ph
12
The categories of this paper are: nucl-th
26
The categories of this paper are: bayes-an
11
The categories of this paper are: hep-lat
37
The categories of this paper are: supr-con
22
The categories of this paper are: chao-dyn