# Towards analyzing large graphs with quantum annealing and quantum gate computers

arXiv: https://arxiv.org/abs/2006.16702 · HTML: https://mlsanity.com/paper/2006.16702/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 30 Jun 2020.

## Built on by (most cited first, 2 of 2)

- [NISQ-ready community detection based on separation-node identification](https://mlsanity.com/paper/2212.14717/) (2022)
- [A network community detection method with integration of data from multiple layers and node attributes](https://mlsanity.com/paper/2305.13012/) (2023)

## Abstract (arXiv)

The use of quantum computing in graph community detection and regularity checking related to Szemeredi'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. In worst case scenario of regularity check we use Grover's algorithm and quantum phase estimation algorithm, in order to speed-up computations using a quantum gate computers.