Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Reachability Deficits in Quantum Approximate Optimization of Graph
  Problems   The quantum approximate optimization algorithm (QAOA) has become a
cornerstone of contemporary quantum applications development. Here we show that
the \emph{density} of problem constraints versus problem variables acts as a
performance indicator. Density is found to correlate strongly with
approximation inefficiency for fixed depth QAOA applied to random graph
minimization problem instances. Further, the required depth for accurate QAOA
solution to graph problem instances scales critically with density. Motivated
by Google's recent experimental realization of QAOA, we preform a reanalysis of
the reported data reproduced in an ideal noiseless setting. We found that the
reported capabilities of instances addressed experimentally by Google, approach
a rapid fall-off region in approximation quality experienced beyond
intermediate-density. Our findings offer new insight into performance analysis
of contemporary quantum optimization algorithms and contradict recent
speculation regarding low-depth QAOA performance benefits.

34
The categories of this paper are: chem-ph
24
The categories of this paper are: dg-ga
35
The categories of this paper are: mtrl-th
30
The categories of this paper are: q-alg
32
The categories of this paper are: atom-ph
29
The categories of this paper are: funct-an
31
The categories of this paper are: ao-sci
37
The categories of this paper are: supr-con
15
The categories of this paper are: nucl-ex
0
The categories of this paper are: hep-ph
33
The categories of this paper are: plasm-ph
10
The categories of this paper are: q-bio
28
The categories of this paper are: alg-geom
4
The categories of this paper are: cond-mat
2
The categories of this paper are: math
18
The categories of this paper are: econ