Towards analyzing large graphs with quantum annealing

Hannu Reittu (Corresponding author), Tomi Räty, Lasse Leskelä, Hannu Rummukainen, Tomi Räty

    Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

    2 Citations (Scopus)
    26 Downloads (Pure)


    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.
    Original languageEnglish
    Title of host publication2019 IEEE International Conference on Big Data, Big Data 2019
    EditorsChaitanya Baru, Jun Huan, Latifur Khan, Xiaohua Tony Hu, Ronay Ak, Yuanyuan Tian, Roger Barga, Carlo Zaniolo, Kisung Lee, Yanfang Fanny Ye
    PublisherIEEE Institute of Electrical and Electronic Engineers
    ISBN (Electronic)978-1-7281-0858-2
    ISBN (Print)978-1-7281-0859-9
    Publication statusPublished - 2019
    MoE publication typeA4 Article in a conference publication
    EventThe 2019 IEEE International Conference on Big Data - Los Angeles, United States
    Duration: 9 Dec 201912 Dec 2019


    ConferenceThe 2019 IEEE International Conference on Big Data
    Abbreviated titleIEEE BigData 2019
    Country/TerritoryUnited States
    CityLos Angeles
    Internet address



    • Quantum computing
    • quantum annealing
    • graph communitiy detection


    Dive into the research topics of 'Towards analyzing large graphs with quantum annealing'. Together they form a unique fingerprint.

    Cite this