Detecting Multiple Communities Using Quantum Annealing on the D-Wave System

Abstract

A very important problem in combinatorial optimization is partitioning 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.

References in corpus (23)

• Fast unfolding of communities in large networks
• Community structure in social and biological networks
• Finding and evaluating community structure in networks
• Modularity and community structure in networks
• Community detection in graphs
• Finding community structure in very large networks
• Fast algorithm for detecting community structure in networks
• Cooperative Game Theory Approaches for Network Partitioning
• The large-scale organization of metabolic networks
• Functional cartography of complex metabolic networks
• Resolution limit in community detection
• Community detection in networks: A user guide
• Community detection in complex networks using Extremal Optimization
• The performance of modularity maximization in practical contexts
• The Anatomy of the Facebook Social Graph
• Optimization with Extremal Dynamics
• Eigenvector Centrality Distribution for Characterization of Protein Allosteric Pathways
• Demonstration of a scaling advantage for a quantum annealer over simulated annealing
• Dynamic portfolio strategy using clustering approach
• Graph-based linear scaling electronic structure theory
• Community Detection Across Emerging Quantum Architectures
• Task-based Parallel Computation of the Density Matrix in Quantum-based Molecular Dynamics using Graph Partitioning
• Multi-Community Detection in Signed Graphs Using Quantum Hardware

Cited by in corpus (27)

• The prospects of quantum computing in computational molecular biology
• A Tutorial on Formulating and Using QUBO Models
• Biology and medicine in the landscape of quantum advantages
• Layer VQE: A Variational Approach for Combinatorial Optimization on Noisy Quantum Computers
• Variational Quantum Eigensolver with Reduced Circuit Complexity
• Network Community Detection On Small Quantum Computers
• Understanding domain-wall encoding theoretically and experimentally
• Bidirectional quantum teleportation of even and odd coherent states through the multipartite Glauber coherent state: Theory and implementation
• Effective electromagnetic actions for Lorentz violating theories exhibiting the axial anomaly
• Networked Quantum Services
• Partitioning Dense Graphs with Hardware Accelerators
• Focusing on the Hybrid Quantum Computing -- Tabu Search Algorithm: new results on the Asymmetric Salesman Problem
• Rydberg-atom graphs for quadratic unconstrained binary optimization problems
• Quantum Isomer Search
• Agent-Q: Fine-Tuning Large Language Models for Quantum Circuit Generation and Optimization
• A QUBO formulation for top-$\tau$ eigencentrality nodes
• Binary matrix factorization on special purpose hardware
• Ising-Based Louvain Method: Clustering Large Graphs with Specialized Hardware
• Analyzing the Effectiveness of Quantum Annealing with Meta-Learning
• Mapping State Transition Susceptibility in Quantum Annealing
• A network community detection method with integration of data from multiple layers and node attributes
• NISQ-ready community detection based on separation-node identification
• Network structure and dynamics of effective models of non-equilibrium quantum transport
• Solving Large Break Minimization Problems in a Mirrored Double Round-robin Tournament Using Quantum Annealing
• Towards analyzing large graphs with quantum annealing and quantum gate computers
• Toward Computing Bounds for Ramsey Numbers Using Quantum Annealing
• Universal scaling hypothesis of quantum spatial search in complex networks