A method for finding community structure in networks by casting modularity maximization as a Quadratic Unconstrained Binary Optimization (QUBO) problem and solving it with Simulated Bifurcation, a GPU-accelerated quantum-inspired Ising solver. Students learn how an NP-hard graph-partitioning objective is encoded in binary spin variables so it integrates directly with Ising-style hardware and algorithms, and how this classical quantum-inspired approach can match a Digital Annealer and outperform D-Wave and IBM quantum machines on benchmark networks.
Community detection, also known as graph partitioning, is a well-known NP-hard combinatorial optimization problem with applications in diverse fields such as complex network theory, transportation, a…