Quantum social networks

TL;DR

This paper introduces quantum social networks where actors are characterized by quantum tests, demonstrating they outperform classical networks in certain tasks and revealing the increasing prevalence of such graphs with more vertices.

Contribution

The paper presents a novel quantum approach to social networks, showing quantum networks outperform classical ones in specific scenarios and analyzing graph properties related to this advantage.

Findings

QSNs outperform CSNs in certain tasks and graphs.

Graphs with quantum advantage become more common as vertices increase.

Identified graphs where QSNs cannot be outperformed.

Abstract

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.