Towards analyzing large graphs with quantum annealing

The use of quantum computing in graph community detection and regularity checking related to Szemerédi's Regularity Lemma (SRL) are demonstrated with D-Wave Systems' quantum annealer and simulations. We demonstrate the capability of quantum computing in solving hard problems relevant to big data. A new community detection algorithm based on SRL is also introduced and tested.