Towards analyzing large graphs with quantum annealing and quantum gate computers
Emerging Technologies
2020-07-01 v1 Machine Learning
Quantum Physics
Machine Learning
Abstract
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.
Keywords
Cite
@article{arxiv.2006.16702,
title = {Towards analyzing large graphs with quantum annealing and quantum gate computers},
author = {Hannu Reittu and Ville Kotovirta and Lasse Leskelä and Hannu Rummukainen and Tomi Räty},
journal= {arXiv preprint arXiv:2006.16702},
year = {2020}
}
Comments
Extended version of a conference paper, IEEE BigData 2019, Los Angeles U.S.A. International Journal of Data Mining Science (IJDAT), 2020