Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Communications in computer and information science

Quantum Simulations: A New Frontier for Influence Maximization in Social Networks

Sunil Kumar Meena, Shashank Sheshar Singh, Yogendra Meena, Kuldeep Singh

Published Jan 1, 2025• 0 citations
Publisher
DOI
10.1007/978-981-96-6963-9_27

Related papers

Quantum Social Computing Approaches for Influence Maximization

Thang N. Dinh, An Nhu Nguyen, Uyen Nguyen +1 more

Influence Maximization (IM), which seeks a small set of important nodes that spread the influence widely into the network, is a fundamental problem in social networks. It finds applications in viral marketing, epidemic control, and assessing cascading failures within complex systems. Despite the huge amount of effort, finding near-optimal solutions for IM is difficult due to its NP-completeness. In this paper, we propose the first social quantum computing approaches for IM, aiming to retrieve near-optimal solutions. We propose a two-phase algorithm that 1) converts IM into a Max-Cover instance and 2) provides efficient quadratic unconstrained binary optimization formulations to solve the Max-Cover instance on quantum annealers. Our experiments on the state-of-the-art D-Wave annealer indicate better solution quality compared to classical simulated annealing, suggesting the potential of applying quantum annealing to find high-quality solutions for IM.

Globecom•Dec 4, 2022•8 citations

Quantum Decision Making by Social Agents

Vyacheslav I. Yukalov, Didier Sornette

•Jan 1, 2012•8 citations

Quantum social network analysis: Methodology, implementation, challenges, and future directions

Shashank Sheshar Singh, Sumit Kumar, Sunil Kumar Meena +3 more

Information Fusion•Nov 26, 2024•25 citations

Social Utility Maximization via Entanglement Connection Provisioning in Quantum Networks

X G 晓光 Wang 王, Yangming Zhao, Hongli Xu +3 more

From the perspective of user experience, when optimizing resource provisioning in networks, we have to maximize social utility, which is an abstraction of what users can obtain from the service provided by a network. In quantum networks, unlike their counterparts, circuit-switched classical networks, (i) the utility obtained by a demand is not always concave for the number of Entanglement Connections (ECs) we provision to it; and (ii) each demand requires a different amount of quantum resources over each link along the path to establish an EC. As a result, the Social Utility Maximization (SUM) problem is more challenging than in classic circuit-switched networks. In this paper, we propose an approach also called SUM to maximize social utility in quantum networks by provisioning an appropriate number of ECs (and corresponding resources) to demands. We first formulate the SUM problem and analyze it based on Lagrangian relaxation and duality techniques. Accordingly, we derive the optimal EC provisioning scheme for a given Lagrangian multiplier, depending on whether the utility function of each demand is convex, concave, or sigmoid-like. After that, a primal-dual iteration algorithm is proposed to determine the optimal EC provisioning scheme to maximize social utility. We conduct extensive simulations to demonstrate that SUM outperforms the state-of-the-art approach to maximizing quantum network throughput,i.e., EFiRAP, by up to 58.4%.

IEEE Journal on Selected Areas in Communications•Jan 1, 2026•0 citations

From Spin States to Socially Integrated Ising Models: Proposed Applications of Graph States, Stabilizer States, Toric States to Opinion Dynamics

Yasuko Kawahata

Recent research has developed the Ising model from physics, especially statistical mechanics, and it plays an important role in quantum computing, especially quantum annealing and quantum Monte Carlo methods. The model has also been used in opinion dynamics as a powerful tool for simulating social interactions and opinion formation processes. Individual opinions and preferences correspond to spin states, and social pressure and communication dynamics are modeled through interactions between spins. Quantum computing makes it possible to efficiently simulate these interactions and analyze more complex social networks.Recent research has incorporated concepts from quantum information theory such as Graph State, Stabilizer State, and Surface Code (or Toric Code) into models of opinion dynamics. The incorporation of these concepts allows for a more detailed analysis of the process of opinion formation and the dynamics of social networks. The concepts lie at the intersection of graph theory and quantum theory, and the use of Graph State in opinion dynamics can represent the interdependence of opinions and networks of influence among individuals. It helps to represent the local stability of opinions and the mechanisms for correcting misunderstandings within a social network. It allows us to understand how individual opinions are subject to social pressures and cultural influences and how they change over time.Incorporating these quantum theory concepts into opinion dynamics allows for a deeper understanding of social interactions and opinion formation processes. Moreover, these concepts can provide new insights not only in the social sciences, but also in fields as diverse as political science, economics, marketing, and urban planning.

