Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Improved success probability with greater circuit depth for the quantum
  approximate optimization algorithm   Present-day, noisy, small or intermediate-scale quantum processors---although
far from fault-tolerant---support the execution of heuristic quantum
algorithms, which might enable a quantum advantage, for example, when applied
to combinatorial optimization problems. On small-scale quantum processors,
validations of such algorithms serve as important technology demonstrators. We
implement the quantum approximate optimization algorithm (QAOA) on our hardware
platform, consisting of two superconducting transmon qubits and one
parametrically modulated coupler. We solve small instances of the NP-complete
exact-cover problem, with 96.6% success probability, by iterating the algorithm
up to level two.

31
The categories of this paper are: ao-sci
21
The categories of this paper are: adap-org
5
The categories of this paper are: gr-qc
12
The categories of this paper are: nucl-th
26
The categories of this paper are: bayes-an
29
The categories of this paper are: funct-an
33
The categories of this paper are: plasm-ph
11
The categories of this paper are: hep-lat
27
The categories of this paper are: comp-gas
24
The categories of this paper are: dg-ga
17
The categories of this paper are: q-fin
0
The categories of this paper are: hep-ph
34
The categories of this paper are: chem-ph
35
The categories of this paper are: mtrl-th
18
The categories of this paper are: econ
10
The categories of this paper are: q-bio