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

The European Physical Journal B

Evolution of quantum strategies on a small-world network

Q. Li, Azhar Iqbal, M. Chen, Derek Abbott

Published Nov 1, 2012• 9 citations
Publisher
DOI
10.1140/epjb/e2012-30398-1

Related papers

Towards the World-Wide Quantum Network

Quoc‐Cuong Le, Patrick Bellot, Akim Demaille

Springer eBooks•Mar 13, 2008•9 citations

Quantum computing of delocalization in small-world networks

O. Giraud, Bertrand Georgeot, Dima L. Shepelyansky

We study a quantum small-world network with disorder and show that the system exhibits a delocalization transition. A quantum algorithm is built up which simulates the evolution operator of the model in a polynomial number of gates for an exponential number of vertices in the network. The total computational gain is shown to depend on the parameters of the network and a larger than quadratic speedup can be reached. We also investigate the robustness of the algorithm in presence of imperfections.

arXiv:quant-ph/0503188•Physical Review E•Sep 2, 2005•45 citations

Entanglement plays an important role in evolutionary generalized prisoner's dilemma game on small-world networks

Xi Yong, Hongliang Sun, Juan Li

Cooperation is a fundamental aspect of biological systems and human society. In this work, we propose a generalized prisoner's dilemma quantum game and study the game on Watts-Strogatz small-world network (WS model) with different values of entanglement. Here entanglement is used as a metaphor to study relationship between players. In a single step, each player has three strategies to choose: cooperation, defection and adopting a special quantum strategy first introduced by Eisert (denoted by Q). The person who chooses the quantum strategy Q can be regarded as a super cooperator. In prisoner's dilemma game, cooperation is very hard to emerge on relatively homogeneous networks, such as random graphs and WS model. Our experimental results show that in generalized prisoners dilemma quantum game, entanglement can guarantee emergence of super cooperators and greatly increase the payoff of the whole network. Even on homogeneous networks with very large inducement value(b is close to 2), the frequency of cooperators can still exceeds 70%. This work provides a new insight into understanding cooperation when considering the role of relationship between cooperators.

IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)•Oct 1, 2016•5 citations

Towards a global quantum network

Christoph Simon

arXiv:1710.11585•Nature Photonics•Oct 15, 2017•398 citations

Evolutionarily stable strategies in quantum games

A. Iqbal, A.H. Toor

arXiv:quant-ph/0007100•Physics Letters A•Mar 1, 2001•110 citations

Boosting Inference and Decision Making in Edge AI Networks Through Quantum Computing and Collective Dynamics of 'Small-World' Networks

Loveleen Kumar, S. B. G. Tilak Babu, Manesh Ramkrishna Palav +3 more

This research investigates a novel strategy to improve the capabilities of edge artificial intelligence networks to reach conclusions and make decisions. This is accomplished through the utilization of various computing methods and the utilization of the collaborative dynamics of ‘small world' networks. Because of resource constraints and complex data environments, traditional edge AI networks usually suffer limitations in processing power and decision delicacy. These limitations can be a source of frustration. The purpose of this investigation is to suggest a paradigm shift toward more efficient and significant calculation at the edge by using the concepts of amount calculation. Additionally, the study analyzes how collaborative relations among bumps can improve information propagation and decision agreement inside the network. This investigation is motivated by the geste of small-world networks. Through theoretical analysis and simulation trials, this chapter demonstrates the potential for this approach to significantly improve performance and scalability.

Advances in computational intelligence and robotics book series•Aug 2, 2024•0 citations
Cooperation is a fundamental aspect of biological systems and human society. In this work, we propose a generalized prisoner's dilemma quantum game and study the game on Watts-Strogatz small-world network (WS model) with different values of entanglement. Here entanglement is used as a metaphor to study relationship between players. In a single step, each player has three strategies to choose: cooperation, defection and adopting a special quantum strategy first introduced by Eisert (denoted by Q). The person who chooses the quantum strategy Q can be regarded as a super cooperator. In prisoner's dilemma game, cooperation is very hard to emerge on relatively homogeneous networks, such as random graphs and WS model. Our experimental results show that in generalized prisoners dilemma quantum game, entanglement can guarantee emergence of super cooperators and greatly increase the payoff of the whole network. Even on homogeneous networks with very large inducement value(b is close to 2), the frequency of cooperators can still exceeds 70%. This work provides a new insight into understanding cooperation when considering the role of relationship between cooperators.
This research investigates a novel strategy to improve the capabilities of edge artificial intelligence networks to reach conclusions and make decisions. This is accomplished through the utilization of various computing methods and the utilization of the collaborative dynamics of ‘small world' networks. Because of resource constraints and complex data environments, traditional edge AI networks usually suffer limitations in processing power and decision delicacy. These limitations can be a source of frustration. The purpose of this investigation is to suggest a paradigm shift toward more efficient and significant calculation at the edge by using the concepts of amount calculation. Additionally, the study analyzes how collaborative relations among bumps can improve information propagation and decision agreement inside the network. This investigation is motivated by the geste of small-world networks. Through theoretical analysis and simulation trials, this chapter demonstrates the potential for this approach to significantly improve performance and scalability.