arXiv:2312.00862•Dec 1, 2023•0 citations

Quantum-assisted graph networks: Algorithmic innovations and optimization strategies for large scale social communities

Pronaya Bhattacharya, Ashwin Verma

Elsevier eBooks•Jan 1, 2025•3 citations
Influence Maximization (IM), which seeks a small set of important nodes that spread the influence widely into the network, is a fundamental problem in social networks. It finds applications in viral marketing, epidemic control, and assessing cascading failures within complex systems. Despite the huge amount of effort, finding near-optimal solutions for IM is difficult due to its NP-completeness. In this paper, we propose the first social quantum computing approaches for IM, aiming to retrieve near-optimal solutions. We propose a two-phase algorithm that 1) converts IM into a Max-Cover instance and 2) provides efficient quadratic unconstrained binary optimization formulations to solve the Max-Cover instance on quantum annealers. Our experiments on the state-of-the-art D-Wave annealer indicate better solution quality compared to classical simulated annealing, suggesting the potential of applying quantum annealing to find high-quality solutions for IM.
From the perspective of user experience, when optimizing resource provisioning in networks, we have to maximize social utility, which is an abstraction of what users can obtain from the service provided by a network. In quantum networks, unlike their counterparts, circuit-switched classical networks, (i) the utility obtained by a demand is not always concave for the number of Entanglement Connections (ECs) we provision to it; and (ii) each demand requires a different amount of quantum resources over each link along the path to establish an EC. As a result, the Social Utility Maximization (SUM) problem is more challenging than in classic circuit-switched networks. In this paper, we propose an approach also called SUM to maximize social utility in quantum networks by provisioning an appropriate number of ECs (and corresponding resources) to demands. We first formulate the SUM problem and analyze it based on Lagrangian relaxation and duality techniques. Accordingly, we derive the optimal EC provisioning scheme for a given Lagrangian multiplier, depending on whether the utility function of each demand is convex, concave, or sigmoid-like. After that, a primal-dual iteration algorithm is proposed to determine the optimal EC provisioning scheme to maximize social utility. We conduct extensive simulations to demonstrate that SUM outperforms the state-of-the-art approach to maximizing quantum network throughput,i.e., EFiRAP, by up to 58.4%.
Recent research has developed the Ising model from physics, especially statistical mechanics, and it plays an important role in quantum computing, especially quantum annealing and quantum Monte Carlo methods. The model has also been used in opinion dynamics as a powerful tool for simulating social interactions and opinion formation processes. Individual opinions and preferences correspond to spin states, and social pressure and communication dynamics are modeled through interactions between spins. Quantum computing makes it possible to efficiently simulate these interactions and analyze more complex social networks.Recent research has incorporated concepts from quantum information theory such as Graph State, Stabilizer State, and Surface Code (or Toric Code) into models of opinion dynamics. The incorporation of these concepts allows for a more detailed analysis of the process of opinion formation and the dynamics of social networks. The concepts lie at the intersection of graph theory and quantum theory, and the use of Graph State in opinion dynamics can represent the interdependence of opinions and networks of influence among individuals. It helps to represent the local stability of opinions and the mechanisms for correcting misunderstandings within a social network. It allows us to understand how individual opinions are subject to social pressures and cultural influences and how they change over time.Incorporating these quantum theory concepts into opinion dynamics allows for a deeper understanding of social interactions and opinion formation processes. Moreover, these concepts can provide new insights not only in the social sciences, but also in fields as diverse as political science, economics, marketing, and urban planning.