Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Max Independent Set and Quantum Alternating Operator Ansatz   The maximum independent set (MIS) problem of graph theory using the quantum
alternating operator ansatz is studied. We perform simulations on the Rigetti
Forest simulator for the square ring, $K_{2,3}$, and $K_{3,3}$ graphs and
analyze the dependence of the algorithm on the depth of the circuit and initial
states. The probability distribution of observation of the feasible states
representing maximum independent sets is observed to be asymmetric for the MIS
problem, which is unlike the Max-Cut problem where the probability distribution
of feasible states is symmetric. For asymmetric graphs it is shown that the
algorithm clearly favors the independent set with the larger number of elements
even for finite circuit depth. We also compare the approximation ratios for the
algorithm when we choose different initial states for the square ring graph and
show that it is dependent on the choice of the initial state.

7
The categories of this paper are: hep-th
28
The categories of this paper are: alg-geom
9
The categories of this paper are: nlin
22
The categories of this paper are: chao-dyn
24
The categories of this paper are: dg-ga
17
The categories of this paper are: q-fin
32
The categories of this paper are: atom-ph
4
The categories of this paper are: cond-mat
37
The categories of this paper are: supr-con
33
The categories of this paper are: plasm-ph
36
The categories of this paper are: cmp-lg
3
The categories of this paper are: physics
0
The categories of this paper are: hep-ph
18
The categories of this paper are: econ
5
The categories of this paper are: gr-qc
19
The categories of this paper are: eess