Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Polynomial scaling of QAOA for ground-state preparation of the
  fully-connected p-spin ferromagnet   We show that the quantum approximate optimization algorithm (QAOA) can
construct with polynomially scaling resources the ground state of the
fully-connected p-spin Ising ferromagnet, a problem that notoriously poses
severe difficulties to a Quantum Annealing (QA) approach, due to the
exponentially small gaps encountered at first-order phase transition for ${\rm
p} \ge 3$. For a target ground state at arbitrary transverse field, we find
that an appropriate QAOA parameter initialization is necessary to achieve a
good performance of the algorithm when the number of variational parameters
$2{\rm P}$ is much smaller than the system size ${\rm N}$, because of the large
number of sub-optimal local minima. Instead, when ${\rm P}$ exceeds a critical
value ${\rm P}^*_{\rm N} \propto {\rm N}$, the structure of the parameter space
simplifies, as all minima become degenerate. This allows to achieve the ground
state with perfect fidelity with a number of parameters scaling extensively
with ${\rm N}$, and with resources scaling polynomially with ${\rm N}$.

1
The categories of this paper are: cs
21
The categories of this paper are: adap-org
29
The categories of this paper are: funct-an
36
The categories of this paper are: cmp-lg
15
The categories of this paper are: nucl-ex
11
The categories of this paper are: hep-lat
30
The categories of this paper are: q-alg
10
The categories of this paper are: q-bio
26
The categories of this paper are: bayes-an
9
The categories of this paper are: nlin
8
The categories of this paper are: hep-ex
5
The categories of this paper are: gr-qc
12
The categories of this paper are: nucl-th
34
The categories of this paper are: chem-ph
33
The categories of this paper are: plasm-ph
35
The categories of this paper are: mtrl-th