← Back to papers
Towards analyzing large graphs with quantum annealing
H. Reittu, Ville Kotovirta, Lasse Leskelä, H. Rummukainen, Tomi D. Räty·December 1, 2019·DOI: 10.1109/BigData47090.2019.9006174
Computer SciencePhysicsMathematics
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
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.