67,107 research outputs found
Quantum social networks
We introduce a physical approach to social networks (SNs) in which each actor
is characterized by a yes-no test on a physical system. This allows us to
consider SNs beyond those originated by interactions based on pre-existing
properties, as in a classical SN (CSN). As an example of SNs beyond CSNs, we
introduce quantum SNs (QSNs) in which actor is characterized by a test of
whether or not the system is in a quantum state. We show that QSNs outperform
CSNs for a certain task and some graphs. We identify the simplest of these
graphs and show that graphs in which QSNs outperform CSNs are increasingly
frequent as the number of vertices increases. We also discuss more general SNs
and identify the simplest graphs in which QSNs cannot be outperformed.Comment: REVTeX4, 6 pages, 3 figure
Community Detection in Quantum Complex Networks
Determining community structure is a central topic in the study of complex
networks, be it technological, social, biological or chemical, in static or
interacting systems. In this paper, we extend the concept of community
detection from classical to quantum systems---a crucial missing component of a
theory of complex networks based on quantum mechanics. We demonstrate that
certain quantum mechanical effects cannot be captured using current classical
complex network tools and provide new methods that overcome these problems. Our
approaches are based on defining closeness measures between nodes, and then
maximizing modularity with hierarchical clustering. Our closeness functions are
based on quantum transport probability and state fidelity, two important
quantities in quantum information theory. To illustrate the effectiveness of
our approach in detecting community structure in quantum systems, we provide
several examples, including a naturally occurring light-harvesting complex,
LHCII. The prediction of our simplest algorithm, semiclassical in nature,
mostly agrees with a proposed partitioning for the LHCII found in quantum
chemistry literature, whereas our fully quantum treatment of the problem
uncovers a new, consistent, and appropriately quantum community structure.Comment: 16 pages, 4 figures, 1 tabl
Cooperative quantum Parrondo's games
Coordination and cooperation are among the most important issues of game
theory. Recently, the attention turned to game theory on graphs and social
networks. Encouraged by interesting results obtained in quantum evolutionary
game analysis, we study cooperative Parrondo's games in a quantum setup. The
game is modeled using multidimensional quantum random walks with biased coins.
We use the GHZ and W entangled states as the initial state of the coins. Our
analysis shows than an apparent paradox in cooperative quantum games and some
interesting phenomena can be observed.Comment: 13 pages, 10 figure
Dynamical decoherence of a qubit coupled to a quantum dot or the SYK black hole
We study the dynamical decoherence of a qubit weakly coupled to a two-body
random interaction model (TBRIM) describing a quantum dot of interacting
fermions or the Sachdev-Ye-Kitaev (SYK) black hole model. We determine the
rates of qubit relaxation and dephasing for regimes of dynamical thermalization
of the quantum dot or of quantum chaos in the SYK model. These rates are found
to correspond to the Fermi golden rule and quantum Zeno regimes depending on
the qubit-fermion coupling strength. An unusual regime is found where these
rates are practically independent of TBRIM parameters. We push forward an
analogy between TBRIM and quantum small-world networks with an explosive
spreading over exponentially large number of states in a finite time being
similar to six degrees of separation in small-world social networks. We find
that the SYK model has approximately two-three degrees of separation.Comment: 17 pages, 15 pdf-figure
Google matrix analysis of directed networks
In past ten years, modern societies developed enormous communication and
social networks. Their classification and information retrieval processing
become a formidable task for the society. Due to the rapid growth of World Wide
Web, social and communication networks, new mathematical methods have been
invented to characterize the properties of these networks on a more detailed
and precise level. Various search engines are essentially using such methods.
It is highly important to develop new tools to classify and rank enormous
amount of network information in a way adapted to internal network structures
and characteristics. This review describes the Google matrix analysis of
directed complex networks demonstrating its efficiency on various examples
including World Wide Web, Wikipedia, software architecture, world trade, social
and citation networks, brain neural networks, DNA sequences and Ulam networks.
The analytical and numerical matrix methods used in this analysis originate
from the fields of Markov chains, quantum chaos and Random Matrix theory.Comment: 56 pages, 58 figures. Missed link added in network example of Fig3
Quantum Link Prediction in Complex Networks
Predicting new links in physical, biological, social, or technological
networks has a significant scientific and societal impact. Path-based link
prediction methods utilize explicit counting of even and odd-length paths
between nodes to quantify a score function and infer new or unobserved links.
Here, we propose a quantum algorithm for path-based link prediction, QLP, using
a controlled continuous-time quantum walk to encode even and odd path-based
prediction scores. Through classical simulations on a few real networks, we
confirm that the quantum walk scoring function performs similarly to other
path-based link predictors. In a brief complexity analysis we identify the
potential of our approach in uncovering a quantum speedup for path-based link
prediction.Comment: Keywords: Complex Networks, Quantum Algorithms, Link Prediction,
Social Networks, Protein-Protein Interaction Network
Finite-time Convergent Gossiping
Gossip algorithms are widely used in modern distributed systems, with
applications ranging from sensor networks and peer-to-peer networks to mobile
vehicle networks and social networks. A tremendous research effort has been
devoted to analyzing and improving the asymptotic rate of convergence for
gossip algorithms. In this work we study finite-time convergence of
deterministic gossiping. We show that there exists a symmetric gossip algorithm
that converges in finite time if and only if the number of network nodes is a
power of two, while there always exists an asymmetric gossip algorithm with
finite-time convergence, independent of the number of nodes. For nodes,
we prove that a fastest convergence can be reached in node
updates via symmetric gossiping. On the other hand, under asymmetric gossip
among nodes with , it takes at least node
updates for achieving finite-time convergence. It is also shown that the
existence of finite-time convergent gossiping often imposes strong structural
requirements on the underlying interaction graph. Finally, we apply our results
to gossip algorithms in quantum networks, where the goal is to control the
state of a quantum system via pairwise interactions. We show that finite-time
convergence is never possible for such systems.Comment: IEEE/ACM Transactions on Networking, In Pres
DQSSA: A Quantum-Inspired Solution for Maximizing Influence in Online Social Networks (Student Abstract)
Influence Maximization is the task of selecting optimal nodes maximising the
influence spread in social networks. This study proposes a Discretized
Quantum-based Salp Swarm Algorithm (DQSSA) for optimizing influence diffusion
in social networks. By discretizing meta-heuristic algorithms and infusing them
with quantum-inspired enhancements, we address issues like premature
convergence and low efficacy. The proposed method, guided by quantum
principles, offers a promising solution for Influence Maximisation. Experiments
on four real-world datasets reveal DQSSA's superior performance as compared to
established cutting-edge algorithms.Comment: AAAI Conference on Artificial Intelligence 202
- âŠ