  Signed graphs serve as a primary tool for modelling social networks. They can
represent relationships between individuals (i.e., nodes) with the use of
signed edges. Finding communities in a signed graph is of great importance in
many areas, for example, targeted advertisement. We propose an algorithm to
detect multiple communities in a signed graph. Our method reduces the
multi-community detection problem to a quadratic binary unconstrained
optimization problem and uses state-of-the-art quantum or classical optimizers
to find an optimal assignment of each individual to a specific community.
