A very important problem in combinatorial optimization is partitioning a network into communities of densely connected nodes; where the connectivity between nodes inside a particular community is large compared to the connectivity between nodes belonging to different ones. This problem is known as community detection, and has become very important in various fields of science including chemistry, biology and social sciences...This paper addresses a systematic study of detecting two or more communities in a network using a quantum annealer.