arXiv:1810.12484 · Advanced Quantum Technologies

Network Community Detection on Small Quantum Computers

Ruslan Shaydulin, Hayato Ushijima‐Mwesigwa, Ilya Safro, Susan M. Mniszewski, Yuri Alexeev

Published Jun 3, 2019• 57 citations

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.

DOI: 10.1002/qute.201900029

Related papers

Quantum Local Search for Graph Community Detection

Ruslan Shaydulin, Hayato Ushijima‐Mwesigwa, Ilya Safro +2 more

We present Quantum Local Search (QLS) approach and demonstrate its efficacy by applying it to the problem of community detection in real-world networks. QLS is a hybrid algorithm that combines a classical machine with a small quantum device. QLS starts with an initial solution and searches its neighborhood, iteratively trying to find a better candidate solution. One of the main challenges of the quantum computing in NISQ era is the small number of available qubits. QLS addresses this challenge by using the quantum device only for the neighborhood search, which can be restricted to be small enough to fit on near-term quantum device. We implement QLS for modularity maximization graph clustering using QAOA on IBM Q Experience as a quantum local solver. We demonstrate the potential for quantum acceleration by showing that existing state-of-the-art optimization solvers cannot find a good solution to the local problems quickly and provide an estimate of how larger quantum devices can improve the performance of QLS.

Bulletin of the American Physical SocietyMar 4, 20190 citations

Multilevel Combinatorial Optimization across Quantum Architectures

Hayato Ushijima-Mwesigwa, Ruslan Shaydulin, Christian F. A. Negre +3 more

Emerging quantum processors provide an opportunity to explore new approaches for solving traditional problems in the post Moore’s law supercomputing era. However, the limited number of qubits makes it infeasible to tackle massive real-world datasets directly in the near future, leading to new challenges in utilizing these quantum processors for practical purposes. Hybrid quantum-classical algorithms that leverage both quantum and classical types of devices are considered as one of the main strategies to apply quantum computing to large-scale problems. In this article, we advocate the use of multilevel frameworks for combinatorial optimization as a promising general paradigm for designing hybrid quantum-classical algorithms. To demonstrate this approach, we apply this method to two well-known combinatorial optimization problems, namely, the Graph Partitioning Problem, and the Community Detection Problem. We develop hybrid multilevel solvers with quantum local search on D-Wave’s quantum annealer and IBM’s gate-model based quantum processor. We carry out experiments on graphs that are orders of magnitude larger than the current quantum hardware size, and we observe results comparable to state-of-the-art solvers in terms of quality of the solution. Reproducibility : Our code and data are available at Reference [1].

arXiv:1910.09985ACM Transactions on Quantum ComputingFeb 13, 202157 citations

Multilevel Combinatorial Optimization Across Quantum Architectures

Hayato Ushijima‐Mwesigwa, Ruslan Shaydulin, Christian F. A. Negre +3 more

Emerging quantum processors provide an opportunity to explore new approaches for solving traditional problems in the Post Moore's law supercomputing era. However, the limited number of qubits makes it infeasible to tackle massive real-world datasets directly in the near future, leading to new challenges in utilizing these quantum processors for practical purposes. Hybrid quantum-classical algorithms that leverage both quantum and classical types of devices are considered as one of the main strategies to apply quantum computing to large-scale problems. In this paper, we advocate the use of multilevel frameworks for combinatorial optimization as a promising general paradigm for designing hybrid quantum-classical algorithms. In order to demonstrate this approach, we apply this method to two well-known combinatorial optimization problems, namely, the Graph Partitioning Problem, and the Community Detection Problem. We develop hybrid multilevel solvers with quantum local search on D-Wave's quantum annealer and IBM's gate-model based quantum processor. We carry out experiments on graphs that are orders of magnitudes larger than the current quantum hardware size and observe results comparable to state-of-the-art solvers.

Oct 1, 201915 citations

Towards Recommender Systems with Community Detection and Quantum Computing

Riccardo Nembrini, Costantino Carugno, Maurizio Ferrari Dacrema +1 more

After decades of being mainly confined to theoretical research, Quantum Computing is now becoming a useful tool for solving realistic problems. This work aims to experimentally explore the feasibility of using currently available quantum computers, based on the Quantum Annealing paradigm, to build a recommender system exploiting community detection. Community detection, by partitioning users and items into densely connected clusters, can boost the accuracy of non-personalized recommendation by assuming that users within each community share similar tastes. However, community detection is a computationally expensive process. The recent availability of Quantum Annealers as cloud-based devices, constitutes a new and promising direction to explore community detection, although effectively leveraging this new technology is a long-term path that still requires advancements in both hardware and algorithms. This work aims to begin this path by assessing the quality of community detection formulated as a Quadratic Unconstrained Binary Optimization problem on a real recommendation scenario. Results on several datasets show that the quantum solver is able to detect communities of comparable quality with respect to classical solvers, but with better speedup, and the non-personalized recommendation models built on top of these communities exhibit improved recommendation quality. The takeaway is that quantum computing, although in its early stages of maturity and applicability, shows promise in its ability to support new recommendation models and to bring improved scalability as technology evolves.

ACM Conference on Recommender Systems (RecSys)Sep 13, 202218 citations

Qubit‐Efficient Quantum Local Search for Combinatorial Optimization

Mikhail Podobrii, Viacheslav Kuzmin, Vladimir Voloshinov +2 more

ABSTRACT An essential component of many sophisticated metaheuristics for solving combinatorial optimization problems is some variation of a local search routine that iteratively searches for a better solution within a chosen set of immediate neighbors. The size of this set is limited due to the computational costs required to run the method on classical processing units. We present a qubit‐efficient variational quantum algorithm that implements a quantum version of local search with only qubits and, therefore, can potentially work with classically intractable neighborhood sizes. Increasing the amount of quantum resources employed in the algorithm allows for a larger neighborhood size, improving the quality of obtained solutions. This trade‐off is crucial for present and near‐term quantum devices characterized by a limited number of logical qubits. Numerically simulating our algorithm, we successfully solved the largest graph coloring instance that was tackled by a quantum method. This achievement highlights the algorithm's potential for solving large‐scale combinatorial optimization problems on near‐term quantum devices.

arXiv:2502.02245Advanced Quantum TechnologiesMar 1, 20261 citation

Detecting multiple communities using quantum annealing on the D-Wave system

Christian F. A. Negre, Hayato Ushijima‐Mwesigwa, Susan M. Mniszewski

A very important problem in combinatorial optimization is the partitioning of a network into communities of densely connected nodes; where the connectivity between nodes inside a particular community is large compared to the connectivity between nodes belonging to different ones. This problem is known as community detection, and has become very important in various fields of science including chemistry, biology and social sciences. The problem of community detection is a twofold problem that consists of determining the number of communities and, at the same time, finding those communities. This drastically increases the solution space for heuristics to work on, compared to traditional graph partitioning problems. In many of the scientific domains in which graphs are used, there is the need to have the ability to partition a graph into communities with the "highest quality" possible since the presence of even small isolated communities can become crucial to explain a particular phenomenon. We have explored community detection using the power of quantum annealers, and in particular the D-Wave 2X and 2000Q machines. It turns out that the problem of detecting at most two communities naturally fits into the architecture of a quantum annealer with almost no need of reformulation. This paper addresses a systematic study of detecting two or more communities in a network using a quantum annealer.

arXiv:1901.09756PLoS ONEFeb 13, 202080 citations