Quantum‐Inspired Genetic Algorithm for Influence Maximization on Social Networks

ABSTRACT The influence maximization (IM) problem focuses on identifying key nodes in social networks to maximize influence spread. IM is crucial in various applications such as viral marketing, information diffusion, advertisements, political campaigns, etc. Quantum‐inspired approaches enable the faster exploration of solutions. This work presents a quantum‐inspired genetic algorithm (QiGA) to address the IM problem. It maps the QiGA principles to solve the IM problem and proposes a novel strategy for encoding the influence diffusion rules using quantum circuits. This work evaluates the performance of the proposed algorithm against benchmark algorithms on synthetic and real‐world data sets. Experimental results demonstrate that the proposed algorithm outperforms existing algorithms on smaller networks and remains competitive in large‐scale networks. The execution time is acceptable, considering the quantum code is simulated on classical hardware. Thus, this research introduces quantum‐computing‐based QiGA algorithm to solve IM problem. Future research directions include implementing the algorithm on real quantum hardware and addressing IM using quantum computing‐based heuristics, such as node ranking, for further improvements.

Authors

Institutions

Publication Details

Journal
Concurrency and Computation Practice and Experience
Published
2025-10-22
DOI
https://doi.org/10.1002/cpe.70332
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Quantum‐Inspired Genetic Algorithm for Influence Maximization on Social Networks

Shashank Sheshar Singh, Kuldeep Singh, Sunil Kumar Meena, Sumit Kumar et al.
Concurrency and Computation Practice and Experience
Complex Network Analysis Techniques
article

Quantum‐Inspired Genetic Algorithm for Influence Maximization on Social Networks

Shashank Sheshar Singh, Kuldeep Singh, Sunil Kumar Meena, Sumit Kumar, Ram Kishan Dewangan, Dharmendra Kumar
article en

Abstract

ABSTRACT The influence maximization (IM) problem focuses on identifying key nodes in social networks to maximize influence spread. IM is crucial in various applications such as viral marketing, information diffusion, advertisements, political campaigns, etc. Quantum‐inspired approaches enable the faster exploration of solutions. This work presents a quantum‐inspired genetic algorithm (QiGA) to address the IM problem. It maps the QiGA principles to solve the IM problem and proposes a novel strategy for encoding the influence diffusion rules using quantum circuits. This work evaluates the performance of the proposed algorithm against benchmark algorithms on synthetic and real‐world data sets. Experimental results demonstrate that the proposed algorithm outperforms existing algorithms on smaller networks and remains competitive in large‐scale networks. The execution time is acceptable, considering the quantum code is simulated on classical hardware. Thus, this research introduces quantum‐computing‐based QiGA algorithm to solve IM problem. Future research directions include implementing the algorithm on real quantum hardware and addressing IM using quantum computing‐based heuristics, such as node ranking, for further improvements.

Concurrency and Computation Practice and ExperienceVol. 37(25-26)
University of Delhi (IN), Thapar Institute of Engineering & Technology (IN), Bennett University (IN), South Asian University (IN)
Openalex Percentile: Top 76%
Complex Network Analysis Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.