Network Community Detection on Small Quantum Computers. Issue 9 (3rd June 2019)

• Record Type: Journal Article
• Authors: Shaydulin, Ruslan; Ushijima‐Mwesigwa, Hayato; Safro, Ilya; Mniszewski, Susan; Alexeev, Yuri
• Is Part Of: Advanced quantum technologies. Volume 2:Issue 9(2019)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2019-06-03
• Subjects: graph clustering -- quantum annealing -- quantum approximate optimization algorithm; Quantum theory -- Periodicals; Quantum computing -- Periodicals; Quantum chemistry -- Periodicals; Quantum electronics -- Periodicals; 537.5
• DOI: 10.1002/qute.201900029
• Languages: English
• ISSNs: 2511-9044

Abstract

Abstract: In recent years, a number of quantum computing devices with small numbers of qubits have become available. A hybrid quantum local search (QLS) approach that combines a classical machine and a small quantum device to solve problems of practical size is presented. The proposed approach is applied to the network community detection problem. QLS is hardware‐agnostic and easily extendable to new quantum computing devices as they become available. It is demonstrated to solve the 2‐community detection problem on graphs of sizes of up to 410 vertices using the 16‐qubit IBM quantum computer and D‐Wave 2000Q, and compare their performance with the optimal solutions. The results herein demonstrate that QLS performs similarly in terms of quality of the solution and the number of iterations to convergence on both types of quantum computers and it is capable of achieving results comparable to state‐of‐the‐art solvers in terms of quality of the solution including reaching the optimal solutions. Abstract : A hybrid quantum local search (QLS) approach is described. QLS combines a classical machine and a small quantum device. The proposed approach is applied to the network community detection problem to solve the underlying optimization models on graphs of sizes up to 410 vertices using the 16‐qubit IBM quantum computer and D‐Wave 2000Q.