Identifying community structures in complex networks is foundational to graph theory, but classical algorithms struggle with scalability and the "curse of dimensionality" in high-dimensional embedding, while existing quantum methods lack unified architectures or compatibility with practical hardware. Here we present Embedded Quantum Density-based Spatial Clustering (EQDSC), an end-to-end quantum framework for community detection with key theoretical and technical advances over state-of-the-art approaches: it integrates discrete-time quantum walks (DTQW) augmented with Grover diffusion operators for efficient topological feature extraction, and adopts quantum fidelity to quantify similarity—mitigating dimensionality issues inherently. We validated EQDSC on 11 real-world and synthetic datasets via Qiskit simulations. It achieved up to 0.855 modularity and 0.887 NMI (DBLP), outperforming classical methods by 18–35% on large networks. The achieved gains stem from quantum superposition and accelerated quantum walk diffusion, with small-dataset performance restricted by constrained parameter optimization. Simulated performance confirms practical applicability, laying the groundwork for future deployment on real NISQ devices.
Identifying community structures in complex networks is foundational to graph theory, but classical algorithms struggle with scalability and the "curse of dimensionality" in high-dimensional embedding, while existing quantum methods lack unified architectures or compatibility with practical hardware. Here we present Embedded Quantum Density-based Spatial Clustering (EQDSC), an end-to-end quantum framework for community detection with key theoretical and technical advances over state-of-the-art approaches: it integrates discrete-time quantum walks (DTQW) augmented with Grover diffusion operators for efficient topological feature extraction, and adopts quantum fidelity to quantify similarity—mitigating dimensionality issues inherently. We validated EQDSC on 11 real-world and synthetic datasets via Qiskit simulations. It achieved up to 0.855 modularity and 0.887 NMI (DBLP), outperforming classical methods by 18–35% on large networks. The achieved gains stem from quantum superposition and accelerated quantum walk diffusion, with small-dataset performance restricted by constrained parameter optimization. Simulated performance confirms practical applicability, laying the groundwork for future deployment on real NISQ devices.
Abstract The problem of detecting communities in real-world networks has been extensively studied in the past, but most of the existing approaches work on single-domain networks, i.e. they consider only one type of relationship between nodes. Single-domain networks may contain noisy edges and they may lack some important information. Thus, some authors have proposed to consider the multiple relationships that connect the nodes of a network, thus obtaining multi-domain networks. However, most community detection approaches are limited to multi-layer networks, i.e. networks generated from the superposition of several single-domain networks (called layers) that are regarded as independent of each other. In addition to being computationally expensive, multi-layer approaches might yield inaccurate results because they ignore potential dependencies between layers. This paper proposes a multi-domain discrete-time quantum walks (MDQW) model for multi-domain networks. First, the walking space of network nodes in multi-domain network is constructed. Second, the quantum permutation circuit of the coin state is designed based on the coded particle state. Then, using different coin states, the shift operator performs several quantum walks on the particles. Finally, the corresponding update rule is selected to move the node according to the measurement result of the quantum state. With continuous update iteration, the shift operator automatically optimizes the discovered community structure. We experimentally compared our MDQW method with four state-of-the-art competitors on five real datasets. We used the normalized mutual information (NMI) to compare clustering quality, and we report an increase in NMI of up to 3.51 of our MDQW method in comparison with the second-best performing competitor. The MDQW method is much faster than its competitors, allowing us to conclude that MDQW is a useful tool in the analysis of large real-life multi-domain networks. Finally, we illustrate the usefulness of our approach on two real-world case studies.
The article introduces Q-ClusterSim, a resource-efficient hybrid quantum-classical framework designed to accelerate clustering operations on large-scale and high-dimensional datasets. The proposed model combines quantum-enhanced k-means and density-based clustering within a unified quantum simulation environment to achieve improved computational efficiency and scalability. By leveraging the parallelism of quantum circuits and the adaptability of classical optimization, Q-ClusterSim significantly reduces execution time while maintaining clustering accuracy. Simulations are conducted using IBM Qiskit and TensorFlow Quantum on benchmark datasets, where the proposed model consistently outperforms classical clustering algorithms in terms of convergence speed, precision, and resource consumption. Results validate the model’s effectiveness in managing complex data structures under limited qubit resources, making it suitable for real-world large data applications. This study highlights the transformative potential of quantum-assisted clustering in reshaping future data analytics and computational intelligence paradigms..
In this research, the computational efficiency of large-scale social network analysis is enhanced by the use of quantum random walk algorithms. The goal of this project is to address the need for high-efficiency centralized analysis of large-scale, heterogeneous social networks, community discovery, and dynamic effect mapping. In a theoretically sound framework of quantum random walks, amplitude superposition and unitary evolution principles have been used to improve both the sensitivity to local and global aspects. The solution uses real social network data with up to 5,000 nodes and more than 60,000 edges, and the testing results demonstrate its excellent scalability and fast convergence. Quantum algorithms have discovered community divisions and cut the mixing time by roughly 2.3 times after multiple optimizations. The performance indicators demonstrate that the above method has greatly improved key node detection accuracy and computation time as compared to the conventional baseline model in noisy situations. According to the aforementioned research, quantum-inspired algorithms have been used to expedite the analysis of large-scale data and reveal hidden structures that are challenging to identify using conventional techniques, such as bridge nodes and core-periphery distributions. The research assist data-driven choices in digital social ecosystems and lay the groundwork for in-depth network analysis.
Learning of network embedding with vector-based node representation has attracted wide attention over the decade. It differs from the general setting of graph node embedding whereby the node attributes are also considered and yet may incur privacy issues. In this paper, we depart from the classic CPU/GPU architecture to consider the well-established network alignment problem based on network embedding, and develop a quantum machine learning approach with a low qubit cost for its near-future applicability on Noisy Intermediate-Scale Quantum (NISQ) devices. Specifically, our model adopts the discrete-time quantum walk (QW) and conducts the QW on the tailored merged network to extract structure information from the two aligning networks without the need for quantum state preparation which otherwise requires high quantum gate cost. Then the quantum states from QW are fed to a quantum embedding ansatz (i.e., parameterized circuit) to learn the latent representation of each node. The key part of our approach is to connect these two quantum modules to achieve a pure quantum paradigm without involving classical modules. To our best knowledge, there has not been any classic-quantum hybrid approach to network embedding, let alone a pure quantum paradigm being free from the bottleneck of communication between classic devices and quantum devices, which is still an open problem. Experimental results on two real-world datasets show the effectiveness of our quantum embedding approach in comparison with classical embedding approaches. Our model is readily and efficiently implemented in Python with a full-amplitude simulation of the QW and the quantum circuit. Therefore, our model can be readily deployed on an existing NISQ device with all the circuits provided, and only 13 qubits are needed in the experiments, which is rarely attained in existing quantum graph learning works.
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.
High-dimensional data presents significant challenges to traditional clustering algorithms due to the "curse of dimensionality," leading to sparsity issues, increased computational complexity, and reduced cluster quality. This research investigates the application of quantum-inspired algorithms to enhance clustering performance in these scenarios. We propose a novel clustering framework leveraging concepts from quantum annealing and quantum walks to efficiently explore the feature space and identify clusters. The core idea is to mimic the probabilistic and superposition properties of quantum systems within the clustering process, allowing for more nuanced exploration of potential cluster configurations. The algorithms are designed to mitigate the effects of dimensionality by introducing stochastic search strategies and exploiting correlations between features. We evaluate the effectiveness of these algorithms on benchmark datasets, demonstrating improved clustering accuracy and reduced computational cost compared to established classical methods. The research highlights the potential of quantum-inspired approaches as a viable solution for high-dimensional clustering problems.